Stability critical graphs and ranks facets of the stable set polytope

DOI10.1016/0012-365X(94)00168-IzbMath0838.05068MaRDI QIDQ1910521

Edward C. Sewell, Leslie E. jun. Trotter

Publication date: 24 March 1996

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

zbMATH Keywords

cyclestable set polytopepolynomial-time algorithmnode coveringmax-min relationrank facet

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

On the feedback vertex set polytope of a series-parallel graph ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ On a theorem of Sewell and Trotter ⋮ Stable sets and polynomials

Cites Work

• Matching theory
• Matrices with the Edmonds-Johnson property
• Geometric algorithms and combinatorial optimization
• Stability critical graphs and even subdivisions of \(K_ 4\)
• On certain polytopes associated with graphs
• On the facial structure of set packing polyhedra
• A Theorem on k-Saturated Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability critical graphs and ranks facets of the stable set polytope