On contractible and vertically contractible elements in 3-connected matroids and graphs
From MaRDI portal
Publication:1377720
DOI10.1016/S0012-365X(96)00385-8zbMath0888.05010MaRDI QIDQ1377720
Publication date: 26 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A longest cycle version of Tutte's wheels theorem ⋮ A splitter theorem on 3-connected matroids ⋮ On 3-connected minors of 3-connected matroids and graphs ⋮ Triangle-roundedness in matroids ⋮ Contractible edges in 3-connected graphs that preserve a minor ⋮ On the structure of 3-connected matroids and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contractible edges in triangle-free graphs
- Contractible edges in 3-connected graphs
- On 3-connected matroids
- Planarity and duality of finite and infinite graphs
- Decomposition of regular matroids
- Non-separating induced cycles in graphs
- A simple theorem on 3-connectivity
- Triads and triangles in 3-connected matroids
- Matroids and graphs with few non-essential elements
- On the structure of 3-connected matroids and graphs
- Longest cycles in 3-connected graphs contain three contractible edges
- ON MATROID CONNECTIVITY
- On a matroid generalization of graph connectivity
- Modular Constructions for Combinatorial Geometries
- On 3-Connected Matroids
- The 3‐connected graphs having a longest cycle containing only three contractible edges
- Some Local Extremal Connectivity Results for Matroids
- Connectivity in Matroids
- On matroid connectivity
- On matroid connectivity
