Abstract
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.
Cite
CITATION STYLE
APA
Tutte, W. T. (1952). The Factors of Graphs. Canadian Journal of Mathematics, 4, 314–328. https://doi.org/10.4153/cjm-1952-028-2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free