@article {
author = {Volkmann, Lutz and Hong, Zhen-Mu},
title = {Sufficient conditions for maximally edge-connected and super-edge-connected},
journal = {Communications in Combinatorics and Optimization},
volume = {2},
number = {1},
pages = {35-41},
year = {2017},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2017.13594},
abstract = {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.},
keywords = {edge-connectivity,Maximally edge-connected graphs,Super-edge-connected graphs},
url = {http://comb-opt.azaruniv.ac.ir/article_13594.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13594_f13dab4717cdbf819f2dae83f101834a.pdf}
}