Deletion and editing to RBMGs are NP-hard; 2-colored editing is FPT via bicluster editing reduction; modification to hierarchically colored cographs is NP-complete.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2019 2verdicts
UNVERDICTED 2representative citing papers
Greedy colorings are a special case of hierarchical colorings in cographs, both using no more than χ(G) colors.
citing papers explorer
-
Complexity of Modification Problems for Reciprocal Best Match Graphs
Deletion and editing to RBMGs are NP-hard; 2-colored editing is FPT via bicluster editing reduction; modification to hierarchically colored cographs is NP-complete.
-
Hierarchical Colorings of Cographs
Greedy colorings are a special case of hierarchical colorings in cographs, both using no more than χ(G) colors.