Minimally 3-connected graphs

DOI10.1016/0095-8956(86)90074-2zbMath0601.05032OpenAlexW1994058044MaRDI QIDQ1080868

Robin W. Dawes

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90074-2

zbMATH Keywords

connectivityconstructive characterizationminimally 3-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (10)

Decomposition of 3-connected graphs ⋮ Minimum self-repairing graphs ⋮ Geodesic geometry on graphs ⋮ Uniformly 3‐connected graphs ⋮ Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Minimally 3-connected binary matroids ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ \(N\)-critical matroids ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs

Cites Work

• Bounded graphs
• A classification of 4-connected graphs
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Minimally 2-connected graphs.
• On Minimal Blocks
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimally 3-connected graphs