Geodesic
Cycles and Connectivity in Graphs
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 1319-1328

Voir la notice de l'article provenant de la source Cambridge University Press

In this note, G will denote a finite undirected graph without multiple edges, and V = V(G) will denote its vertex set. The largest integer n for which G is n-vertex connected is the vertex-connectivity of G and will be denoted by λ = λ(G). One defines ζ to be the largest integer z not exceeding |V| such that for any set U ⊂ V with |U| = z, there is a cycle in G which contains U. The symbol i(U) will denote the component index of U. As a standard reference for this and other terminology, the authors recommend O. Ore (3). 
Watkins, M. E.; Mesner, D. M. Cycles and Connectivity in Graphs. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 1319-1328. doi: 10.4153/CJM-1967-121-2
@article{10_4153_CJM_1967_121_2,
     author = {Watkins, M. E. and Mesner, D. M.},
     title = {Cycles and {Connectivity} in {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {1319--1328},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-121-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-121-2/}
}
TY  - JOUR
AU  - Watkins, M. E.
AU  - Mesner, D. M.
TI  - Cycles and Connectivity in Graphs
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 1319
EP  - 1328
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-121-2/
DO  - 10.4153/CJM-1967-121-2
ID  - 10_4153_CJM_1967_121_2
ER  - 
%0 Journal Article
%A Watkins, M. E.
%A Mesner, D. M.
%T Cycles and Connectivity in Graphs
%J Canadian journal of mathematics
%D 1967
%P 1319-1328
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-121-2/
%R 10.4153/CJM-1967-121-2
%F 10_4153_CJM_1967_121_2

[1] 1. Dirac, G. A., In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen, Math. Nachr., 22 (1960), 61–85. Google Scholar

[2] 2. Dirac, G. A., Généralisations du théorème de Menger, C. R. Acad. Sci. Paris, 250 No. 26, (1960), 4252–4253. Google Scholar

[3] 3. Ore, O., Theory of graphs (Providence, R.I., 1962). Google Scholar

Cité par Sources :