Adjacent vertices on the b-matching polyhedron

AbstractGiven a graph G = (V,E) and an integer vector bϵNv, a b-matching is a set of edges F⊂E such that any vertex v ϵ V is incident to at most bv edges in F. The adjacency on the convex hull of the incidence vectors of the b-matchings is characterized by a very general adjacency criterion, the coloring criter on, which is at least sufficient for all 0–1-polyhedra and which can be checked in the b-matching case by a linear algorithm