A relaxed Hadwiger's Conjecture for list colorings
Authors:
- Ken-Ichi KawarabayashiKKKen-Ichi Kawarabayashi
- Bojan MoharBMBojan Mohar
- 1 July 2007
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 97 (4) , 647-651
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs2006
- Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A MinorCombinatorica, 2005
- The Extremal Function for Complete MinorsJournal of Combinatorial Theory, Series B, 2001
- The Four-Colour TheoremJournal of Combinatorial Theory, Series B, 1997
- Hadwiger's conjecture forK 6-free graphsCombinatorica, 1993
- Lower bound of the hadwiger number of graphs by their average degreeCombinatorica, 1984
- An extremal function for contractions of graphsMathematical Proceedings of the Cambridge Philosophical Society, 1984
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Every planar map is four colorable. Part II: ReducibilityIllinois Journal of Mathematics, 1977
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952