On graphs with equal edge connectivity and minimum degree

DOI10.1016/0012-365X(79)90139-0zbMath0423.05026OpenAlexW2081631658MaRDI QIDQ1134165

Béla Bollobás

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90139-0

zbMATH Keywords

edge connectivityminimum degree of a graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (11)

On the edge-connectivity of C_4-free graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Degree sequences of random graphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ A binomial approximation method for the Ising model

Cites Work

• Unnamed Item
• Unnamed Item
• Studies on directed graphs. I, II
• On graphs with equal edge-connectivity and minimum degree
• Results on the edge-connectivity of graphs
• A Graph-Theoretic Approach to a Communications Problem

This page was built for publication: On graphs with equal edge connectivity and minimum degree