Rank-Width and Well-Quasi-Ordering

DOI10.1137/050629616zbMath1171.05048OpenAlexW2057137244MaRDI QIDQ3629468

Sang-il Oum

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050629616

zbMATH Keywords

binary matroidwell-quasi-orderingpivotingclique-widthpivot-minorrank-widthvertex-minorlocal complementationisotropic system

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (17)

The rank-width of edge-coloured graphs ⋮ Distance from triviality 2.0: hybrid parameterizations ⋮ Rank-width: algorithmic and structural results ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ Prime vertex-minors of a prime graph ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ Obstructions for linear rank-width at most 1 ⋮ Induced minors and well-quasi-ordering ⋮ The average cut-rank of graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ Unnamed Item ⋮ Excluded vertex-minors for graphs of linear rank-width at most \(k\) ⋮ Digraphs of Bounded Width

This page was built for publication: Rank-Width and Well-Quasi-Ordering