Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1006/jctb.2001.2109 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
maximum vertex degree,different color,convex polyhedron | Combinatorics,Colored,Vertex (geometry),Polyhedron,Regular polygon,Convex polytope,Degree (graph theory),Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
2 | 0.63 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Sanders | 1 | 471 | 45.56 |
| Yue Zhao | 2 | 125 | 11.88 |