Cyclic colorings of plane graphs with independent faces
Combinatorics
2008-11-18 v1
Abstract
Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.
Cite
@article{arxiv.0811.2704,
title = {Cyclic colorings of plane graphs with independent faces},
author = {Jernej Azarija and Daniel Král' and Rok Erman and Matjaz Krnc and Ladislav Stacho},
journal= {arXiv preprint arXiv:0811.2704},
year = {2008}
}