Back to search

University of Waterloo

Acyclic List Colouring Locally Planar Graphs

Abstract

dc:description.abstract

A (vertex) colouring of a graph is \emph{acyclic} if it contains no bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi and Mohar proved that locally planar graphs are acyclically 7-colourable. In 2002, Borodin, Fon-Der-Flaass, Kostochka, Raspaud, and Sopena proved that planar graphs are acyclically 7-list-colourable. We prove that locally planar graphs are acyclically 9-list-colourable - no bound for acyclic list colouring locally planar graphs for any fixed number of colours was previously known. We further show that triangle-free locally planar graphs are acyclically 8-list-colourable.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Vicenzo, Massimo

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10012/22247

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

Vicenzo, Massimo. Acyclic List Colouring Locally Planar Graphs. University of Waterloo, 2025. https://hdl.handle.net/10012/22247