3 citations · 6 across the 7 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023★ 1 cited
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…
math.CO2022★ 1 cited
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 .
math.CO2021★ 3 cited
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…