Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-24T23:25:36.744Z Has data issue: false hasContentIssue false
  • English
  • Français

A Short Proof of the Factor Theorem for Finite Graphs

Published online by Cambridge University Press:  20 November 2018

W. T. Tutte
W. T. Tutte*
Affiliation:
University of Toronto
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 define a graph as a set V of objects called vertices together with a set E of objects called edges, the two sets having no common element. With each edge there are associated just two vertices, called its ends. We say that an edge joins its ends. Two vertices may be joined by more than one edge.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 6 , 1954 , pp. 347 - 352
Copyright
Copyright © Canadian Mathematical Society 1954

References

1. Belck, H. B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., 188 (1950), 228–252.Google Scholar
2. König., D. Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).Google Scholar
3. Maunsell, F. G., A note on Tutte's paper “The factorization of linear graphs, ”1 J. London Math. Soc, 27 (1952), 127–128.Google Scholar
4. Tutte, W. T., The factorization of linear graphs, J. London Math. Soc, 22 (1947), 107–111.Google Scholar
5. Tutte, W. T., The factors of graphs, Can. J. Math., 4 (1952), 314–328.Google Scholar
6. Whitney, Hassler, Non-separable and planar graphs, Trans. Amer. Math. Soc, 34 (1932), 339–362.Google Scholar