Complexity of coloring graphs without forbidden induced subgraphs

Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

112 Citations (Scopus)

Abstract

We give a complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete. We further initiate a study of this problem for two forbidden subgraphs.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001, Proceedings
EditorsAndreas Brandstadt, Van Bang Le
PublisherSpringer Verlag
Pages254-262
Number of pages9
ISBN (Print)3540427074, 9783540427070
DOIs
Publication statusPublished - Jan 1 2001
Event27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 - Boltenhagen, Germany
Duration: Jun 14 2001Jun 16 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2204
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001
CountryGermany
CityBoltenhagen
Period6/14/016/16/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Complexity of coloring graphs without forbidden induced subgraphs'. Together they form a unique fingerprint.

  • Cite this

    Král, D., Kratochvíl, J., Tuza, Z., & Woeginger, G. J. (2001). Complexity of coloring graphs without forbidden induced subgraphs. In A. Brandstadt, & V. B. Le (Eds.), Graph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001, Proceedings (pp. 254-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2204). Springer Verlag. https://doi.org/10.1007/3-540-45477-2_23