论文信息 - A characterization of PM-compact bipartite and near-bipartite graphs

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

Abstract 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.

[1] László Lovász,et al. Matching structure and the matching lattice , 1987, J. Comb. Theory, Ser. B.

[2] V. Chvátal. On certain polytopes associated with graphs , 1975 .

[3] M. R. Rao,et al. The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..

[4] Weiping Shang,et al. A Characterization of PM-Compact claw-Free cubic graphs , 2014, Discret. Math. Algorithms Appl..