The tree of cuts and minimal k-connected graphs

DOI10.1007/S10958-016-2696-2MaRDI QIDQ291167zbMATH OpenOpenAlexFDO

Authors D. V. Karpov

Publication date 7 June 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-016-2696-2

zbMATH Keywords

\(k\)-connectivity

Mathematics Subject Classification ID

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

Recommendations

• Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
• Blocks in \(k\)-connected graphs
• Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
• scientific article; zbMATH DE number 1154595
• On the structure of a k-connected graph

Cites work

• Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
• scientific article; zbMATH DE number 5161490 (Why is no real title available?)
• scientific article; zbMATH DE number 878899 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Minimally 2-connected graphs.
• On Minimal Blocks
• Zur Struktur minimal n-fach zusammenhängender Graphen

Cited in

(19)

• On the structure of a k-connected graph
• Graphs with largest number of minimum cuts
• Generalized flowers in \(k\)-connected graphs
• The number of subtrees in graphs with given number of cut edges
• Characterization of \(k\)-subconnected graphs
• Blocks in \(k\)-connected graphs
• On the minimum number of components in a cotree of a graph
• Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
• Vertex cuts
• scientific article; zbMATH DE number 3956440 (Why is no real title available?)
• Minimization Problems for Infinite n-Connected Graphs
• scientific article; zbMATH DE number 1154595 (Why is no real title available?)
• scientific article; zbMATH DE number 5938876 (Why is no real title available?)
• scientific article; zbMATH DE number 5040143 (Why is no real title available?)
• Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
• Generalized cut trees for edge-connectivity
• Cuts, trees and \(\ell_1\)-embeddings of graphs
• On the structure of vertex cuts separating the ends of a graph
• Generalized flowers in \(k\)-connected graphs. II

This page was built for publication: The tree of cuts and minimal \(k\)-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291167)