A min-max relation for K_ 3-covers in graphs noncontractible to K_ 5 e

DOI10.1016/0166-218X(94)00153-5MaRDI QIDQ1900147zbMATH OpenFDO

Authors A. R. 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

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

Recommendations

• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• Total dual integrality of triangle covering
• On a conjecture of Tuza about packing and covering of triangles
• Small edge sets meeting all triangles of a graph

Cites work

• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• A generalization of max flow—min cut
• Bemerkungen zu Hadwigers Vermutung
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Edge-Deletion Problems
• Ki-covers. II.Ki-perfect graphs
• On a composition of independence systems by circuit identification
• Perfect zero–one matrices
• \(K_ i\)-covers. I: Complexity and polytopes

Cited in

(4)

• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering
• Polyhedral results for the bipartite induced subgraph problem
• Total dual integrality of triangle covering

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

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