Making the components of a graph \(k\)-connected

DOI10.1016/j.dam.2006.07.007zbMath1117.05059OpenAlexW2076193743MaRDI QIDQ868399

Richard H. Schelp, Vladimir Nikiforov

Publication date: 2 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.007

zbMATH Keywords

cutsetminimum degree

Mathematics Subject Classification ID

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

Related Items (1)

Partitioning a Graph into Highly Connected Subgraphs

Cites Work

• Unnamed Item

This page was built for publication: Making the components of a graph \(k\)-connected