2 papers
math.CO2008
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Daniel Král', Rok Erman +2
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 t…
math.CO2008★ 1 cited
Coloring plane graphs with independent crossings
Daniel Král', Ladislav Stacho
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether…