Ni Luh Dewi Sintiari

activity

20192026

most cited(Theta, triangle)-free and (even hole,

K_{4}

)-free graphs. Part 1 : Layered wheels

6 citations · 18 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

A positive instance of Scott's Conjecture on induced subdivisions

Kathie Cameron, Ni Luh Dewi Sintiari, Sophie Spirkl

For a graph $G$ , $χ (G)$ denotes the chromatic number of $G$ and $ω (G)$ denotes the size of the largest clique in $G$ . A hereditary class of graphs is called $χ$ -bounded if there is…

math.CO2024

Recoloring via modular decomposition

Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari

The reconfiguration graph of the $k$ -colorings of a graph $G$ , denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colorings of $G$ and two colorings are adjacent in $R_{k}…

math.CO2022★ 1 cited

When all holes have the same length

Jake Horsfield, Myriam Preissmann, Cléophée Robin +3

For every integer $ℓ \geq 7$ , 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…