| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653846 | European Journal of Combinatorics | 2012 | 8 Pages |
Abstract
Let GG be a plane graph with maximum face size Δ∗Δ∗. If all faces of GG with size four or more are vertex disjoint, then GG has a cyclic coloring with Δ∗+1Δ∗+1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jernej Azarija, Rok Erman, Daniel Král’, Matjaž Krnc, Ladislav Stacho,