On maximum critically h-connected graphs

DOI10.1016/0012-365X(84)90083-9zbMath0553.05049OpenAlexW2019198093MaRDI QIDQ801933

H. J. Krol, Henk Jan Veldman

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90083-9

zbMATH Keywords

degreecritical connected graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (3)

On Minimum Critically n-Edge-Connected Graphs ⋮ The maximum size of graphs satisfying a degree condition ⋮ On maximum critically h-connected graphs

Cites Work

• Non-\(\kappa\)-critical vertices in graphs
• On maximum critically h-connected graphs
• Parallel concepts in graph theory
• Characterization of maximum critically 2-connected graphs

This page was built for publication: On maximum critically h-connected graphs