%0 Journal Article
%T Sufficient conditions for maximally edge-connected and super-edge-connected
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Volkmann, Lutz
%A Hong, Zhen-Mu
%D 2017
%\ 06/01/2017
%V 2
%N 1
%P 35-41
%! Sufficient conditions for maximally edge-connected and super-edge-connected
%K edge-connectivity
%K Maximally edge-connected graphs
%K Super-edge-connected graphs
%R 10.22049/cco.2017.13594
%X Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph is maximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or super-edge-connected if the number of edges is large enough.
%U http://comb-opt.azaruniv.ac.ir/article_13594_f13dab4717cdbf819f2dae83f101834a.pdf