Adjacent vertices on the b-matching polyhedron

Given a graph G = (V,E) and an integer vector $\text{b?}\text{N}{}^{\mathrm{v}}$, a b-matching is a set of edges F?E such that any vertex v?V is incident to at most b_v 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.