In the second part of the talk we shall investigate matching-covered graphs. A connected graph G is matching-covered if each edge belongs to some perfect matching of G. A short and simple proof will be given for the "Two Ear Theorem" of Lovász and Plummer on matching-covered graphs.