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 2020Show all

2 papers · 1 filter

cs.DM2020★ 3 cited

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, $K_{4}$ )-free graphs was constructed, that still…

cs.DM2020★ 5 cited

(Theta, triangle)-free and (even hole, $K_{4}$ )-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 $P_{1} = a \dots b$ , $P_{2} = a \dots b$ , $P_{3} = a \dots b$ of length at least~2 and such that no edge…

On the tree-width of even-hole-free graphs

(Theta, triangle)-free and (even hole, K4​)-free graphs. Part 2 : bounds on treewidth

(Theta, triangle)-free and (even hole, $K_{4}$ )-free graphs. Part 2 : bounds on treewidth