A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)

DOI10.1016/0166-218X(94)00153-5zbMath0842.90118MaRDI QIDQ1900147

Ali Ridha Mahjoub

Publication date: 17 October 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polytopestotal dual integralitytriangle-free subgraph polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Polyhedral results for the bipartite induced subgraph problem

Cites Work

• Unnamed Item
• Bemerkungen zu Hadwigers Vermutung
• \(K_ i\)-covers. I: Complexity and polytopes
• On a composition of independence systems by circuit identification
• Ki-covers. II.Ki-perfect graphs
• Edge-Deletion Problems
• A generalization of max flow—min cut
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Perfect zero–one matrices

This page was built for publication: A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)