Simultaneous coloring of edges and faces of plane graphs

DOI10.1016/0012-365X(94)90101-5zbMath0807.05029OpenAlexW2041223264MaRDI QIDQ1322167

Oleg V. Borodin

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90101-5

zbMATH Keywords

plane graphedge-and-face chromatic numberKotzig's Theoremsimultaneous coloring

Mathematics Subject Classification ID

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

Related Items

The entire choosability of plane graphs ⋮ The edge-face choosability of plane graphs ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Facial list colourings of plane graphs ⋮ Simultaneously colouring the edges and faces of plane graphs ⋮ An extension of Kotzig's theorem ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Facial entire colouring of plane graphs ⋮ Unnamed Item ⋮ Entire colouring 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 ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero

Cites Work

• Ein Sechsfarbenproblem auf der Kugel
• A seven-color theorem on the sphere
• On the total coloring of planar graphs.
• Every planar map is four colorable
• The Colour Numbers of Complete Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item