Minimal biconnected graphs

DOI10.1007/s10958-014-2199-yzbMath1329.05170OpenAlexW1988162800MaRDI QIDQ906762

N. E. Zubov

Publication date: 29 January 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-2199-y

zbMATH Keywords

\(k\)-connected graphconnected component of a graph

Mathematics Subject Classification ID

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

Related Items (3)

Decomposition of a 2-connected graph into three connected subgraphs ⋮ On semi-reconstruction of graphs of connectivity 2 ⋮ Large contractible subgraphs of a 3-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some extremal connectivity results for graphs and matroids
• The decomposition of graphs into \(k\)-connected components
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Minimally 2-connected graphs.
• On Minimal Blocks

This page was built for publication: Minimal biconnected graphs