Towards a splitter theorem for internally 4-connected binary matroids. VII
From MaRDI portal
Publication:670643
DOI10.1016/j.aam.2018.11.004zbMath1409.05044arXiv1608.01027OpenAlexW4207027858WikidataQ128843390 ScholiaQ128843390MaRDI QIDQ670643
Publication date: 18 March 2019
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01027
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) Connectivity (05C40)
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
- Almost-graphic matroids
- A chain theorem for internally 4-connected binary matroids
- Decomposition of regular matroids
- Towards a splitter theorem for internally 4-connected binary matroids. VI
- Generating internally four-connected graphs
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- Connectivity in Matroids