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]
No references recorded for this publication.
No citations of this publication recorded.