Contractible non-edges in \(3\)-connected graphs
From MaRDI portal
Publication:1569036
DOI10.1006/jctb.1998.1842zbMath1027.05054OpenAlexW2025296046MaRDI QIDQ1569036
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1842
Related Items (7)
A constructive characterization of 3-connected triangle-free graphs ⋮ Non-contractible non-edges in 2-connected graphs ⋮ Chromatic number, induced cycles, and non-separating cycles ⋮ Contractible non-edges in 3-connected infinite graphs ⋮ Unnamed Item ⋮ On the Structure of Contractible Vertex Pairs in Chordal Graphs ⋮ A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
Cites Work
- Unnamed Item
- Contractible edges in 3-connected graphs
- Generalizaions of critical connectivity of graphs
- Endlichkeitssätze für k-kritische Graphen
- Distribution of contractible edges in k-connected graphs
- Kuratowski's theorem
- Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
- Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
This page was built for publication: Contractible non-edges in \(3\)-connected graphs
