Composition of graphs and the triangle-free subgraph polytope

DOI10.1023/A:1019518830361zbMath1091.90072MaRDI QIDQ1810860

Jean Mailfert, Ali Ridha Mahjoub, Fatiha Bendali

Publication date: 9 June 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

polytopefacettriangle-free subgraphcomposition of polyhedra3-sumTDI

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• \(K_ i\)-covers. I: Complexity and polytopes
• On a composition of independence systems by circuit identification
• Compositions in the bipartite subgraph polytope
• Edge-Deletion Problems
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs

This page was built for publication: Composition of graphs and the triangle-free subgraph polytope