Premium
Coloring plane graphs with independent crossings
Author(s) -
Král' Daniel,
Stacho Ladislav
Publication year - 2010
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20448
Subject(s) - combinatorics , mathematics , disjoint sets , vertex (graph theory) , plane (geometry) , graph , discrete mathematics , geometry
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. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184–205, 2010