Critically n-Connected Graphs

DOI10.2307/2038307zbMath0211.27002OpenAlexW4233276469MaRDI QIDQ5612354

Agnis Kaugars, Gary Chartrand, 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)

Related Items (30)

Connectivity keeping trees in k-connected graphs ⋮ Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs ⋮ An upper bound for orders of certain \((k,\bar k)\)-connected graphs ⋮ Critically \((k,k)\)-connected graphs ⋮ The connected cutset connectivity of a graph ⋮ On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups ⋮ Connectivity keeping trees in 3-connected or 3-edge-connected graphs ⋮ Mader's conjecture for graphs with small connectivity ⋮ Critical vertices in \(k\)-connected digraphs ⋮ On critically h-connected simple graphs ⋮ Connectivity keeping stars or double-stars in 2-connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ On critical 3-connected graphs with two vertices of degree 3. II ⋮ An upper bound for the minimum degree of a graph ⋮ Connectivity keeping caterpillars and spiders in 2-connected graphs ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Connectivity keeping trees in \(2\)-connected graphs with girth conditions ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Extremal infinite graph theory ⋮ Connectivity keeping paths in k-connected graphs ⋮ Connectivity keeping trees in 2-connected graphs ⋮ Complete graph-tree planar Ramsey numbers ⋮ The reconstruction of maximal planar graphs. I: Recognition ⋮ The reconstruction of maximal planar graphs. II: Reconstruction ⋮ The class reconstruction number of maximal planar graphs ⋮ Connectivity keeping paths in \(k\)-connected bipartite graphs ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ Non-\(\kappa\)-critical vertices in graphs ⋮ Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) ⋮ Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

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