A Note on k-Critically n-Connected Graphs

DOI10.2307/2040965zbMath0341.05120OpenAlexW50487133MaRDI QIDQ4108367

Roger Entringer, Peter J. Slater

Publication date: 1977

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2040965

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (6)

On multiply critically h-connected graphs ⋮ On a conjecture of Entringer and Slater ⋮ Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)] ⋮ On locally \(k\)-critically \(n\)-connected graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

This page was built for publication: A Note on k-Critically n-Connected Graphs