Complexity of coloring graphs without forbidden subgraphs

Daniel Král, Jan Kratochvil, Zsolt Tuza, Gerhard Woeginger

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

122 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
Subtitle of host publication27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings
EditorsAndreas Brandstädt, Van Bang Le
Place of PublicationBerlin
PublisherSpringer
Pages254-262
ISBN (Electronic)978-3-540-45477-9
ISBN (Print)978-3-540-42707-0
DOIs
Publication statusPublished - 2001
Event27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 - Boltenhagen, Germany
Duration: 14 Jun 200116 Jun 2001
Conference number: 27

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume2204
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001
Abbreviated titleWG
CountryGermany
CityBoltenhagen
Period14/06/0116/06/01

Keywords

  • METIS-203194

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

Cite this