The perfectly matchable subgraph polytope of an arbitrary graph

DOI10.1007/BF02125345zbMATH Open0723.05087MaRDI QIDQ757431FDOQ757431

Authors: E. Balas, William R. Pulleyblank 

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
• Perfectly matchable subgraph problem on a bipartite graph
• The perfect matching polytope and solid bricks
• Dominants and submissives of matching polyhedra
• Perfect matching and polymatroids

zbMATH Keywords

perfectly matchable subgraph polytope

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• The perfectly matchable subgraph polytope of a bipartite graph
• Perfect matchings of a graph
• Title not available (Why is that?)
• The perfectly matchable subgraph polytope of an arbitrary graph

Cited In (31)

• The Graphs with All Subgraphs T-Perfect
• Skeleton matching polytope: realization and isomorphism
• Matchability and \(k\)-maximal matchings
• A polytope for a product of real linear functions in 0/1 variables
• Discrete relaxations of combinatorial programs
• The convex hull of two core capacitated network design problems
• Extended formulations in combinatorial optimization
• The perfect matching polytope and solid bricks
• An analytical comparison of different formulations of the travelling salesman problem
• \(b\)-matching degree-sequence polyhedra
• Stable sets and polynomials
• Toric rings of perfectly matchable subgraph polytopes
• Improved algorithms for even factors and square-free simple \(b\)-matchings
• When is the matching polytope box-totally dual integral?
• Local search procedures for improving feasible solutions to the sequential ordering problem
• Extended formulations in combinatorial optimization
• The perfectly matchable subgraph polytope of an arbitrary graph
• The optimal path-matching problem
• Projections of the capacitated network loading problem
• PQ-type adjacency polytopes of join graphs
• Projection, lifting and extended formulation integer and combinatorial optimization
• A separation algorithm for the matchable set polytope
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• An analytic symmetrization of max flow-min cut
• Projecting systems of linear inequalities with binary variables
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set
• Title not available (Why is that?)
• Dominants and submissives of matching polyhedra
• Perfectly matchable subgraph problem on a bipartite graph
• The maximum fuzzy weighted matching models and hybrid genetic algorithm

This page was built for publication: The perfectly matchable subgraph polytope of an arbitrary graph

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