论文信息 - A Characterization of PM-Compact claw-Free cubic graphs

A Characterization of PM-Compact claw-Free cubic graphs

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 claw-free cubic graphs whose 1-skeleton graphs of perfect matching polytopes have diameter 1.

[1] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

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

[3] Yixun Lin,et al. A characterization of PM-compact Hamiltonian bipartite graphs , 2015 .

[4] André Raspaud,et al. Fulkerson's Conjecture and Circuit Covers , 1994, J. Comb. Theory, Ser. B.

[5] Claudio L. Lucchesi,et al. A characterization of PM-compact bipartite and near-bipartite graphs , 2013, Discret. Math..

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