b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Flavia Bonomo' in GoogleThis author has not been identified. Look up 'Oliver Schaudt' in GoogleThis author has not been identified. Look up 'Maya Stein' in GoogleThis author has not been identified. Look up 'Mario Valencia-Pabon' in Google

runs on WebDSL