Recommendations
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
- Rank-width and vertex-minors
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (extended abstract)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
Cited in
(27)- A note on the rank-subtractivity ordering
- Rank, join, and Cantor singletons
- 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
- Vertex-minor reductions can simulate edge contractions
- Rank-width and vertex-minors
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (extended abstract)
- Digraphs of bounded width
- Recent progress on well-quasi-ordering graphs
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
- Ordinal Rankings on Measures Annihilating Thin Sets
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- The Kechris-Woodin Rank is Finer Than the Zalcwasser Rank
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Several notions of rank-width for countable graphs
- Prime vertex-minors of a prime graph
- Vertex-minors of graphs: a survey
- Tree pivot-minors and linear rank-width
- Computing pivot-minors
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
This page was built for publication: Rank-Width and Well-Quasi-Ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629468)
