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 demonstrate several techniques to produce upper bounds on the forcing number of bipartite graphs. We present a simple method of showing that the maximum forcing number on the 2m

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Seth Kleinerman
• Keywords: DM 2006, Maximum Forcing Number, Perfect Matching, Smallest Subset