15 citations · 56 across the 16 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DM2017★ 2 cited
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…
cs.DS2017
On the tractability of optimization problems on H-graphs
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
For a graph , a graph is an -graph if it is an intersection graph of connected subgraphs of some subdivision of . -graphs naturally generalize several important gra…
math.CO2017★ 15 cited
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…