Claire Hilaire

activity

20212025

most citedSparse graphs with bounded induced cycle packing number have logarithmic treewidth

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

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Treewidth versus clique number: induced minors

Claire Hilaire, Martin Milanič, Nicolas Trotignon +1

We prove that a hereditary class of graphs is $(tw, ω)$ -bounded if and only if the induced minors of the graphs from the class form a $(tw, ω)$ -bounded class.

math.CO2024

Path eccentricity of $k$ -AT-free graphs and application on graphs with the consecutive ones property

Paul Bastide, Claire Hilaire, Eileen Robinson

The central path problem is a variation on the single facility location problem. The aim is to find, in a given connected graph $G$ , a path $P$ minimizing its eccentricity, which i…

math.CO2024

Induced Minor Models. I. Structural Properties and Algorithmic Consequences

Nicolas Bousquet, Clément Dallard, Maël Dumas +4

A graph $H$ is said to be an induced minor of a graph $G$ if $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. Equivalently, $H$ is an induced m…

Treewidth versus clique number: induced minors

Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property

Induced Minor Models. I. Structural Properties and Algorithmic Consequences

Path eccentricity of $k$ -AT-free graphs and application on graphs with the consecutive ones property