乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T12:03:18Z","timestamp":1726488198405},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1016\/j.jctb.2014.02.006","type":"journal-article","created":{"date-parts":[[2014,3,15]],"date-time":"2014-03-15T14:45:40Z","timestamp":1394894740000},"page":"92-122","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs areW<\/mml:mi><\/mml:math>-perfect"],"prefix":"10.1016","volume":"107","author":[{"given":"A.","family":"Galluccio","sequence":"first","affiliation":[]},{"given":"C.","family":"Gentile","sequence":"additional","affiliation":[]},{"given":"P.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2014.02.006_br0010","series-title":"Surveys in Combinatorics","article-title":"The structure of claw-free graphs","volume":"vol. 327","author":"Chudnovsky","year":"2005"},{"issue":"5","key":"10.1016\/j.jctb.2014.02.006_br0020","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.jctb.2007.06.007","article-title":"Claw-free graphs IV: Decomposition theorem","volume":"98","author":"Chudnovsky","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0030","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1016\/j.jctb.2008.03.002","article-title":"Claw-free graphs V: Global structure","volume":"98","author":"Chudnovsky","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0040","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. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0050","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01788536","article-title":"Bull-free Berge graphs are perfect","volume":"3","author":"Chv\u00e1tal","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/j.jctb.2014.02.006_br0060","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1 vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Natl. Bur. Stand., B"},{"issue":"1","key":"10.1016\/j.jctb.2014.02.006_br0070","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00493-008-2244-x","article-title":"The stable set polytope of quasi-line graphs","volume":"28","author":"Eisenbrand","year":"2008","journal-title":"Combinatorica"},{"key":"10.1016\/j.jctb.2014.02.006_br0080","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Program."},{"key":"10.1016\/j.jctb.2014.02.006_br0090","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.orl.2008.01.003","article-title":"Gear composition and the stable set polytope","volume":"36","author":"Galluccio","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.jctb.2014.02.006_br0100","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/moor.1090.0407","article-title":"Gear composition of stable set polytopes and G-perfection","volume":"34","author":"Galluccio","year":"2009","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.jctb.2014.02.006_br0110","doi-asserted-by":"crossref","first-page":"1988","DOI":"10.1016\/j.dam.2013.02.022","article-title":"2-clique-bond of stable set polyhedra","volume":"161","author":"Galluccio","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jctb.2014.02.006_br0120","article-title":"The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect","author":"Galluccio","year":"2014","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.1715","article-title":"The rank facets of the stable set polytope for claw-free graphs","volume":"69","author":"Galluccio","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0140","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","article-title":"On stable set polyhedra for K1,3-free graphs","volume":"31","author":"Giles","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.jctb.2014.02.006_br0150","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"year":"1988","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","key":"10.1016\/j.jctb.2014.02.006_br0160"},{"year":"2009","series-title":"Claw-free graphs and two conjectures on omega, Delta, and chi","author":"King","key":"10.1016\/j.jctb.2014.02.006_br0170"},{"key":"10.1016\/j.jctb.2014.02.006_br0180","doi-asserted-by":"crossref","DOI":"10.1007\/s001860300317","article-title":"On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs","author":"Liebling","year":"2004","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/j.jctb.2014.02.006_br0190","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580723","article-title":"On the stable set polytope of a series-parallel graph","volume":"40","author":"Mahjoub","year":"1988","journal-title":"Math. Program."},{"key":"10.1016\/j.jctb.2014.02.006_br0200","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.006_br0210","first-page":"194","article-title":"A revision of Minty's algorithm for finding a maximum weighted stable set of a claw-free graph","volume":"44","author":"Nakamura","year":"2001","journal-title":"J. Soc. Japan"},{"key":"10.1016\/j.jctb.2014.02.006_br0220","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"Properties of vertex packing and independence system polyhedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Program."},{"year":"1988","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/j.jctb.2014.02.006_br0230"},{"key":"10.1016\/j.jctb.2014.02.006_br0240","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(03)00400-1","article-title":"Clique family inequalities for the stable set polytope for quasi-line graphs","volume":"132","author":"Oriolo","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jctb.2014.02.006_br0250","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of vertex packing polytope","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Program."},{"key":"10.1016\/j.jctb.2014.02.006_br0260","series-title":"Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications","first-page":"185","article-title":"On facets of stable set polytope of claw-free graphs with maximum stable set size three","volume":"vol. 28","author":"P\u00eacher","year":"2006"},{"year":"2003","series-title":"Combinatorial Optimization","author":"Schrijver","key":"10.1016\/j.jctb.2014.02.006_br0270"},{"key":"10.1016\/j.jctb.2014.02.006_br0280","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01582578","article-title":"Near-perfect matrices","volume":"64","author":"Shepherd","year":"1994","journal-title":"Math. Program."},{"year":"2005","series-title":"On the stable set polytope of claw-free graphs","author":"Stauffer","key":"10.1016\/j.jctb.2014.02.006_br0290"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895614000306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895614000306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T02:54:08Z","timestamp":1538794448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895614000306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":29,"alternative-id":["S0095895614000306"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2014.02.006","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are -perfect","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2014.02.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}