作者: Hajo Broersma , Fedor V. Fomin , Jaroslav Nešetřil , Gerhard J. Woeginger
关键词:
摘要: A subcoloring is a vertex coloring of graph in which every color class induces disjoint union cliques. We derive number results on the combinatorics, algorithmics, and complexity subcolorings.On negative side, we prove that 2-subcoloring NP-hard for comparability graphs, 3-subcoloring AT-free graphs complements planar graphs. On positive polynomial time algorithms r-subcoloring interval permutation Moreover, asymptotically best possible upper bounds subchromatic chordal terms vertices.