Article contents
Minors in Graphs with High Chromatic Number
Published online by Cambridge University Press: 13 April 2011
Abstract
We develop lower bounds on the Hadwiger number h(G) of graphs G with high chromatic number. In particular, if G has n vertices and chromatic number k then h(G) ≥ (4k − n)/3.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2011
References
- 1
- Cited by