On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

  • Authors:

  • Ning Qi

  • Affiliations:

  • Mathematics Department, Shandong University, Jinan, China

  • Venue:
  • Operations Research Letters
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

A subgraph F of graph G is called a perfectly matchable subgraph if F contains a set of independent edges convering all the vertices in F. The convex hull of the incidence vectors of perfectly matchable subgraphs of G is a 0-1 polytope. We characterize the adjacency of vertices on such polytopes. We also show that when G is bipartite, the separation problem for such polytones can be solved by maximum flow algorithms.