A Construction Method For Minimally K-Edge-Connected Graphs

DOI10.1016/S0167-5060(08)70062-1MaRDI QIDQ3903034zbMATH OpenOpenAlexFDO

Authors M. A. Habib, B. Péroche

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

zbMATH Keywords

construction method for minimally k-edge-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Cited in

(5)

• Minimally 4-edge\(^ \#\)-connected graphs
• 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
• Uniformly k-edge-connected graphs

This page was built for publication: A Construction Method For Minimally K-Edge-Connected Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903034)