On stable set polyhedra for K1,3-free graphs
- 1 December 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 31 (3) , 313-326
- https://doi.org/10.1016/0095-8956(81)90033-2
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- The Strong Perfect Graph Theorem for a Class of Partitionable GraphsNorth-Holland Mathematics Studies, 1984
- Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphsDiscrete Mathematics, 1981
- Graphical properties related to minimal imperfectionDiscrete Mathematics, 1979
- On the strong perfect graph conjectureJournal of Combinatorial Theory, Series B, 1976
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965