20 citations · 180 across the 43 of their papers we have counts for
4 papers · 1 filter
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width
Mamadou Moustapha Kanté, O-joung Kwon
We provide a doubly exponential upper bound in on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field of linear r…
Characterizing width two for variants of treewidth
Hans L. Bodlaender, Vincent J. C. Kreuzen, Stefan Kratsch +2
In this paper, we consider the notion of \emph{special treewidth}, recently introduced by Courcelle\cite{Courcelle2012}. In a special tree decomposition, for each vertex in a g…
Tree-depth and Vertex-minors
Petr Hliněný, O-joung Kwon, Jan Obdržálek +1
In a recent paper, Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already befor…
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every -vertex dis…