Hostname: page-component-69cd664f8f-vwfj8 Total loading time: 0 Render date: 2025-03-12T11:28:48.392Z Has data issue: false hasContentIssue false
  • English
  • Français

The Factors of Graphs

Published online by Cambridge University Press:  20 November 2018

W. T. Tutte
W. T. Tutte*
Affiliation:
The 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.

A graph G consists of a non-null 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. Two or more edges may have the same pair of ends.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 4 , 1952 , pp. 314 - 328
Copyright
Copyright © Canadian Mathematical Society 1952

References

1. Belck, H. B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., vol. 188 (1950), 228–252.Google Scholar
2. Gallai, T., On factorization of graphs, Acta Mathematica Academiae Scientarum Hungaricae, vol. 1 (1950), 133–153.Google Scholar
3. Hall, P., On representation of subsets, J. London Math. Soc., vol. 10 (1934), 26–30.Google Scholar
4. Petersen, J., Die Theorie der regulären Graphs, Acta Math., vol. 15 (1891), 193–220.Google Scholar
5. Rado, R., Factorization of even graphs, Quarterly J. Math., vol. 20 (1949), 95–104.Google Scholar
6. Tutte, W. T., The factorization of linear graphs, J. London Math. Soc., vol. 22 (1947), 107–111.Google Scholar
7. Tutte, W. T., The factorization of locally finite graphs, Can. J. Math., vol. 1 (1950), 44–49.Google Scholar