Coloring plane graphs with independent crossings
arXiv:0811.2702
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.