On contractible and vertically contractible elements in 3-connected matroids and graphs
From MaRDI portal
Publication:1377720
DOI10.1016/S0012-365X(96)00385-8zbMATH Open0888.05010MaRDI QIDQ1377720FDOQ1377720
Authors: Haidong Wu 
Publication date: 26 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2066192
- On contracting hyperplane elements from a 3-connected matroid
- scientific article; zbMATH DE number 4043878
- scientific article; zbMATH DE number 2108141
- Contractible triples in 3-connected graphs
- Contractible subgraphs in 3-connected graphs
- Contractible edges in 3-connected graphs
- On the structure of 3-connected matroids and graphs
- On the number of contractible triples in 3-connected graphs
- Contractible non-edges in \(3\)-connected graphs
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Graph theory
- Decomposition of regular matroids
- Title not available (Why is that?)
- Planarity and duality of finite and infinite graphs
- Title not available (Why is that?)
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Modular Constructions for Combinatorial Geometries
- On the structure of 3-connected matroids and graphs
- Some Local Extremal Connectivity Results for Matroids
- Non-separating induced cycles in graphs
- Triads and triangles in 3-connected matroids
- ON MATROID CONNECTIVITY
- On 3-Connected Matroids
- On matroid connectivity
- Contractible edges in triangle-free graphs
- Contractible edges in 3-connected graphs
- On 3-connected matroids
- Longest cycles in 3-connected graphs contain three contractible edges
- On matroid connectivity
- Matroids and graphs with few non-essential elements
- On a matroid generalization of graph connectivity
- The 3‐connected graphs having a longest cycle containing only three contractible edges
Cited In (11)
- On contracting hyperplane elements from a 3-connected matroid
- Contractible bonds in graphs
- Distribution of contractible elements in 2-connected matroids
- On the structure of 3-connected matroids and graphs
- A splitter theorem on 3-connected matroids
- Title not available (Why is that?)
- Triangle-roundedness in matroids
- On 3-connected minors of 3-connected matroids and graphs
- A longest cycle version of Tutte's wheels theorem
- On the number of triangles in 3-connected matroids
- Contractible edges in 3-connected graphs that preserve a minor
This page was built for publication: On contractible and vertically contractible elements in 3-connected matroids and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377720)
