5-Choosability of Planar-plus-two-edge Graphs
MetadataShow full item record
We prove that graphs that can be made planar by deleting two edges are 5-choosable. To arrive at this, first we prove an extension of a theorem of Thomassen. Second, we prove an extension of a theorem Postle and Thomas. The difference between our extensions and the theorems of Thomassen and of Postle and Thomas is that we allow the graph to contain an inner 4-list vertex. We also use a colouring technique from two papers by Dvořák, Lidický and Škrekovski, and independently by Compos and Havet.
Cite this work
Amena Mahmoud (2018). 5-Choosability of Planar-plus-two-edge Graphs. UWSpace. http://hdl.handle.net/10012/12798