On several sorts of connectivity
From MaRDI portal
Publication:594898
DOI10.1016/0012-365X(83)90121-8zbMath0526.05035MaRDI QIDQ594898
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
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, 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
