{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:48Z","timestamp":1759637808149},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12282,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1016\/0012-365x(79)90160-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"225-243","source":"Crossref","is-referenced-by-count":49,"title":["Polytope des independants d'un graphe serie-parallele"],"prefix":"10.1016","volume":"27","author":[{"given":"Mouloud","family":"Boulala","sequence":"first","affiliation":[]},{"given":"Jean-Pierre","family":"Uhry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90160-2_BIB1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(79)90160-2_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90160-2_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Analysis Appl."},{"key":"10.1016\/0012-365X(79)90160-2_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"Properties of vertex packing and independence system polyedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90160-2_BIB5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packing: Structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90160-2_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing Polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90160-2_BIB7","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0167-5060(08)70750-7","article-title":"On the complexity of set packing polyhedra","volume":"1","author":"Padberg","year":"1977","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/0012-365X(79)90160-2_BIB8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0167-5060(08)70751-9","article-title":"Properties of facets of binary polytopes","volume":"1","author":"Peled","year":"1977","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/0012-365X(79)90160-2_BIB9","unstructured":"N. Sbihi, Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile, R.R. No. 103, I.M.A.G."},{"key":"10.1016\/0012-365X(79)90160-2_BIB10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","article-title":"A class of facet producing graphs for vertex packing Polyedra","volume":"12","author":"Trotter","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90160-2_BIB11","unstructured":"A. Tucker, The strong perfect graph conjecture for planar graphs."},{"key":"10.1016\/0012-365X(79)90160-2_BIB12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF01580383","article-title":"Further facet generating procedures for vertex packing polytopes","volume":"11","author":"Wolsey","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90160-2_BIB13","series-title":"Phd. Thesis","author":"Clamcy","year":"1977"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:23:24Z","timestamp":1555140204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79901602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["0012365X79901602"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90160-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}