Removing circuits in 3-connected binary matroids
From MaRDI portal
Publication:1011697
DOI10.1016/j.disc.2007.12.095zbMath1169.05012OpenAlexW2135952967MaRDI QIDQ1011697
Bráulio Maia Junior, Raul Cordovil, Manoel Lemos
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.095
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The 3-connected binary matroids with circumference 6 or 7
- Decomposition of regular matroids
- Non-separating induced cycles in graphs
- Removable circuits in multigraphs
- On size, circumference and circuit removal in 3-connected matroids
- Contractible bonds in graphs
- Non-separating cocircuits in binary matroids
- Connected matroids with a small circumference
- On removable even circuits in graphs
- On the 3-connected matroids that are minimal having a fixed spanning restriction
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- On Minimally 3-Connected Binary Matroids
- A new planarity criterion for 3-connected graphs
- Removable Cycles in Planar Graphs
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- On removable circuits in graphs and matroids
- Removable Circuits in Binary Matroids
- How to Draw a Graph
This page was built for publication: Removing circuits in 3-connected binary matroids
