Title

Coloring The Faces Of Convex Polyhedra So That Like Colors Are Far Apart

Abstract

This paper proves the conjecture of Horňá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. © 2002 Elsevier Science (USA).

Publication Date

1-1-2002

Publication Title

Journal of Combinatorial Theory. Series B

Volume

85

Issue

2

Number of Pages

348-360

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1006/jctb.2001.2109

Socpus ID

0036315394 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0036315394

This document is currently not available here.

Share

COinS