15 citations · 56 across the 16 of their papers we have counts for
13 papers · 1 filter
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…
Sparse graphs without long induced paths
Oscar Defrain, Jean-Florent Raymond
Graphs of bounded degeneracy are known to contain induced paths of order when they contain a path of order , as proved by Nešetřil and Ossona de Mendez (2012).…
Twin-width and generalized coloring numbers
Jan Dreier, Jakub Gajarsky, Yiting Jiang +2
In this paper, we prove that a graph with no -subgraph and twin-width has -admissibility and -coloring numbers bounded from above by an exponential function…
A Menger-like property of tree-cut width
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond +1
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-l…
A tight Erdős-Pósa function for planar minors
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret +1
Let be a planar graph. By a classical result of Robertson and Seymour, there is a function such that for all and all graphs …
Polynomial expansion and sublinear separators
Louis Esperet, Jean-Florent Raymond
Let be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed , every -vertex graph of has a balanced sep…
Packing and Covering Immersion Models of Planar subcubic Graphs
Archontia Giannopoulou, O-joung Kwon, Jean-Florent Raymond +1
A graph is an immersion of a graph if can be obtained by some sugraph after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bb…
Well-quasi-ordering H-contraction-free graphs
Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined…
Induced minors and well-quasi-ordering
Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond +1
A graph is an induced minor of a graph if it can be obtained from an induced subgraph of by contracting edges. Otherwise, is said to be -induced minor-free. Robi…
Minors in graphs of large -girth
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1
For every , let denote the graph with two vertices and parallel edges. The -girth of a graph is the minimum number of edges of a subgraph of $G…
Multigraphs without large bonds are wqo by contraction
Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
We show that the class of multigraphs with at most connected components and bonds of size at most is well-quasi-ordered by edge contraction for all positive integers .…
An edge variant of the Erdős-Pósa property
Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
For every , we denote by the multigraph with two vertices and parallel edges. Given a graph , we say that a subgraph of is a model of $θ_{r}…
Low Polynomial Exclusion of Planar Graph Patterns
Jean-Florent Raymond, Dimitrios M. Thilikos
The celebrated grid exclusion theorem states that for every -vertex planar graph , there is a constant such that if a graph does not contain as a minor then $…