{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:23Z","timestamp":1720640843361},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80114-3","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"19-22","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Composition of graphs and the triangle free subgraph polytope"],"prefix":"10.1016","volume":"5","author":[{"given":"F.","family":"Bendali","sequence":"first","affiliation":[]},{"given":"A.R.","family":"Mahjoub","sequence":"additional","affiliation":[]},{"given":"J.","family":"Mailfert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80114-3_BIB1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1287\/moor.12.3.522","article-title":"On the maximum weight clique problem","volume":"12","author":"Balas","year":"1987","journal-title":"Math. Oper. Res."},{"issue":"N\u00b03","key":"10.1016\/S1571-0653(05)80114-3_BIB2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1137\/S0895480190182691","article-title":"Composition of graphs and Polyhedra IV: acyclic spanning subgraphs","volume":"7","author":"Barahona","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S1571-0653(05)80114-3_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(86)90156-1","article-title":"Ki-cover I: Complexity and polytopes","volume":"58","author":"Conforti","year":"1986","journal-title":"Discrete Mathematics"},{"issue":"N\u00b02","key":"10.1016\/S1571-0653(05)80114-3_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0095-8956(91)90076-V","article-title":"On a composition of independence systems by circuit identification","volume":"53","author":"Euler","year":"1991","journal-title":"Journal of Comb. Theory series B"},{"key":"10.1016\/S1571-0653(05)80114-3_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(92)90133-Z","article-title":"Compositions in the bipartite subgraph polytope","volume":"105","author":"Fonlupt","year":"1992","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0653(05)80114-3_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:57:58Z","timestamp":1548532678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":6,"alternative-id":["S1571065305801143"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80114-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}