List-coloring graphs without K₄,k-minors

DOI10.1016/J.DAM.2008.08.015MaRDI QIDQ1028458zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi

Publication date 30 June 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.08.015

zbMATH Keywords

Hadwiger's conjecturelist-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Recommendations

• Connectivity and choosability of graphs with no \(K_t\) minor
• Precoloring extension forK₄-minor-free graphs
• Linear list \(r\)-hued coloring of \(K_4\)-minor free graphs.
• List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
• 5-coloring \(K_{3,k}\)-minor-free graphs

Cites work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A relaxed Hadwiger's conjecture for list colorings
• An extremal function for contractions of graphs
• 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
• Defective choosability of graphs with no edge-plus-independent-set minor
• Every planar graph is 5-choosable
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Extremal functions for rooted minors
• Extremal results for rooted minor problems
• Forcing unbalanced complete bipartite minors
• Graph minors. IX: Disjoint crossed paths
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• scientific article; zbMATH DE number 4134069 (Why is no real title available?)
• scientific article; zbMATH DE number 3865318 (Why is no real title available?)
• scientific article; zbMATH DE number 52938 (Why is no real title available?)
• scientific article; zbMATH DE number 1156585 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Linear connectivity forces large complete bipartite minors
• List colourings of graphs
• List colourings of planar graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• Rooted minor problems in highly connected graphs
• The extremal function for complete minors
• The extremal function for noncomplete minors
• The extremal function for unbalanced bipartite minors
• The four-colour theorem
• Vertex partitions of \(K_{4,4}\)-minor free graphs
• Über eine Eigenschaft der ebenen Komplexe

Cited in

(7)

• On group choosability of graphs. II
• Connectivity and choosability of graphs with no \(K_t\) minor
• Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
• List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
• 5-coloring \(K_{3,k}\)-minor-free graphs
• On the choosability of \(H\)-minor-free graphs
• Coloring algorithms for \(K_ 5\)-minor free graphs

This page was built for publication: List-coloring graphs without \(K_{4,k}\)-minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028458)