Complexity of coloring graphs without forbidden induced subgraphs

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

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

107 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages254-262
Number of pages9
Volume2204
ISBN (Print)3540427074, 9783540427070
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Forbidden Induced Subgraph
Graph Coloring
Coloring
Polynomials
Forbidden Subgraph
Graph in graph theory
Colouring
NP-complete problem
Polynomial

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Král, D., Kratochvíl, J., Tuza, Z., & Woeginger, G. J. (2001). Complexity of coloring graphs without forbidden induced subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2204, pp. 254-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2204). Springer Verlag.

Complexity of coloring graphs without forbidden induced subgraphs. / Král, Daniel; Kratochvíl, Jan; Tuza, Z.; Woeginger, Gerhard J.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2204 Springer Verlag, 2001. p. 254-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2204).

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

Král, D, Kratochvíl, J, Tuza, Z & Woeginger, GJ 2001, Complexity of coloring graphs without forbidden induced subgraphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2204, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2204, Springer Verlag, pp. 254-262, 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, Boltenhagen, Germany, 6/14/01.
Král D, Kratochvíl J, Tuza Z, Woeginger GJ. Complexity of coloring graphs without forbidden induced subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2204. Springer Verlag. 2001. p. 254-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Král, Daniel ; Kratochvíl, Jan ; Tuza, Z. ; Woeginger, Gerhard J. / Complexity of coloring graphs without forbidden induced subgraphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2204 Springer Verlag, 2001. pp. 254-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f3c998681c594c24bad16ff8ceaa3b2c,
title = "Complexity of coloring graphs without forbidden induced subgraphs",
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.",
author = "Daniel Kr{\'a}l and Jan Kratochv{\'i}l and Z. Tuza and Woeginger, {Gerhard J.}",
year = "2001",
language = "English",
isbn = "3540427074",
volume = "2204",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--262",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Complexity of coloring graphs without forbidden induced subgraphs

AU - Král, Daniel

AU - Kratochvíl, Jan

AU - Tuza, Z.

AU - Woeginger, Gerhard J.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84945244878&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945244878&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84945244878

SN - 3540427074

SN - 9783540427070

VL - 2204

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 254

EP - 262

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -