Name
Abstract | ||
|---|---|---|
In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors. A natural lower bound is the maximum degree Δ of the graph. Some graphs require ⌊ 3 2 Δ ⌋ colors in an angular coloring. Ore and Plummer gave an upper bound of 2 Δ , which was improved to ⌊ 9 5 Δ ⌋ by the authors with Borodin. This article gives a new upper bound of ⌈ 5 9 Δ ⌉ on the angular chromatic number. The cyclic chromatic number is the equivalent dual vertex coloring problem. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jctb.2001.2046 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
cyclic chromatic number,lower bound,upper bound,maximum degree,plane graph | Edge coloring,Complete coloring,Discrete mathematics,Combinatorics,Fractional coloring,List coloring,Degree (graph theory),Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
83 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
22 | 1.88 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Sanders | 1 | 471 | 45.56 |
| Yue Zhao | 2 | 125 | 11.88 |