Geodesic
Note on the Structure of Graphs
Canadian mathematical bulletin, Tome 5 (1962) no. 3, pp. 221-227

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

DOI

This paper is concerned with undirected graphs which may be infinite and may contain multiple edges. The Axiom of Choice is assumed. The terms path, infinite path and circuit are used in the same sense as Weg, unendlicher Weg and Kreis, respectively, are used in D. Konig's book [1]. The valency of a vertex is the number of edges incident with it.The length of a path is the number of edges in it. The following theorem is a generalization of the well known fact that if a vertex of a graph is not a cut-vertex (Artikulation [2]) and has valency ≧2, then the graph contains at least one circuit to which the vertex belongs. 
Dirac, G.A. Note on the Structure of Graphs. Canadian mathematical bulletin, Tome 5 (1962) no. 3, pp. 221-227. doi: 10.4153/CMB-1962-021-8
@article{10_4153_CMB_1962_021_8,
     author = {Dirac, G.A.},
     title = {Note on the {Structure} of {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {221--227},
     year = {1962},
     volume = {5},
     number = {3},
     doi = {10.4153/CMB-1962-021-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-021-8/}
}
TY  - JOUR
AU  - Dirac, G.A.
TI  - Note on the Structure of Graphs
JO  - Canadian mathematical bulletin
PY  - 1962
SP  - 221
EP  - 227
VL  - 5
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-021-8/
DO  - 10.4153/CMB-1962-021-8
ID  - 10_4153_CMB_1962_021_8
ER  - 
%0 Journal Article
%A Dirac, G.A.
%T Note on the Structure of Graphs
%J Canadian mathematical bulletin
%D 1962
%P 221-227
%V 5
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-021-8/
%R 10.4153/CMB-1962-021-8
%F 10_4153_CMB_1962_021_8

Cité par Sources :