@inproceedings{e1dff730e3394f5e8d076b3c5f931d56,
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 = "D. Kr{\'a}l and J. Kratochvil and Zs. Tuza and G.J. Woeginger",
year = "2001",
doi = "10.1007/3-540-45477-2_23",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "254--262",
editor = "A. Brandst{\"a}dt and V.B. Le",
booktitle = "Graph-Theoretic Concepts in Computer Science (Proceedings 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001)",
address = "Germany",
}