56 citations · 715 across the 68 of their papers we have counts for
4 papers · 1 filter
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…
-bounds, operations and chords
Lan Anh Pham, Nicolas Trotignon
A \emph{long unichord} in a graph is an edge that is the unique chord of some cycle of length at least 5. A graph is \emph{long-unichord-free} if it does not contain any long-unich…
Stable sets in {ISK4,wheel}-free graphs
Martin Milanič, Irena Penev, Nicolas Trotignon
An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cy…
A decomposition theorem for {ISK4,wheel}-free trigraphs
Martin Milanič, Irena Penev, Nicolas Trotignon
An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cy…