Characterization of minimally \((2,l)\)-connected graphs
From MaRDI portal
Publication:1944218
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
combinatorial problemsconnectivity\(l\)-connectivity\((k,l)\)-connected graphsminimally \((2,l)\)-connected graphsminimally \(k\)-connected graphs
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
This page was built for publication: Characterization of minimally \((2,l)\)-connected graphs