More about subcolorings

Haitze J. Broersma, F.V. Fomin, J. Nešetřil, Gerhard Woeginger

Research output: Book/ReportReportOther research output

47 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2002

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-94C15
  • MSC-05C78
  • MSC-05C15
  • IR-65822
  • MSC-68W25
  • EWI-3455
  • MSC-68R10

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

  • Cite this

    Broersma, H. J., Fomin, F. V., Nešetřil, J., & Woeginger, G. (2002). More about subcolorings. (Memorandum; No. 1635). Enschede: University of Twente, Department of Applied Mathematics.