$$b$$ b -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Crossref DOI link: https://doi.org/10.1007/s00453-014-9921-5
Published Online: 2014-08-02
Published Print: 2015-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bonomo, Flavia
Schaudt, Oliver
Stein, Maya
Valencia-Pabon, Mario
Text and Data Mining valid from 2014-08-02