Choosability of \(K_5\)-minor-free graphs

DOI10.1016/S0012-365X(98)00158-7zbMath0955.05043OpenAlexW143450761MaRDI QIDQ1584404

Riste Škrekovski

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00158-7

zbMATH Keywords

choosabilitylist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Improved lower bound for the list chromatic number of graphs with no K_t minor ⋮ An extension of Thomassen's result on choosability ⋮ List Colorings of K5-Minor-Free Graphs With Special List Assignments ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ Local Hadwiger's conjecture ⋮ Another proof of the 5-choosability of \(K_5\)-minor-free graphs ⋮ 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
• Über einen Satz von K.Wagner zum Vierfarbenproblem
• Über eine Eigenschaft der ebenen Komplexe
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Choosability of \(K_5\)-minor-free graphs