5-choosability of graphs with 2 crossings

2011/05/13 by Victor Campos, Campos, Victor, Frédéric Havet +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1105.2723

arxiv created 2011/05/13 · arxiv updated 2011/05/16

Abstract

We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.

Related

• Coloring graphs with crossings
• Some conditions on 5-cycles that make planar graphs 4-choosable
• A note on the edge choosability of K₅-minor free graphs
• 1-Planar graphs without 6-cycles are 6-choosable
• Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable