Geodesic
Sequences of Euler Graphs
Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 177-182

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

DOI

A graph is called Euler if it has no isolated vertices and every vertex has even or infinite degree. The graphs we consider may have multiple edges but no loops. Loosely speaking, we will be concerned with the conditional compactness of the set of all countable Euler subgraphs of a given graph. 
Sabidussi, Gert. Sequences of Euler Graphs. Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 177-182. doi: 10.4153/CMB-1966-022-7
@article{10_4153_CMB_1966_022_7,
     author = {Sabidussi, Gert},
     title = {Sequences of {Euler} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {177--182},
     year = {1966},
     volume = {9},
     number = {2},
     doi = {10.4153/CMB-1966-022-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-022-7/}
}
TY  - JOUR
AU  - Sabidussi, Gert
TI  - Sequences of Euler Graphs
JO  - Canadian mathematical bulletin
PY  - 1966
SP  - 177
EP  - 182
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-022-7/
DO  - 10.4153/CMB-1966-022-7
ID  - 10_4153_CMB_1966_022_7
ER  - 
%0 Journal Article
%A Sabidussi, Gert
%T Sequences of Euler Graphs
%J Canadian mathematical bulletin
%D 1966
%P 177-182
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-022-7/
%R 10.4153/CMB-1966-022-7
%F 10_4153_CMB_1966_022_7

Cité par Sources :