Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T14:11:55.436Z Has data issue: false hasContentIssue false
  • English
  • Français

Euler Lines in Infinite Directed Graphs

Published online by Cambridge University Press:  20 November 2018

C. ST. J. A. Nash-Williams
C. ST. J. A. Nash-Williams*
Affiliation:
Universities of Waterloo and A berdeen
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.

While the contents of the author's doctoral thesis (4) have, owing to their lengthy nature, been published only in small part (5, §2; 6; 7), the absence from the literature of graph theory of any characterization of infinite directed graphs with Euler lines seems to constitute a definite gap that prompts the publication in the present paper of some further material from (4). The main results characterizing such directed graphs will be obtained in §§2 and 3. In §4, we shall indicate an alternative (and perhaps better) formulation of one of these results, some extensions obtained in (4), and some comparisons between parallel results for undirected and directed graphs. A familiarity with the definitions and results of (7) will be assumed in §4, but not before.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966, pp. 692 - 714
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Berge, C., The theory of graphs and its applications (1958), English translation by Alison Doig (London and New York, 1962).Google Scholar
2. Erdös, P., Grünwald, T., and Vázsonyi, E., Über Euler-linien unendlicher Graphen, J. Math. Phys., 17 (1938), 59–75.Google Scholar
3. König, D., Theorie der endlichen und unendlichen Graphen (Leipzig, 1936; reprinted New York, 1950).Google Scholar
4. Nash-Williams, C. St. J. A., Decomposition of graphs into infinite chains (Thesis, Cambridge, 1958).Google Scholar
5. Nash-Williams, C. St. J. A., Decomposition of graphs into closed and endless chains, Proc. London Math. Soc. (3), 10 (1960), 221–238.Google Scholar
6. Nash-Williams, C. St. J. A., Decomposition of finite graphs into open chains, Can. J. Math., 13 (1961), 157–166.Google Scholar
7. Nash-Williams, C. St. J. A., Decomposition of graphs into two-way infinite paths, Can. J. Math., 15 (1963), 479–485.Google Scholar
8. Ore, O., Theory of graphs (Providence, 1962).Google Scholar