Sufficient Degree Conditions for k-Edge-Connectedness of a Graph
Networks, 54(2), September 2009
Nathan W. Kahl, Ph.D.
Department of Mathematics and Computer Science
D. Bauer, S. L. Hakimi and E. Schmeichel
One of Frank Boesch's best known papers is `The strongest monotone degree conditions for n-connectedness of a graph'. In this paper, we give a simple sufficient degree condition for a graph to be k-edge-connected, and also give the strongest monotone condition for a graph to be 2-edge-connected.