A five-color theorem

DOI10.1016/S0012-365X(00)00032-7zbMath0944.05035OpenAlexW1963898880MaRDI QIDQ1567630

Yue Zhao, Daniel P. Sanders

Publication date: 15 September 2000

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

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

zbMATH Keywords

planar graphedge-face coloring

Mathematics Subject Classification ID

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

Related Items (4)

Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Edge-face list coloring of Halin graphs ⋮ Plane graphs with maximum degree 6 are edge-face 8-colorable

This page was built for publication: A five-color theorem