Edge‐connectivity in p‐partite graphs
Lutz Volkmann · Journal of Graph Theory · 1989
Abstract Let G = (V, E) be a finite, simple p‐partite graph with minimum degree δ and edge‐connectivity γ. It is proved that if |V| ⩽ (2pδ)/(p ‐ 1) ‐ 2 or in special cases that if |V| ⩽ (2pδ)/(p ‐ 1) ‐ 1, then λ = δ. It is further shown that this result is best possible.