More about subcolorings

H.J. Broersma, F.V. Fomin, J. Nešetril, G.J. Woeginger

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)

    Abstract

    A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings. On the negative side, we prove that 2-subcoloring is NP-hard for comparability graphs, and that 3-subcoloring is NP-hard for AT-free graphs and for complements of planar graphs. On the positive side, we derive polynomial time algorithms for 2-subcoloring of complements of planar graphs, and for r-subcoloring of interval and of permutation graphs. Moreover, we prove asymptotically best possible upper bounds on the subchromatic number of interval graphs, chordal graphs, and permutation graphs in terms of the number of vertices.
    Original languageEnglish
    Title of host publicationProceedings of the 28th Workshop on Graph-Theoretic Concepts in Computer Science (WG'02, Cseky Krumlov, Czech Republic, June 13-15, 2002)
    Place of PublicationBerlin
    PublisherSpringer
    Pages68-79
    ISBN (Print)978-3-540-00331-1
    DOIs
    Publication statusPublished - 2002

    Publication series

    NameLecture Notes in Computer Science
    Volume2573
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'More about subcolorings'. Together they form a unique fingerprint.

    Cite this