A sufficient condition for equality of edge-connectivity and minimum degree of a graph

DOI10.1002/JGT.3190030307zbMATH Open0417.05040OpenAlexW2014330397MaRDI QIDQ3206988FDOQ3206988

Authors: Donald L. Goldsmith, R. C. Entringer 

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030307

zbMATH Keywords

minimum degreeconnected graphedge-connectivity

Mathematics Subject Classification ID

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

Cited In (5)

• Neighborhood and degree conditions for super-edge-connected bipartite digraphs
• The connected cutset connectivity of a graph
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Local-edge-connectivity in digraphs and oriented graphs
• Inverse degree and edge-connectivity

This page was built for publication: A sufficient condition for equality of edge-connectivity and minimum degree of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206988)