Publication at Faculty of Mathematics and Physics |
2012
Abstract
We show that every planar graph with vertex disjoint faces of size four or more has a vertex coloring with D+1 colors, where is the maximum face size, such that no face is incident with two vertices of the same color.