Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon. b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica, 73(2):289-305, 2015. [doi]
@article{BonomoSSV15,
title = {b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs},
author = {Flavia Bonomo and Oliver Schaudt and Maya Stein and Mario Valencia-Pabon},
year = {2015},
doi = {10.1007/s00453-014-9921-5},
url = {http://dx.doi.org/10.1007/s00453-014-9921-5},
researchr = {https://researchr.org/publication/BonomoSSV15},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {73},
number = {2},
pages = {289-305},
}