Title of article
Bounds on the forcing numbers of bipartite graphs Original Research Article
Author/Authors
Seth Kleinerman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
66
To page
73
Abstract
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
Keywords
Forcing number , Perfect matching , torus
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948158
Link To Document