On facets of stable set polytopes of claw-free graphs with stability number 3

DOI10.1016/j.disc.2009.03.031zbMath1216.05091OpenAlexW2102780240MaRDI QIDQ960958

Annegret K. Wagler, Arnaud Pêcher

Publication date: 29 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.031

zbMATH Keywords

stable set polytopeclaw-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, Separation routine and extended formulations for the stable set problem in claw-free graphs, Scheduling two chains of unit jobs on one machine: A polyhedral study, Lovász-Schrijver PSD-Operator on Claw-Free Graphs

Cites Work

• Unnamed Item
• On stable set polyhedra for K//(1,3)free graphs
• Geometric algorithms and combinatorial optimization
• Near-perfect matrices
• The rank facets of the stable set polytope for claw-free graphs
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• Maximum matching and a polyhedron with 0,1-vertices