Back to search

University of Waterloo

5-Choosability of Planar-plus-two-edge Graphs

Abstract

dc:description.abstract

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.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mahmoud, Amena
Advisor dc:contributor.advisor
  • Richter, Bruce

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/12798

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Mahmoud, Amena. 5-Choosability of Planar-plus-two-edge Graphs. University of Waterloo, 2018. http://hdl.handle.net/10012/12798