Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
From MaRDI portal
Publication:504421
DOI10.1016/j.aam.2016.11.009zbMath1353.05033OpenAlexW2963341507MaRDI QIDQ504421
Carolyn Chun, Dillon Mayhew, James G. Oxley
Publication date: 16 January 2017
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2016.11.009
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)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- 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
- Towards a splitter theorem for internally 4-connected binary matroids
- On internally 4-connected non-regular binary matroids
- Almost-graphic matroids
- A chain theorem for internally 4-connected binary matroids
- A generalization of a graph result of D. W. Hall
- 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.
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
This page was built for publication: Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.