Towards a splitter theorem for internally 4-connected binary matroids. VI
From MaRDI portal
Publication:1795490
DOI10.1016/j.aam.2018.07.007zbMath1397.05032arXiv1608.01022OpenAlexW2951634771MaRDI QIDQ1795490
Publication date: 16 October 2018
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01022
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
- Towards a splitter theorem for internally 4-connected binary matroids. III
- Towards a splitter theorem for internally 4-connected binary matroids. IV
- Towards a splitter theorem for internally 4-connected binary matroids. V
- Generating an internally 4-connected binary matroid from another
- A chain theorem for internally 4-connected binary matroids
- Decomposition of regular matroids
- A simple theorem on 3-connectivity
- Generating internally four-connected graphs
- Towards a splitter theorem for internally 4-connected binary matroids. II
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- Connectivity in Matroids
This page was built for publication: Towards a splitter theorem for internally 4-connected binary matroids. VI