linear rank width
- 2012 GanianTwinCover2012
- page 263 : twin-cover number $k$ upper bounds linear rank width by $\mathcal O(k)$ – The rank-width and linaer rank-width of graph of twin-cover $k$ are at most $k+1$.
- unknown
- linear rank width $k$ upper bounds rank width by $f(k)$
- pathwidth $k$ upper bounds linear rank width by $f(k)$