A relaxed Hadwiger's conjecture for list colorings

DOI10.1016/j.jctb.2006.11.002zbMath1123.05039OpenAlexW2027399467MaRDI QIDQ885300

Bojan Mohar, Ken-ichi Kawarabayashi

Publication date: 8 June 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.11.002

zbMATH Keywords

Hadwiger's conjecturelist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Clustered colouring of graph classes with bounded treedepth or pathwidth, Improved bound for improper colourings of graphs with no odd clique minor, Improved lower bound for the list chromatic number of graphs with no K_t minor, A Relative of Hadwiger's Conjecture, Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs, Disproof of the group coloring version of the Hadwiger conjecture, Some recent progress and applications in graph minor theory, Clustered variants of Hajós' conjecture, Graph coloring with no large monochromatic components, Subgraphs of large connectivity and chromatic number, Local Hadwiger's conjecture, Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, Partitioning \(H\)-minor free graphs into three subgraphs with no large components, Partitioning \(H\)-minor free graphs into three subgraphs with no large components, On group choosability of graphs. II, Contractibility and the Hadwiger conjecture, A Weakening of the Odd Hadwiger's Conjecture, Improper colouring of graphs with no odd clique minor, Hadwiger’s Conjecture, Linear connectivity forces large complete bipartite minors, List-coloring graphs without \(K_{4,k}\)-minors, Colouring Planar Graphs With Three Colours and No Large Monochromatic Components, Immersion and clustered coloring, Connectivity and choosability of graphs with no \(K_t\) minor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• Linear connectivity forces large complete bipartite minors
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• The four-colour theorem
• The extremal function for complete minors
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
• An extremal function for contractions of graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs