Almost-graphic matroids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 53949 (Why is no real title available?)
- scientific article; zbMATH DE number 1161308 (Why is no real title available?)
- A Characterization of Almost-Planar Graphs
- A characterization of a class of non-binary matroids
- An extension of Lindström's result about characteristic sets of matroids
- Binary matroids without prisms, prism duals, and cubes
- Decomposition of regular matroids
- On the structure of 3-connected matroids and graphs
- The Binary Matroids With No 4-Wheel Minor
Cited in
(19)- A circuit characterization of graphic matroids
- Towards a splitter theorem for internally 4-connected binary matroids. VII
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- Stability, fragility, and Rota's conjecture
- The Möbius matroids
- Matroids with at least two regular elements
- On almost-planar graphs
- A decomposition theory for matroids. VI: Almost regular matroids
- scientific article; zbMATH DE number 1409215 (Why is no real title available?)
- Gorenstein graphic matroids
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
- Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
- Delta-wye reduction of almost-planar graphs
- Fan-extensions in fragile matroids
- A particular class of graphic matroids
- Signed-graphic matroids with all-graphic cocircuits
- scientific article; zbMATH DE number 4145915 (Why is no real title available?)
- An algorithm for delta-wye reduction of almost-planar graphs
- Internally 4-connected binary matroids with cyclically sequential orderings
This page was built for publication: Almost-graphic matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696817)