7 citations · 26 across the 17 of their papers we have counts for
7 papers · 1 filter
Monotonicity of the cops and robber game for bounded depth treewidth
Isolde Adler, Eva Fluck
We study a variation of the cops and robber game characterising treewidth, where in each play at most q cops can be placed in order to catch the robber, where q is a parameter of t…
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…
An explicit construction of graphs of bounded degree that are far from being Hamiltonian
Isolde Adler, Noleen Köhler
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonia…
A lower bound on the tree-width of graphs with irrelevant vertices
Isolde Adler, Philipp Klaus Krause
For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function such that if the tree-width of a graph with pairs of te…
On rank-width of even-hole-free graphs
Isolde Adler, Ngoc Khang Le, Haiko Müller +3
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because cho…
Obstructions for linear rankwidth at most 1
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.