Sciweavers

DM
2006
103views more  DM 2006»
14 years 15 days ago
Bounds on the forcing numbers of bipartite graphs
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
Seth Kleinerman