6 citations · 18 across the 7 of their papers we have counts for
7 papers
A positive instance of Scott's Conjecture on induced subdivisions
Kathie Cameron, Ni Luh Dewi Sintiari, Sophie Spirkl
For a graph , denotes the chromatic number of and denotes the size of the largest clique in . A hereditary class of graphs is called -bounded if there is…
Recoloring via modular decomposition
Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari
The reconfiguration graph of the -colorings of a graph , denoted , is the graph whose vertices are the -colorings of and two colorings are adjacent in $R_{k}…
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 tree-width of even-hole-free graphs
Pierre Aboulker, Isolde Adler, Eun Jung Kim +2
The class of all even-hole-free graphs has unbounded tree-width, as it contains all complete graphs. Recently, a class of (even-hole, )-free graphs was constructed, that still…
(Theta, triangle)-free and (even hole, )-free graphs. Part 2 : bounds on treewidth
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé +1
A {\em theta} is a graph made of three internally vertex-disjoint chordless paths , , of length at least~2 and such that no edge…
(Theta, triangle)-free and (even hole, )-free graphs. Part 1 : Layered wheels
Ni Luh Dewi Sintiari, Nicolas Trotignon
We present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing g…