15 citations · 56 across the 16 of their papers we have counts for
7 papers · 1 filter
Long induced paths in minor-closed graph classes and beyond
Claire Hilaire, Jean-Florent Raymond
In this paper we show that every graph of pathwidth less than that has a path of order also has an induced path of order at least . This is an exponent…
Enumerating minimal dominating sets in -free graphs and variants
Marthe Bonamy, Oscar Defrain, Marc Heinrich +2
It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we investigate this problem in graph cl…
Packing and covering induced subdivisions
O-joung Kwon, Jean-Florent Raymond
A class of graphs has the induced Erdős-Pósa property if there exists a function such that for every graph and every positive integer , contains either…
A tight Erdős-Pósa function for wheel minors
Pierre Aboulker, Samuel Fiorini, Tony Huynh +3
Let denote the wheel on vertices. We prove that for every integer there is a constant such that for every integer and every graph , eit…
Recent techniques and results on the Erdős-Pósa property
Jean-Florent Raymond, Dimitrios M. Thilikos
Several min-max relations in graph theory can be expressed in the framework of the Erdős-Pósa property. Typically, this property reveals a connection between packing and covering p…
Scattered packings of cycles
Aistis Atminas, Marcin Kamiński, Jean-Florent Raymond
We consider the problem Scattered Cycles which, given a graph and two positive integers and , asks whether contains a collection of cycles that are pairwise a…
Polynomial Gap Extensions of the Erdős-Pósa Theorem
Jean-Florent Raymond, Dimitrios M. Thilikos
Given a graph , we denote by all graphs that can be contracted to . The following extension of the Erdős-Pósa Theorem holds: for every -vertex planar graph $…