Hostname: page-component-7c8c6479df-ph5wq Total loading time: 0 Render date: 2024-03-28T19:21:30.310Z Has data issue: false hasContentIssue false

The Factorization of Locally Finite Graphs

Published online by Cambridge University Press:  20 November 2018

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.

1. Introduction. A graph G consists of a set V(G) of objects called nodes and a set M (G) of objects called links, V(G) and M (G) having no members in common. With each link A there is associated just two nodes said to be the ends of A, or to be incident with A, or to be joined by A. The sets V(G) and M(G) may be finite or infinite. There may be nodes with which no link is incident. Such nodes are said to be isolated.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1950