A five-color theorem

DOI10.1016/S0012-365X(00)00032-7zbMATH Open0944.05035OpenAlexW1963898880MaRDI QIDQ1567630FDOQ1567630

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)

Cited In (8)

• Title not available (Why is that?)
• Plane graphs with maximum degree 6 are edge-face 8-colorable
• Edge-face list coloring of Halin graphs
• An addition theorem for the color number
• The edge-face choosability of plane graphs with maximum degree at least 9
• Title not available (Why is that?)
• The hunting of a snark with total chromatic number 5
• Facial edge-face coloring of \(K_4\)-minor-free graphs

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

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