A six-color theorem for the edge-face coloring of plane graphs

DOI10.1016/0012-365X(93)E0229-WzbMath0827.05025MaRDI QIDQ1894780

Cuiqin Lin, Guanzhang Hu, Zhong Fu Zhang

Publication date: 24 July 1995

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

zbMATH Keywords

plane graphedge-face coloringsix-color theorem

Mathematics Subject Classification ID

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

Related Items (3)

Simultaneously colouring the edges and faces of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Plane graphs with maximum degree 6 are edge-face 8-colorable

Cites Work

• A seven-color theorem on the sphere
• The Colour Numbers of Complete Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A six-color theorem for the edge-face coloring of plane graphs