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

DOI10.1016/j.ejc.2023.103761zbMath1519.05139arXiv2110.10390OpenAlexW3207069781WikidataQ123166401 ScholiaQ123166401MaRDI QIDQ6115787

Sang-il Oum, Duksang Lee

Publication date: 10 August 2023

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

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

zbMATH Keywords

prime graphreduction theorem3-rank-connected vertex-minor

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Cites Work

• Unnamed Item
• Inequivalent representations of matroids over prime fields
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• A decomposition theory for matroids. I: General results
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Minimally 3-connected isotropic systems
• Matroid 4-connectivity: A deletion-contraction theorem
• Rank connectivity and pivot-minors of graphs
• Rank-width and vertex-minors
• Circle graph obstructions under pivoting

This page was built for publication: A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors