An upper bound for orders of certain \((k,\bar k)\)-connected graphs

DOI10.1016/0012-365X(93)E0093-JzbMath0820.05044OpenAlexW2077445293MaRDI QIDQ1343278

Kiyoshi Ando

Publication date: 1 February 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0093-j

zbMATH Keywords

ordersupper boundminimum cutconnectivityconnected graphcomponentscritical graphelemental fragments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Critically \((k,k)\)-connected graphs
• On critically h-connected simple graphs
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: An upper bound for orders of certain \((k,\bar k)\)-connected graphs