Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-12T21:02:11.138Z Has data issue: false hasContentIssue false
  • English
  • Français

Infinite Euler Graphs

Published online by Cambridge University Press:  20 November 2018

Gert Sabidussi
Gert Sabidussi*
Affiliation:
McMaster University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is well known that for finite connected graphs the following are equivalent:

  1. (i) X is Euler (i.e., every vertex of X has positive even degree);

  2. (ii) X is traceable (i.e., the edges of X can be arranged in a sequence e1, . . . ,en such that ei ≠ ej if i ≠ j, and ei, e i+1 are adjacent, i = 1, . . . , n, subscripts considered mod n) ;

  3. (iii) X is cyclically coverable (i.e., X contains a family of non-overlapping circuits whose union is X).

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 16 , 1964, pp. 821 - 838
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Dirac, G. A., Note on the structure of graphs, Can. Math. Bull., 5 (1962), 221–227.Google Scholar
2. Erd, P.ös, T. Grunwald, and E. Vázsonyi, Über Euler-Linien unendlicher Graphen, J. Math. Phys., 17 (1938), 59–75.Google Scholar
3. König, D., Théorie der endlichen und unendlichen Graphen (Leipzig, 1936).Google Scholar
4. Ore, O., Theory of graphs, Amer. Math. Soc. Colloq. Publ., 88 (1962).Google Scholar