The two ear theorem on matching-covered graphs
We give a simple and short proof for the two ear theorem on matching-covered graphs which is a well-known result of Lovász and Plummer. The proof relies only on the classical results of Tutte and Hall on perfect matchings in (bipartite) graphs.
scientific article; zbMATH DE number 1186395