Coloring the faces of convex polyhedra so that like colors are far apart

DOI10.1006/jctb.2001.2109zbMath1022.05028OpenAlexW2051793842MaRDI QIDQ1850618

Yue Zhao, Daniel P. Sanders

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/f211fa98aa1c6af58a43d2a992af4c012b3ba0e1

zbMATH Keywords

polyhedracolorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• On cyclic colorings and their generalizations
• 2-connected spanning subgraphs of planar 3-connected graphs
• On the \(d\)-distance face chromatic number of plane graphs
• The four-colour theorem
• On \(d\)-diagonal colorings of embedded graphs of low maximum face size
• A new bound on the cyclic chromatic number
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• Removable edges in 3-connected graphs
• Cyclic coloration of 3-polytopes
• Every Planar Map is Four Colorable
• Cyclic degree and cyclic coloring of 3-polytopes
• A new proof of the 6 color theorem
• On Diagonally 10‐Coloring Plane Triangulations
• On some properties of 4‐regular plane graphs
• Ond-diagonal colorings
• 25 pretty graph colouring problems

This page was built for publication: Coloring the faces of convex polyhedra so that like colors are far apart