activity
20072026
most citedPlanar graphs have bounded queue-number

73 citations · 785 across the 86 of their papers we have counts for

collaborators

92 papers

math.CO2026

An improved bound on the treewidth of planar graphs excluding a grid minor

Wouter Cames van Batenburg, Quentin Claus, Gwenaël Joret +3

We show that every planar graph with no grid minor has treewidth at most . This improves on the previously best known bound of , du…

math.CO2026

Induced Forest Minor Theorem for Graphs Without an Induced Star

Robert Hickingbotham, Gwenaël Joret

Motivated by recent work on tree independence number, we study the path independence number of a graph : the minimum integer such that there is a path decomposition of w…

math.CO2026

Erdős-Pósa property of rooted tree minors

Quentin Claus, Gwenaël Joret, Clément Rambaud +1

Fiorini, Joret, and Wood (2013) showed that tree minors satisfy the so-called Erdős-Pósa property with a linear bound: For every tree there exists a constant such th…

math.CO2026

Far-apart Erdős--Pósa property of long cycles

Maria Chudnovsky, Vida Dujmović, Gwenaël Joret +4

We prove that there exist functions and such that for all positive integers , , and , every graph either c…

cs.DM2026

Adjacency labelling for proper minor-closed graph classes

Vida Dujmović, Cyril Gavoille, Gwenaël Joret +3

We show that every proper minor-closed class of graphs admits a -bit adjacency labelling scheme. Equivalently, for every proper minor-closed class a…

math.CO2026

Blow-up structure of graphs excluding a tree or an apex-tree as a minor

Quentin Claus, Gwenaël Joret, Clément Rambaud

We prove blow-up structure theorems for graphs excluding a tree or an apex-tree as a minor. First, we show that for every -vertex tree with and radius , and eve…