Journal article
Color-critical graphs on a fixed surface
Let S be an orientable surface other than the sphere and letkbe a natural number. Then there are infinitely manyk-color-critical graphs onSif and only if 3⩽k⩽5. In particular, ifk⩾5, then there exists a polynomially bounded algorithm for deciding if a graph onScan bek-colored. We extend this to the case where a subgraph of fixed cardinality is precolored.
We also establish a corresponding list-color theorem.
Language: | English |
---|---|
Year: | 1997 |
Pages: | 67-100 |
ISSN: | 10960902 and 00958956 |
Types: | Journal article |
DOI: | 10.1006/jctb.1996.1722 |
ORCIDs: | Thomassen, Carsten |