Coloring the faces of convex polyhedra so that like colors are far apart
Abbreviated Journal Title
J. Comb. Theory Ser. B
CYCLIC CHROMATIC NUMBER; D-DIAGONAL COLORINGS; 3-CONNECTED GRAPHS; PLANE; GRAPHS; THEOREM; EDGES; Mathematics
This paper proves the conjecture of Hornak and Jendrol' that the faces of a convex polyhedron with maximum vertex degree Delta can be colored with 1+(Delta+7)(Delta-1)(d) colors in such a way that each pair of faces that are distance at most d apart receives different colors. (C) 2002 Elsevier Science (USA).
Journal of Combinatorial Theory Series B
"Coloring the faces of convex polyhedra so that like colors are far apart" (2002). Faculty Bibliography 2000s. 3447.