{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:15:22Z","timestamp":1761621322707},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:00:00Z","timestamp":1496793600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10107-017-1168-x","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T18:57:38Z","timestamp":1496861858000},"page":"519-522","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polyhedral results on the stable set problem in graphs containing even or odd pairs"],"prefix":"10.1007","volume":"171","author":[{"given":"Jonas T.","family":"Witt","sequence":"first","affiliation":[]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"key":"1168_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006). doi:\n                        10.4007\/annals.2006.164.51","journal-title":"Ann. Math."},{"issue":"2","key":"1168_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.jctb.2008.08.002","volume":"99","author":"M Chudnovsky","year":"2009","unstructured":"Chudnovsky, M., Seymour, P.: Even pairs in Berge graphs. J. Combin. Theory Ser. B 99(2), 370\u2013377 (2009). doi:\n                        10.1016\/j.jctb.2008.08.002","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1168_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Combin. Theory Ser. B 18(2), 138\u2013154 (1975). doi:\n                        10.1016\/0095-8956(75)90041-6","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1168_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"DR Fulkerson","year":"1971","unstructured":"Fulkerson, D.R.: Blocking and anti-blocking pairs of polyhedra. Math. Program. 1(1), 168\u2013194 (1971). doi:\n                        10.1007\/BF01584085","journal-title":"Math. Program."},{"issue":"10\u201311","key":"1168_CR5","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.disc.2006.03.007","volume":"306","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 306(10\u201311), 867\u2013875 (2006). doi:\n                        10.1016\/j.disc.2006.03.007","journal-title":"Discrete Math."},{"issue":"3","key":"1168_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","volume":"8","author":"H Meyniel","year":"1987","unstructured":"Meyniel, H.: A new property of critical imperfect graphs and some consequences. Eur. J. Combin. 8(3), 313\u2013316 (1987). doi:\n                        10.1016\/S0195-6698(87)80037-9","journal-title":"Eur. J. Combin."},{"issue":"2","key":"1168_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(89)90024-5","volume":"47","author":"H Meyniel","year":"1989","unstructured":"Meyniel, H., Olariu, S.: A new conjecture about minimal imperfect graphs. J. Combin. Theory Ser. B 47(2), 244\u2013247 (1989). doi:\n                        10.1016\/0095-8956(89)90024-5","journal-title":"J. Combin. Theory Ser. B"},{"key":"1168_CR8","unstructured":"Ramirez-Alfonsin, J.L., Reed, B.A. (eds.): Perfect Graphs. Wiley, Chichester, UK (2001)"},{"key":"1168_CR9","unstructured":"Reed, B.: Perfection, parity, planarity, and packing paths. In: Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, pp. 407\u2013419. University of Waterloo Press (1990)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1168-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1168-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1168-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T07:04:10Z","timestamp":1534403050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1168-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,7]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1168"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1168-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,6,7]]}}}