-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Flavia Bonomo-Braberman

2015, Algorithmica 73, 289-305, 2015
Citas: 5

Publicaciones que citan a este paper