On the \(d\)-distance face chromatic number of plane graphs
From MaRDI portal
Publication:1356701
DOI10.1016/S0012-365X(96)00049-0zbMath0880.05040MaRDI QIDQ1356701
Mirko Horňák, Stanlislav Jendroľ
Publication date: 19 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (5)
A note on 2-facial coloring of plane graphs ⋮ Cyclic, diagonal and facial colorings ⋮ Vertex colorings with a distance restriction ⋮ On cyclic colorings and their generalizations ⋮ Coloring the faces of convex polyhedra so that like colors are far apart
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic coloring of plane graphs
- Ein Sechsfarbenproblem auf der Kugel
- Diagonal 11-coloring of plane triangulations
- Cyclic coloration of 3-polytopes
- On Diagonally 10‐Coloring Plane Triangulations
- On some properties of 4‐regular plane graphs
This page was built for publication: On the \(d\)-distance face chromatic number of plane graphs