A Construction Method For Minimally K-Edge-Connected Graphs
From MaRDI portal
Publication:3903034
DOI10.1016/S0167-5060(08)70062-1zbMath0455.05042OpenAlexW43469265MaRDI QIDQ3903034
Michel A. Habib, Bernard Peroche
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70062-1
Related Items (4)
Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ Minimally 4-edge\(^ \#\)-connected graphs
This page was built for publication: A Construction Method For Minimally K-Edge-Connected Graphs
