Polyhedral results on the stable set problem in graphs containing even or odd pairs
- 7 June 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 171 (1-2) , 519-522
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Even pairs in Berge graphsJournal of Combinatorial Theory, Series B, 2009
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 2006
- A new conjecture about minimal imperfect graphsJournal of Combinatorial Theory, Series B, 1989
- A New Property of Critical Imperfect Graphs and some ConsequencesEuropean Journal of Combinatorics, 1987
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971