Hostname: page-component-848d4c4894-x24gv Total loading time: 0 Render date: 2024-05-08T14:11:55.035Z Has data issue: false hasContentIssue false
  • English
  • Français

Decomposition of Graphs into Two-Way Infinite Paths

Published online by Cambridge University Press:  20 November 2018

C. ST. J. A. Nash-Williams
C. ST. J. A. Nash-Williams*
Affiliation:
University of 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.

We consider undirected graphs in which two vertices may be joined by more than one edge and in which a vertex may be joined to itself by one or more edges. G will always denote a graph. The set of vertices [edges] of G will be denoted by V(G) [E(G)]. G is finite or infinite according as V(G) ∪ E(G) is finite or infinite. The degree, d(ξ) or dG(ξ), of a vertex ξ of G is 2a + b, where a is the number of edges joining ξ to itself and b is the number of those joining ξ to other vertices.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 15 , 1963 , pp. 479 - 485
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. St, C.. J. A. Nash-Williams, Decomposition of graphs into closed and endless chains, Proc London Math. Soc. (3), 10 (1960), 221–238.Google Scholar
2. St, C.. Nash-Williams, J. A., Decomposition of graphs into infinite chains (thesis, Cambridge, 1958).Google Scholar
3. Ore, O., Theory of graphs (Providence, 1962).Google Scholar