1 paper
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan
Lov{á}sz showed that a matching covered graph G has an ear decomposition starting with an arbitrary edge of G. Let G be a graph which has a perfect matching. We call G cycl…