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

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