Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-23T18:16:10.755Z Has data issue: false hasContentIssue false
  • English
  • Français

Sequences of 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.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 9 , Issue 2 , June 1966 , pp. 177 - 182
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Ore, O., Theory of Graphs, Amer. Math. Soc. Coll. Publ.Google Scholar
2. Sabidussi, G., Infinite Euler Graphs, Canad. J. Math. 16, (1964), 821-838.Google Scholar