Rank-Width and Well-Quasi-Ordering
From MaRDI portal
Publication:3629468
DOI10.1137/050629616zbMath1171.05048MaRDI QIDQ3629468
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
binary matroid; well-quasi-ordering; pivoting; clique-width; pivot-minor; rank-width; vertex-minor; local complementation; isotropic system
Related Items
Induced minors and well-quasi-ordering, Prime vertex-minors of a prime graph, Well-quasi-ordering of matrices under Schur complement and applications to directed graphs, Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, Excluded vertex-minors for graphs of linear rank-width at most \(k\), Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions, A unified treatment of linked and lean tree-decompositions, A Menger-like property of tree-cut width, Distance from triviality 2.0: hybrid parameterizations, The average cut-rank of graphs, The rank-width of edge-coloured graphs, Rank-width: algorithmic and structural results, Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices, Obstructions for linear rank-width at most 1, Unnamed Item, Digraphs of Bounded Width, Recent Progress on Well-Quasi-ordering Graphs
