Coloring plane graphs with independent crossings

Abstract

We prove a conjecture of Albertson on the chromatic number of graphs that can be drawn with disjoint crossing clusters in the plane.

Keywords

• plane graphs
• graph coloring
• independent crossings