Paths, Trees, and Flowers
Work
Year: 1965
Type: article
Abstract: A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An ... more
Source: Canadian Journal of Mathematics
Author Jack Edmonds
Cites: 6
Cited by: 2,191
Related to: 10
FWCI: 0.955
Citation percentile (by year/subfield): 98.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze