On some extremal connectivity results for graphs and matroids

DOI10.1016/0012-365X(82)90206-0zbMath0525.05035MaRDI QIDQ594104

James G. Oxley

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimally 2-connected graphsminimally 3- connected graphminimally connected matroids

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (6)

Elements belonging to triads in 3-connected matroids ⋮ Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) ⋮ Minimal biconnected graphs ⋮ Some extremal connectivity results for matroids ⋮ On extremal connectivity properties of unavoidable matroids ⋮ On minor-minimally-connected matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Extremal critically connected matroids
• Zur Theorie der n-fach zusammenhängenden Graphen
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• ON MATROID CONNECTIVITY
• On Connectivity in Matroids and Graphs
• Connectivity in Matroids
• Minimally 2-connected graphs.
• A theorem on n-connected graphs
• On Minimal Blocks
• A Combinatorial Model for Series-Parallel Networks

This page was built for publication: On some extremal connectivity results for graphs and matroids