Journal title
Journal of Combinatorial Theory. Series B
DOI
10.1016/j.jctb.2015.10.002
Volume
121
Last updated
2025-05-04T21:35:49.527+01:00
Page
68-84
Abstract
© 2015 Elsevier Inc.An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985, A. Gyárfás made the conjecture that for all t there exists n such that every graph with no Kt subgraph and no odd hole is n-colourable. We prove this conjecture.
Symplectic ID
632956
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
01 Nov 2016