1 citations · 3 across the 10 of their papers we have counts for
12 papers
Local Weak Degeneracy of Planar Graphs
Ewan Davies, Evelyne Smith-Roberge
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs…
Flow-critical graphs
Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický +3
Lovász et al. proved that every -edge-connected graph has a nowhere-zero -flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3…
Acyclic List Colouring Locally Planar Graphs
Luke Postle, Evelyne Smith-Roberge, Massimo Vicenzo
A (vertex) colouring of graph is \emph{acyclic} if it contains no bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi…
Maximum -colourable induced subgraphs in -free graphs
Cicely Henderson, Evelyne Smith-Roberge, Sophie Spirkl +1
We show that for any nonnegative integer , the Weighted Maximum List--Colourable Induced Subgraph problem can be solved in polynomial time for input graphs that do not contai…
Weak Degeneracy of Planar Graphs
Anton Bernshteyn, Eugene Lee, Evelyne Smith-Roberge
The weak degeneracy of a graph is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for g…
List Packing and Correspondence Packing of Planar Graphs
Daniel W. Cranston, Evelyne Smith-Roberge
For a graph and a list assignment with for all , an -packing consists of -colorings such that for all and all dis…
Beyond the Pseudoforest Strong Nine Dragon Tree Theorem
Sebastian Mies, Benjamin Moore, Evelyne Smith-Roberge
The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph has maximum average degree …
Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs
Luke Postle, Evelyne Smith-Roberge
We show that there exists a constant such that if is a planar graph with 5-correspondence assignment , then has at least distinct -c…
Hyperbolicity Theorems for Correspondence Colouring
Luke Postle, Evelyne Smith-Roberge
We generalize a framework of list colouring results to correspondence colouring. Correspondence colouring is a generalization of list colouring wherein we localize the meaning of t…
On the choosability with separation of planar graphs and its correspondence colouring analogue
Evelyne Smith-Roberge
A list assignment for a graph is an -list assignment if for each and for each . We say i…
Local girth choosability of planar graphs
Luke Postle, Evelyne Smith-Roberge
In 1994, Thomassen famously proved that every planar graph is 5-choosable, resolving a conjecture initially posed by Vizing and, independently, Erd\H{os}, Rubin, and Taylor in the…
On the Density of -Critical Graphs
Luke Postle, Evelyne Smith-Roberge
In 1959, Grötzsch famously proved that every planar graph of girth at least 4 is 3-colourable (or equivalently, admits a homomorphism to ). A natural generalization of this is…