Critically \((k,k)\)-connected graphs

DOI10.1016/0012-365X(87)90114-2zbMath0629.05042OpenAlexW2078675358MaRDI QIDQ1093652

Kiyoshi Ando, Yoko Usami

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90114-2

zbMATH Keywords

critically (k,k)-connected graph

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

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

This page was built for publication: Critically \((k,k)\)-connected graphs