2-subcoloring is NP-complete for planar comparability graphs
Discrete Mathematics
2017-02-07 v1
Abstract
A -subcoloring of a graph is a partition of the vertex set into at most cluster graphs, that is, graphs with no induced . 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs, namely triangle-free planar graphs with maximum degree 4, planar perfect graphs with maximum degree 4, and planar graphs with girth 5. We show that 2-subcoloring is also NP-complete for planar comparability graphs with maximum degree 4.
Cite
@article{arxiv.1702.01283,
title = {2-subcoloring is NP-complete for planar comparability graphs},
author = {Pascal Ochem},
journal= {arXiv preprint arXiv:1702.01283},
year = {2017}
}