Choosability of planar graphs

DOI10.1016/0012-365X(95)00216-JzbMath0852.05048MaRDI QIDQ1916256

Margit Voigt

Publication date: 25 November 1996

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

zbMATH Keywords

colouring\(k\)-choosablelist assignment

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Free choosability of outerplanar graphs ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Colorings and orientations of graphs
• List \(T\)-colorings of graphs

This page was built for publication: Choosability of planar graphs