Coloring graphs with crossings
Bogdan Oporowski, David Zhao
Abstract
We 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 K6 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.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz