Conditions for families of disjoint \(k\)-connected subgraphs in a graph

DOI10.1016/j.disc.2012.12.013zbMath1260.05086OpenAlexW2062609760MaRDI QIDQ1942666

Paul S. Wenger, Michael Ferrara, Colton Magnant

Publication date: 19 March 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.12.013

zbMATH Keywords

connectivityedge density

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Density (toughness, etc.) (05C42)

Related Items (3)

Partitioning a Graph into Highly Connected Subgraphs ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ 2-proper partition of a graph

This page was built for publication: Conditions for families of disjoint \(k\)-connected subgraphs in a graph