Another proof of the 5-choosability of K₅-minor-free graphs

DOI10.1016/J.DISC.2007.07.089zbMATH Open1155.05023OpenAlexW1978082980MaRDI QIDQ932663FDOQ932663

Authors: Wenjie He, Wenjing Miao, Yufa 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

Recommendations

• Choosability of \(K_5\)-minor-free graphs
• Choosability of planar graphs
• An extension of Thomassen's result on choosability
• Thomassen's choosability argument revisited
• Every planar graph is 5-choosable

zbMATH Keywords

list coloringchoosabilityplanar graphWagner 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)

Cites Work

• Über eine Eigenschaft der ebenen Komplexe
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every planar graph is 5-choosable
• Multicriterial graph problems with MAXMIN criterion
• Choosability of \(K_5\)-minor-free graphs

Cited In (7)

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

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

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