Graphs with two crossings are 5-choosable
classification
🧮 math.CO
keywords
choosableeverygraphcrossingsavailablecoloredcolorsextend
read the original abstract
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable.
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.