A circuit characterization of graphic matroids
From MaRDI portal
Publication:257006
DOI10.1016/j.jctb.2015.12.011zbMath1332.05032OpenAlexW2254643640MaRDI QIDQ257006
Publication date: 14 March 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2015.12.011
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing graphic matroids by a system of linear equations
- Almost-graphic matroids
- Une rélation de séparation entre cocircuits d'un matroide
- A new characterization of graphic matroids
- Decomposition of regular matroids
- Kuratowski's and Wagner's theorems for matroids
- A characterization of graphic matroids using non-separating cocircuits
- Another characterisation of planar graphs
- Characterizing 3-connected planar graphs and graphic matroids
- Lectures on matroids
- On even matroids
- Graphs, matroids, and geometric lattices