Simultaneously colouring the edges and faces of plane graphs

DOI10.1006/jctb.1997.1725zbMath0867.05023OpenAlexW1992500242MaRDI QIDQ1354728

Adrian O. Waller

Publication date: 3 June 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1725

zbMATH Keywords

plane graphsimultaneous colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

The edge-face choosability of plane graphs ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Facial entire colouring of plane graphs ⋮ Entire colouring of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Edge-face list coloring of Halin graphs ⋮ Plane graphs with maximum degree 6 are edge-face 8-colorable ⋮ Entire choosability of near-outerplane graphs ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero

Cites Work

• An upper bound for total colouring of graphs
• Every planar map is four colorable. II: Reducibility
• Simultaneous coloring of edges and faces of plane graphs
• A six-color theorem for the edge-face coloring of plane graphs
• Ein Sechsfarbenproblem auf der Kugel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simultaneously colouring the edges and faces of plane graphs