Another proof of the 5-choosability of \(K_5\)-minor-free graphs

DOI10.1016/J.DISC.2007.07.089zbMath1155.05023OpenAlexW1978082980MaRDI QIDQ932663

Wenjie He, Wenjing Miao, Yu-fa Shen

Publication date: 11 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.089

zbMATH Keywords

planar graphchoosabilitylist coloringWagner graph\(K_5\)-minor-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (5)

Improved lower bound for the list chromatic number of graphs with no K_t minor ⋮ An extension of Thomassen's result on choosability ⋮ On group choosability of graphs. II ⋮ Contractibility and the Hadwiger conjecture ⋮ The Alon-Tarsi number of \(K_5\)-minor-free graphs

Cites Work

• Every planar graph is 5-choosable
• Choosability of \(K_5\)-minor-free graphs
• Über eine Eigenschaft der ebenen Komplexe
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Another proof of the 5-choosability of \(K_5\)-minor-free graphs