Plane graphs with maximum degree 6 are edge-face 8-colorable

DOI10.1007/s00373-013-1308-xzbMath1298.05084OpenAlexW2028677278MaRDI QIDQ742598

Min Chen, Wei Fan Wang, Andre Raspaud

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1308-x

zbMATH Keywords

plane graphmaximum degreedischargingedge-face coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ Facial entire colouring of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Edge-face list coloring of Halin graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On simultaneous edge-face colorings of plane graphs
• Simultaneous coloring of edges and faces of plane graphs
• Simultaneously colouring the edges and faces of plane graphs
• A five-color theorem
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• The edge-face choosability of plane graphs
• A six-color theorem for the edge-face coloring of plane graphs
• Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring
• Edge‐face chromatic number and edge chromatic number of simple plane graphs
• On improving the edge-face coloring theorem

This page was built for publication: Plane graphs with maximum degree 6 are edge-face 8-colorable