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.
No takes yet. Share an insight, caveat, or question.
W. T. Tutte (1952) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: