Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
From MaRDI portal
Publication:449209
DOI10.1016/j.ejc.2012.03.034zbMath1269.05045arXiv1102.2134OpenAlexW2046637099MaRDI QIDQ449209
Publication date: 12 September 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.2134
principal pivot transformpivot-minorprincipal submatrixdelta-matroidsequence of directed graphsskew symmetric matrices
Hermitian, skew-Hermitian, and related matrices (15B57) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
The rank-width of edge-coloured graphs ⋮ Rank-width: algorithmic and structural results ⋮ An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ Digraphs of Bounded Width
Cites Work
- Maximal pivots on graphs with an application to gene assembly
- Graph minors. XX: Wagner's conjecture
- Graph operations characterizing rank-width
- Isotropic systems
- Branch-width and well-quasi-ordering in matroids and graphs.
- Principal pivot transforms: Properties and applications
- Handle-rewriting hypergraph grammars
- The rank-width of edge-coloured graphs
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- Graph minors. IV: Tree-width and well-quasi-ordering
- Rank-Width and Well-Quasi-Ordering
- Greedy algorithm and symmetric matroids
- Finding Branch-Decompositions and Rank-Decompositions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Well-quasi-ordering of matrices under Schur complement and applications to directed graphs