Journal article
Totally odd K-4-subdivisions in 4-chromatic graphs
In
Combinatorica
—
2001, Volume 21, Issue 3, pp. 217-443
Abstract
We prove the conjecture made by Bjarne Toft in 1975 that every 4-chromatic graph contains a subdivision of K-4 in which each edge of K-4 corresponds to a path of odd length. As an auxiliary result we characterize completely the subspace of the cycle space generated by all cycles through two fixed edges.
Toft's conjecture was proved independently in 1995 by Wenan Zang.
| Language: | English |
|---|---|
| Publisher: | Bolyai Society – Springer-Verlag |
| Year: | 2001 |
| Pages: | 217-443 |
| Journal subtitle: | An International Journal on Combinatorics and the Theory of Computing |
| ISSN: | 14396912 and 02099683 |
| Types: | Journal article |
| DOI: | 10.1007/s004930100006 |
| ORCIDs: | Thomassen, Carsten |
