Adjacent vertices on the b-matching polyhedron

https://doi.org/10.1016/0012-365X(81)90256-9Get rights and content
Under an Elsevier user license
open archive

Abstract

Given a graph G = (V,E) and an integer vector Nv, a b-matching is a set of edges FE 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.

Cited by (0)

Supported by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.