On critically h-connected simple graphs
From MaRDI portal
Publication:1148332
DOI10.1016/0012-365X(80)90263-0zbMath0452.05043OpenAlexW2067831865MaRDI QIDQ1148332
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90263-0
Related Items (16)
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs ⋮ Deleting vertices from a 2-connected graph with preserving 2-connectedness ⋮ An upper bound for orders of certain \((k,\bar k)\)-connected graphs ⋮ Critically \((k,k)\)-connected graphs ⋮ On critical 3-connected graphs with two vertices of degree 3. I ⋮ The symmetric (2k, k)-graphs ⋮ The decomposition tree of a biconnected graph ⋮ On critical 3-connected graphs with two vertices of degree 3. II ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Extremal infinite graph theory ⋮ Connectivity keeping paths in k-connected graphs ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ Connectivity keeping paths in \(k\)-connected bipartite graphs ⋮ Non-\(\kappa\)-critical vertices in graphs ⋮ Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
Cites Work
This page was built for publication: On critically h-connected simple graphs
