Rank connectivity and pivot-minors of graphs

DOI10.1016/j.ejc.2022.103634zbMath1504.05177arXiv2011.03205OpenAlexW3099641639MaRDI QIDQ2107500

Sang-il Oum

Publication date: 1 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.03205

zbMATH Keywords

\(k^{+\ell}\)-rank-connected graphcut-rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (1)

A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors

Cites Work

• Unnamed Item
• Unnamed Item
• A chain theorem for 4-connected matroids
• A decomposition theory for matroids. I: General results
• Reducing prime graphs and recognizing circle graphs
• A simple theorem on 3-connectivity
• Graph minors. X: Obstructions to tree-decomposition
• Minimally 3-connected isotropic systems
• Rank-width: algorithmic and structural results
• Generating weakly 4-connected matroids
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• Decomposition of Directed Graphs
• Prime Testing for the Split Decomposition of a Graph
• A Splitter Theorem for Internally 4‐Connected Binary Matroids
• Matrices and matroids for systems analysis

This page was built for publication: Rank connectivity and pivot-minors of graphs