Perfect matchings and ears in elementary bipartite graphs Original Research Article

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.