Critically n-Connected Graphs
From MaRDI portal
Publication:5635467
DOI10.2307/2038307zbMath0228.05118OpenAlexW4233276469MaRDI QIDQ5635467
Gary Chartrand, Agnis Kaugars, Don R. Lick
Publication date: 1972
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2038307
Related Items (10)
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Deleting vertices from a 2-connected graph with preserving 2-connectedness ⋮ On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ Unnamed Item ⋮ On critical 3-connected graphs with two vertices of degree 3. I ⋮ The decomposition tree of a biconnected graph ⋮ On robust clusters of minimum cardinality in networks ⋮ On proper edge 3-colorings of a cubic graph ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three ⋮ Unnamed Item
This page was built for publication: Critically n-Connected Graphs
