Title of article
Perfect matchings and ears in elementary bipartite graphs Original Research Article
Author/Authors
Pierre Hansen، نويسنده , , Fuji Zhang، نويسنده , , Maolin Zheng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
8
From page
131
To page
138
Abstract
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, a method to construct all minimal elementary bipartite graphs is described.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951666
Link To Document