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

    Authors

    D. P. Sanders;Y. Zhao

    Abbreviated Journal Title

    J. Comb. Theory Ser. B

    Keywords

    CYCLIC CHROMATIC NUMBER; D-DIAGONAL COLORINGS; 3-CONNECTED GRAPHS; PLANE; GRAPHS; THEOREM; EDGES; Mathematics

    Abstract

    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 Title

    Journal of Combinatorial Theory Series B

    Volume

    85

    Issue/Number

    2

    Publication Date

    1-1-2002

    Document Type

    Article

    Language

    English

    First Page

    348

    Last Page

    360

    WOS Identifier

    WOS:000176607100012

    ISSN

    0095-8956

    Share

    COinS