Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-CographsFlavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon. iscopt 2014: 100-111 [doi]
The following publications are possibly variants of this publication: