Minimally k-connected graphs of low order and maximal size

DOI10.1016/0012-365X(82)90018-8zbMath0522.05040OpenAlexW2044863818WikidataQ127014659 ScholiaQ127014659MaRDI QIDQ1055785

Mao-cheng Cai

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90018-8

zbMATH Keywords

complete bipartite graphminimally k-connected graphs

Mathematics Subject Classification ID

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

Related Items (5)

Uniformly 3‐connected graphs ⋮ On extremal \(k\)-outconnected graphs ⋮ The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)

Cites Work

• Unnamed Item
• Unnamed Item
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Minimally k-connected graphs of low order and maximal size