On several sorts of connectivity

DOI10.1016/0012-365X(83)90121-8zbMath0526.05035MaRDI QIDQ594898

Bernard Peroche

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge connectivitycyclic connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (14)

The \(k\)-subconnectedness of planar graphs ⋮ A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) ⋮ A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs ⋮ Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs ⋮ Characterization of \(k\)-subconnected graphs ⋮ Cycle-connected mixed graphs and related problems ⋮ Cycle-connected mixed graphs and related problems ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ A polynomial time algorithm for cyclic vertex connectivity of cubic graphs ⋮ Minimally 4-edge\(^ \#\)-connected graphs

Cites Work

• On k-minimally n-edge-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On several sorts of connectivity