Evelyne Smith-Roberge

activity

20222025

collaborators

5 papers

math.CO2025

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…

math.CO2025

Flow-critical graphs

Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický +3

Lovász et al. proved that every $6$ -edge-connected graph has a nowhere-zero $3$ -flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3…

math.CO2024

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…

math.CO2024

Maximum $k$ -colourable induced subgraphs in $(P_{5} + r K_{1})$ -free graphs

Cicely Henderson, Evelyne Smith-Roberge, Sophie Spirkl +1

We show that for any nonnegative integer $r$ , the Weighted Maximum List- $k$ -Colourable Induced Subgraph problem can be solved in polynomial time for input graphs that do not contai…

math.CO2022

On the choosability with separation of planar graphs and its correspondence colouring analogue