TY - JOUR
ID - 13594
TI - Sufficient conditions for maximally edge-connected and super-edge-connected
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Volkmann, Lutz
AU - Hong, Zhen-Mu
AD - RWTH Aachen University
AD - Anhui University of Finance and Economics
Y1 - 2017
PY - 2017
VL - 2
IS - 1
SP - 35
EP - 41
KW - edge-connectivity
KW - Maximally edge-connected graphs
KW - Super-edge-connected graphs
DO - 10.22049/cco.2017.13594
N2 - 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.
UR - http://comb-opt.azaruniv.ac.ir/article_13594.html
L1 - http://comb-opt.azaruniv.ac.ir/article_13594_f13dab4717cdbf819f2dae83f101834a.pdf
ER -