Indexed metadata
A Short Proof of the Factor Theorem for Finite Graphs
W. T. Tutte
Source record
Source: Crossref
Published: Jan 1, 1954
DOI: 10.4153/cjm-1954-033-3
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.