{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:59Z","timestamp":1759063559224},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0166-218x(93)90032-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"121-129","source":"Crossref","is-referenced-by-count":29,"title":["Stability number of bull- and chair-free graphs"],"prefix":"10.1016","volume":"41","author":[{"given":"Caterina","family":"De Simone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90032-J_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(93)90032-J_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(93)90032-J_BIB3","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\/0166-218X(93)90032-J_BIB4","doi-asserted-by":"crossref","unstructured":"C. De Simone, On the vertex packing problem, Graphs Combin., to appear.","DOI":"10.1007\/BF01195324"},{"key":"10.1016\/0166-218X(93)90032-J_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(93)90032-J_BIB6","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984"},{"key":"10.1016\/0166-218X(93)90032-J_BIB7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579377","article-title":"The struction of a graph: application to CN-free graphs","volume":"5","author":"Hammer","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(93)90032-J_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0012-365X(86)90071-3","article-title":"Quelques utilisations de la struction","volume":"59","author":"Hertz","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90032-J_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01589347","article-title":"A polynomial algorithm for maximum weighted vertex packing on graphs without long odd cycles","volume":"20","author":"Hsu","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90032-J_BIB10","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0166-218X(93)90032-J_BIB11","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\/0166-218X(93)90032-J_BIB12","article-title":"Reducible cliques and the strong perfect graph conjecture","volume":"257","author":"Sassano","year":"1989","journal-title":"IASI Tech. Rept. R."},{"key":"10.1016\/0166-218X(93)90032-J_BIB13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390032J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390032J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:44Z","timestamp":1555136684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390032J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["0166218X9390032J"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90032-j","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}