Abstract
Let G be a simple connected graph. A perfect matching (or Kekule structure in chemical language) of G is a set of disjoint edges which covers all vert......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
