Publication details
Coloring Plane Graphs with Independent Crossings
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Graph Theory |
| Citation | |
| Doi | http://dx.doi.org/10.1002/jgt.20448 |
| Keywords | planar graphs; cyclic coloring; crossing number; chromatic number |
| Description | We show that every plane graph with maximum face size four in which 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. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184-205. 2010 |