Almost-graphic matroids
From MaRDI portal
Publication:696817
DOI10.1006/aama.2001.0791zbMath1010.05017OpenAlexW2053279811MaRDI QIDQ696817
Publication date: 12 September 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2cf8ada44e92ecaf6c09c2ed11d52ee450292341
Related Items (14)
Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. ⋮ Signed-graphic matroids with all-graphic cocircuits ⋮ Stability, fragility, and Rota's conjecture ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ Matroids with at least two regular elements ⋮ Delta-wye reduction of almost-planar graphs ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VII ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. ⋮ On almost-planar graphs ⋮ The Möbius matroids ⋮ The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor. ⋮ Internally 4-connected binary matroids with cyclically sequential orderings ⋮ Fan-extensions in fragile matroids ⋮ A circuit characterization of graphic matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of Lindström's result about characteristic sets of matroids
- A characterization of a class of non-binary matroids
- Decomposition of regular matroids
- On the structure of 3-connected matroids and graphs
- Binary matroids without prisms, prism duals, and cubes
- The Binary Matroids With No 4-Wheel Minor
- A Characterization of Almost-Planar Graphs
This page was built for publication: Almost-graphic matroids