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

DOI10.4230/LIPIcs.STACS.2013.221zbMath1354.05127OpenAlexW2005644434MaRDI QIDQ2957886

Sang-il Oum, Jisu Jeong, O-joung Kwon

Publication date: 30 January 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/3936/pdf/24.pdf/

zbMATH Keywords

well-quasi-orderinglinear rank-widthrank-widthvertex-minor

Mathematics Subject Classification ID

Graph minors (05C83) Distance in graphs (05C12)

Related Items (4)

Outerplanar obstructions for matroid pathwidth ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Excluded vertex-minors for graphs of linear rank-width at most \(k\)

This page was built for publication: Excluded vertex-minors for graphs of linear rank-width at most k.