56 citations · 715 across the 68 of their papers we have counts for
Showing 2016 · cs.DMShow all
2 papers · 2 filters
cs.DM2016★ 3 cited
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…
cs.DM2016★ 11 cited
-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…