A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS
Xiumei Wang, Weiping Shang, Yixun Lin, Marcelo Henriques de Carvalho · Discrete Mathematics Algorithms and Applications · 2014
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.