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

DOI10.1016/0167-6377(87)90055-1zbMATH Open0696.90079OpenAlexW2074520661MaRDI QIDQ911485FDOQ911485

Authors: N. E. Zubov 

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90055-1

Recommendations

• The perfectly matchable subgraph polytope of an arbitrary graph
• Perfectly matchable subgraph problem on a bipartite graph
• A separation algorithm for the matchable set polytope
• PM-compact graphs and vertex-deleted subgraphs
• Perfect matching and polymatroids

zbMATH Keywords

convex hullmaximum flowbipartite graphsseparation problemindependence vectorperfectly matchable subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graph theory
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• Hamiltonicity in (0-1)-polyhedra
• The perfectly matchable subgraph polytope of a bipartite graph
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
• Toric rings of perfectly matchable subgraph polytopes
• The perfectly matchable subgraph polytope of an arbitrary graph
• Dominants and submissives of matching polyhedra
• Perfectly matchable subgraph problem on a bipartite graph

This page was built for publication: On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911485)