{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:02:15Z","timestamp":1747465335913},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10107-007-0176-7","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:16:47Z","timestamp":1188922607000},"page":"291-317","source":"Crossref","is-referenced-by-count":7,"title":["Clique-circulants and the stable set polytope of fuzzy circular interval graphs"],"prefix":"10.1007","volume":"115","author":[{"given":"Gianpaolo","family":"Oriolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,5]]},"reference":[{"key":"176_CR1","first-page":"5","volume":"152","author":"E. Cheng","year":"2001","unstructured":"Cheng E., de Vries S. (2001). Antiweb inequalities: strength and intractability. Congressus Numerantium 152: 5\u201319","journal-title":"Congressus Numerantium"},{"issue":"1","key":"176_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s101070100267","volume":"92","author":"E. Cheng","year":"2002","unstructured":"Cheng E., Vries S. (2002). Antiweb inequalities: strength and intractability. Math. Program. 92(1): 153\u2013175","journal-title":"Math. Program."},{"key":"176_CR3","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Proceedings of the Bristish Combinatorial Conference, Durham (2005 to appear)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"176_CR4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chvatal","year":"1975","unstructured":"Chvatal V. (1975). On certain polytopes associated with graphs. J. Comb. Theory 18: 138\u2013154","journal-title":"J. Comb. Theory"},{"key":"176_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J. (1965). Maximum matching and a polyhedron with (0,1) vertices. J. Res. Nat. Bur. Standards 69: 125\u2013130","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"176_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J. (1965). Paths, trees and flowers. Can. J. Math. 17: 449\u2013467","journal-title":"Can. J. Math."},{"key":"176_CR7","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Oriolo, G., Stauffer, G., Ventura, P.: Circular one matrices and the stable set polytope of quasi-line graphs. In: Proceedings of IPCO, pp. 291\u2013305 (2005)","DOI":"10.1007\/11496915_22"},{"key":"176_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.1715","volume":"69","author":"A. Galluccio","year":"1997","unstructured":"Galluccio A., Sassano A. (1997). The rank facets of the stable set polytope for claw-free graphs. J. Comb. Theory 69: 1\u201338","journal-title":"J. Comb. Theory"},{"key":"176_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R. Giles","year":"1981","unstructured":"Giles R., Trotter L.E. (1981). On stable set polyhedra for k (1,3)-free graphs. J. Comb. Theory 31: 313\u2013326","journal-title":"J. Comb. Theory"},{"key":"176_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A. (1988). Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg"},{"key":"176_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s001860300317","volume":"59","author":"T.M. Liebling","year":"2004","unstructured":"Liebling T.M., Oriolo G., Spille G., Stauffer G. (2004). On the non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Methods Oper. Res. 59: 25\u201335","journal-title":"Math. Methods Oper. Res."},{"key":"176_CR12","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Plummer M. (1986). Matching Theory. North Holland, Amsterdam"},{"issue":"3","key":"176_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(83)90120-6","volume":"46","author":"J. Maurras","year":"1983","unstructured":"Maurras J. (1983). Convex hull of the edges of a graph and near bipartite graphs. Discrete Math. 46(3): 257\u2013265","journal-title":"Discrete Math."},{"key":"176_CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty G.J. (1980). On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory 28: 284\u2013304","journal-title":"J. Comb. Theory"},{"issue":"2","key":"176_CR15","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura D., Tamura A. (2001). A revision of minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. J. Oper. Res. Soc. Jpn. 44(2): 194\u20132004","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"176_CR16","first-page":"185","volume":"132","author":"G. Oriolo","year":"2004","unstructured":"Oriolo G. (2004). Clique family inequalities for the stable set polytope for quasi-line graphs. Discrete Appl. Math. 132(3): 185\u2013201","journal-title":"Discrete Appl. Math."},{"key":"176_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. Padberg","year":"1973","unstructured":"Padberg M. (1973). On the facial structure of set packing polyhedra. Math. Program. 5: 199\u2013215","journal-title":"Math. Program."},{"key":"176_CR18","unstructured":"Pulleyblank, W., Shepherd, F.: Formulations for the stable set polytope of a claw-free graph. In: Rinaldi, L.W.G. (ed.) Proceedings Third IPCO conference, pp. 267\u2013279 (1993)"},{"key":"176_CR19","unstructured":"Rebea, A.B.: \u00c9tude des stables dans les graphes quasi-adjoints. PhD thesis, Universit\u00e9 de Grenoble (1981)"},{"key":"176_CR20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi N. (1980). Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math. 29: 53\u201376","journal-title":"Discrete Math."},{"key":"176_CR21","volume-title":"Combinatorial Optimization. Polyhedra and efficiency (3 volumes)","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A. (2003). Combinatorial Optimization. Polyhedra and efficiency (3 volumes). Springer, Heidelberg"},{"key":"176_CR22","first-page":"353","volume":"71","author":"F. Shepherd","year":"1995","unstructured":"Shepherd F. (1995). Applying lehman\u2019s theorems to packing problems. Math. Program. 71: 353\u2013367","journal-title":"Math. Program."},{"key":"176_CR23","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L. Trotter","year":"1975","unstructured":"Trotter L. (1975). A class of facet producing graphs for vertex packing polyhedra. Discrete Math. 12: 373\u2013388","journal-title":"Discrete Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0176-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0176-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0176-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:04Z","timestamp":1559109004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0176-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,5]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0176-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,5]]}}}