Excluded vertex-minors for graphs of linear rank-width at most k.

摘要

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each k, there is a finite set mathcal{O}_k of graphs such that a graph G has linear rank-widt