Coloring plane graphs with independent crossings
Combinatorics
2008-11-18 v1
Abstract
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 graphs drawn in the plane with all crossings independent are 5-colorable.
Cite
@article{arxiv.0811.2702,
title = {Coloring plane graphs with independent crossings},
author = {Daniel Král' and Ladislav Stacho},
journal= {arXiv preprint arXiv:0811.2702},
year = {2008}
}