5-choosability of graphs with 2 crossings
classification
🧮 math.CO
keywords
choosablecrossingseverygraphchoosabilityedgegraphsmade
read the original 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.
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.