Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-15T06:40:12.009Z Has data issue: false hasContentIssue false
  • English
  • Français

Decomposition of Finite Graphs into Open Chains

Published online by Cambridge University Press:  20 November 2018

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

If m, n are integers, “m = n” will mean “m = n (mod 2 ).“ The cardinal number of a set A will be denoted by |A|. The set whose elements are a1 a2, … , an will be denoted by {a1, a2, … , an}. The empty set will be denoted by Ø. If A, B, C are sets, A — B will denote the set of those elements of A which do not belong to B, and A — B — C will denote (A — B)— C. The expression Σε∈Af(ε) will be denoted by f. A. The statements “f = g on A,” “f ≡ g on A” will mean that f(ε) = g(ε) or f(ε) ≡ g(ε) respectively for every ε ∈ A.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 13 , 1961 , pp. 157 - 166
Copyright
Copyright © Canadian Mathematical Society 1961

References

1. König, D., Théorie der endlichen una unendlichen Graphen (Leipzig, 1936, and New York, 1950).Google Scholar