Coloring plane graphs with independent crossings
classification
🧮 math.CO
keywords
planecolorablecrossingsfourgraphsindependentsizealbertson
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.