Graph substitution and set packing polytopes

DOI10.1002/NET.3230070307zbMATH Open0363.90046OpenAlexW2097848790MaRDI QIDQ4138451FDOQ4138451

Authors: E. Balas, Eitan Zemel 

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070307

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Cites Work

• On certain polytopes associated with graphs
• Maximum matching and a polyhedron with 0,1-vertices

Cited In (4)

• A polyhedral view to a generalization of multiple domination
• On the X-join decomposition for undirected graphs
• Partitive hypergraphs
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets

This page was built for publication: Graph substitution and set packing polytopes

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