A Construction Method For Minimally K-Edge-Connected Graphs
From MaRDI portal
Publication:3903034
DOI10.1016/S0167-5060(08)70062-1zbMath0455.05042MaRDI QIDQ3903034
Michel A. Habib, Bernard Peroche
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
05C40: Connectivity
Related Items
Removable edges in cycles of a \(k\)-connected graph, Minimally 4-edge\(^ \#\)-connected graphs, Removable edges in a 5-connected graph and a construction method of 5-connected graphs