Critically n-Connected Graphs

DOI10.2307/2038307MaRDI QIDQ5635467zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Connectivity (05C40)

Cited in

(12)

• Deleting vertices from a 2-connected graph with preserving 2-connectedness
• On the structure of \(C_3\)-critical minimal 6-connected graphs
• On critical 3-connected graphs with two vertices of degree 3. I
• Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
• On robust clusters of minimum cardinality in networks
• On proper edge 3-colorings of a cubic graph
• The decomposition tree of a biconnected graph
• scientific article; zbMATH DE number 3544091 (Why is no real title available?)
• Non-path results on the connectivity keeping problem
• A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
• scientific article; zbMATH DE number 3501524 (Why is no real title available?)
• Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

This page was built for publication: Critically n-Connected Graphs

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