Coloring graphs with crossings

Simple item page
dc.creatorOporowski, Bogdan
dc.creatorZhao, David
dc.date2005-01-25
dc.date.accessioned2026-07-07T05:16:21Z
dc.date.available2026-07-07T05:16:21Z
dc.descriptionWe generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider the question of whether the result can be extended to graphs with more crossings.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0501427
dc.identifierhttp://arxiv.org/abs/math/0501427
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73957
dc.subjectCombinatorics
dc.subject05C15
dc.titleColoring graphs with crossings
dc.typetext

Files

Collections

arXiv