3 citations · 6 across the 7 of their papers we have counts for
7 papers
On the diversity problems parameterized by the size of the solutions
Julien Baste, Cléophée Robin, Marie-Emilie Voge
Diversity optimization seeks multiple high-quality solutions that are sufficiently different from one another, providing a richer representation of the solution space than a single…
A program to find families of graphs in Free with bounded clique width
Cléophée Robin, Alexandre Talon
In this paper we study the class of graphs without cycles of size 4 and independent sets of size 4 as induced subgraphs: . This is one of the three mini…
Coloring bridge-free antiprismatic graphs
Cléophée Robin, Eileen Robinson
The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antip…
A Closure Lemma for tough graphs and Hamiltonian degree conditions
Chinh T. Hoang, Cleophee Robin
The closure of a graph is the graph obtained from by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least , where is the…
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin +3
For every integer , we give a structural description of the class of graphs whose chordless cycles of length at least 4 all have length .
Graphs with all holes the same length
Linda Cook, Jake Horsfield, Myriam Preissmann +5
A graph is "-holed" if all its induced cycles of length at least four have length exactly . We give a complete description of the -holed graphs for each $\ell\ge…
On the complexity of colouring antiprismatic graphs
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The…