Characterization of minimally \((2,l)\)-connected graphs

DOI10.1016/j.ipl.2011.09.012zbMath1260.05087OpenAlexW2078756938MaRDI QIDQ1944218

Senmei Yao, Hong-Jian Lai, Xiaofeng Gu

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.012

zbMATH Keywords

combinatorial problemsconnectivity\(l\)-connectivity\((k,l)\)-connected graphsminimally \((2,l)\)-connected graphsminimally \(k\)-connected graphs

Mathematics Subject Classification ID

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

Related Items (2)

ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Cites Work

• On the \(\ell\)-connectivity of a graph
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• Minimally 2-edge connected graphs
• Minimally (k, k)‐edge‐connected graphs
• Minimally 2-connected graphs.
• On Minimal Blocks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization of minimally \((2,l)\)-connected graphs