What people are saying - Write a review
We haven't found any reviews in the usual places.
TRANSVERSAL THEORY AND GRAPHS
ON THE SHORTEST ROUTE
3 other sections not shown
Other editions - View all
adjacent application arcs associated assume bipartite graph black squares branch called capacity cardinality clique color combinatorial connected consider construct contains Corollary corresponding cost cover cycle defined denoted determine directed distinct dominos edge elements equal equivalent example exists Figure finite flow flow problem function given gives graph G Hence incident independent inequality infinite interval joined joint resistance least length linear lines matching Math matrix matroid maximal maximal flow maximum meet method minimal obtained original pair parallel path period points possible problem proof prove pruned board question red squares relation replacing representatives requirements resistor satisfies separating set of nodes shown in Figure side simple sink squares STUDIES subsets Suppose synthesized termed terminal theorem theory transversal transversal matroid tree unit vector vertices