![Důležité termíny](https://cdn.muni.cz/media/3716855/image_2.jpg?mode=crop¢er=0.5,0.5&rnd=133667368190000000&heightratio=0.5&width=278)
Informace o publikaci
Coloring Plane Graphs with Independent Crossings
Autoři | |
---|---|
Rok publikování | 2010 |
Druh | Článek v odborném periodiku |
Časopis / Zdroj | Journal of Graph Theory |
Citace | |
Doi | http://dx.doi.org/10.1002/jgt.20448 |
Klíčová slova | planar graphs; cyclic coloring; crossing number; chromatic number |
Popis | 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 |