On Perfect Matchings in Matching Covered Graphs

17 Mar 2017 He Jinghua Wei Erling Ye Dong Zhai Shaohui

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$ such that $|M_1\cap X|\not\equiv |M_2\cap X| \pmod 2$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS