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

Authors:
Daniel P. Sanders;Yue Zhao
Affiliations:
23 Cliff Road, Belle Terre, New York;Department of Mathematics, Unviersity of Central Florida, Orlando, Florida
Venue:
Journal of Combinatorial Theory Series B
Year:
2002

Citing 13
Cited 0

Contractible edges in 3-connected graphs

Journal of Combinatorial Theory Series B
Removable edges in 3-connected graphs

Journal of Graph Theory
2-connected spanning subgraphs of planar 3-connected graphs

Journal of Combinatorial Theory Series B
A new proof of the 6 color theorem

Journal of Graph Theory
On some properties of 4-regular plane graphs

Journal of Graph Theory
On diagonally 10-coloring plane triangulations

Journal of Graph Theory
On d-diagonal colorings

Journal of Graph Theory
Cyclic degree and cyclic coloring of 3-polytopes

Journal of Graph Theory
On the d-distance face chromatic number of plane graphs

Selected papers from the second Krakow conference on Graph theory
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A new bound on the cyclic chromatic number

Journal of Combinatorial Theory Series B
Cyclic Chromatic Number of 3-Connected Plane Graphs

SIAM Journal on Discrete Mathematics
On a conjecture by Plummer and Toft

Journal of Graph Theory

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper proves the conjecture of Hornák and Jendrol' that the faces of a convex polyhedron with maximum vertex degree Δ can be colored with 1 +(Δ+7)(Δ-1)d colors in such a way that each pair of faces that are distance at most d apart receives different colors.