Paths, Trees, and Flowers
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 edge is said to join its end-points.
KeywordsMinimum Cover Maximum Match Maximum Cardinality Flowered Tree Matching Edge
Unable to display preview. Download preview PDF.
- 1.C. Berge, Two theorems in graph theory, Proc. Natl. Acad. Sci. U.S., 43 (1957), 842–4.Google Scholar
- 2.C. Berge, The theory of graphs and its applications (London, 1962).Google Scholar
- 4.J. Edmonds, Maximum matching and a polyhedron with (0, 1) vertices, appearing in J. Res. Natl. Bureau Standards 69B (1965).Google Scholar
- 5.L. R. Ford, Jr. and D. R. Fulkerson, Flows in networks (Princeton, 1962).Google Scholar
- 6.A. J. Hoffman, Some recent applications of the theory of linear inequalities to extremal com- binatorial analysis, Proc. Symp. on Appl. Math., 10 (1960), 113–27.Google Scholar
- 7.R. Z. Norman and M. O. Rabin, An algorithm for a minimum cover of a graph, Proc. Amer. Math. Soc, 10 (1959), 315–19.Google Scholar
- 9.C. Witzgall and C. T. Zahn, Jr., Modification of Edmonds’ algorithm for maximum matching of graphs, appearing in J. Res. Natl. Bureau Standards 69B (1965).Google Scholar