activity
20142026
most citedA tight Erdős-Pósa function for planar minors

8 citations · 36 across the 26 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

math.CO2023

Disjoint list-colorings for planar graphs

Stijn Cambie, Wouter Cames van Batenburg, Xuding Zhu

One of Thomassen's classical results is that every planar graph of girth at least is 3-choosable. One can wonder if for a planar graph of girth sufficiently large and a …

math.CO2023★ 2 cited

List packing number of bounded degree graphs

Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies +1

We investigate the list packing number of a graph, the least such that there are always disjoint proper list-colourings whenever we have lists all of size associated to…