A characterization of PM-compact bipartite and near-bipartite graphs

作者：Wang Xiumei^*; Lin Yixun; Carvalho Marcelo H; Lucchesi Claudio L; Sanjith G; Little C H C

来源：Discrete Mathematics, 2013, 313(6): 772-783.

DOI：10.1016/j.disc.2012.12.015

• Perfect-matching polytope
• Perfect-matching graph

The perfect-matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. This paper characterizes bipartite and nearly bipartite graphs whose 1-skeleton graphs of perfect-matching polytopes have diameter 1.

• 出版日期2013-3-28
• 单位郑州大学