On k-critical, n-connected graphs
From MaRDI portal
Publication:1245975
DOI10.1016/0012-365X(77)90065-6zbMath0375.05031OpenAlexW2078068332MaRDI QIDQ1245975
Peter J. Slater, Stephen B. Maurer
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(77)90065-6
Related Items (19)
Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) ⋮ Generalizaions of critical connectivity of graphs ⋮ On the existence of \((k,l)\)-critical graphs ⋮ The symmetric (2k, k)-graphs ⋮ On \(k\)-critical connected line graphs ⋮ There exist highly critically connected graphs of diameter three ⋮ Fragments in kcritical n‐connected graphs ⋮ On multiply critically h-connected graphs ⋮ Indestructive deletions of edges from graphs ⋮ On a conjecture of Entringer and Slater ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ On locally \(k\)-critically \(n\)-connected graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Vertex colorings without isolates ⋮ On k-minimally n-edge-connected graphs ⋮ Proof of Mader's conjecture on k‐critical n‐connected graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ On critically connected digraphs ⋮ High connectivity keeping sets in graphs and digraphs
Cites Work
This page was built for publication: On k-critical, n-connected graphs
