Let S be a cut of a simple connected graph G. If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G-S is called a fragment. And a fragment with no proper subset that is a fragment is called an end. In the paper ends are characterized and it is proved that to a connected graph G = (V,E), the number of its ends Σ ≤ |V(G)|.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1113,
author = {Xiaofeng Jia},
title = {Some results concerning the ends of minimal cuts of simple graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {20},
year = {2000},
pages = {139-142},
zbl = {0959.05068},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1113}
}
Xiaofeng Jia. Some results concerning the ends of minimal cuts of simple graphs. Discussiones Mathematicae Graph Theory, Tome 20 (2000) pp. 139-142. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1113/
[000] [1] B. Bollobas, Extremal Graph Theory (Academic Press, New York, 1978). | Zbl 0419.05031
[001] [2] H. Veldman, Non k-Critical Vertices in Graphs, Discrete Math. 44 (1983) 105-110, doi: 10.1016/0012-365X(83)90009-2. | Zbl 0542.05043