On Perfect Matchings in Matching Covered Graphs

Jinghua He, Erling Wei, Dong Ye +1

Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2…