{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:29Z","timestamp":1774370129811,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":3577,"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":[[2003,10]]},"DOI":"10.1016\/s0166-218x(03)00399-8","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T20:01:24Z","timestamp":1062619284000},"page":"175-183","source":"Crossref","is-referenced-by-count":14,"title":["Some results on maximum stable sets in certain P5-free graphs"],"prefix":"10.1016","volume":"132","author":[{"given":"Raffaele","family":"Mosca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00399-8_BIB1","unstructured":"V.E. Alekseev, On the local restiction effect on the complexity of finding the graph independence number, Combinatorial Algebraic Methods in Applied Mathematics, Gorkiy University, 1983, pp. 3\u201313."},{"issue":"4","key":"10.1016\/S0166-218X(03)00399-8_BIB2","first-page":"3","article-title":"A polynomial algorithm for finding maximum independent sets in fork-free graphs","volume":"6","author":"Alekseev","year":"1999","journal-title":"Discrete Anal. Oper. Res. Ser. 1"},{"key":"10.1016\/S0166-218X(03)00399-8_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(01)00268-0","article-title":"On (P5, diamond)-free graphs","volume":"250","author":"Arbib","year":"2002","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/S0166-218X(03)00399-8_BIB4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF02352694","article-title":"Dominating cliques in P5-free graphs","volume":"21","author":"Bacs\u00f2","year":"1990","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/jgt.3190140409","article-title":"A characterization of graphs without long induced paths","volume":"14","author":"Bacs\u00f2","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00399-8_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0166-218X(99)00012-8","article-title":"On minimal imperfect graphs without induced P5","volume":"94","author":"Barr\u00e9","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB7","unstructured":"A. Brandst\u00e4dt, (P5, diamond)-free graphs revisited: structure and linear optimization, manuscript 2000."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0166-218X(99)00072-4","article-title":"On the stability number of claw-free P5-free and more general graphs","volume":"95","author":"Brandst\u00e4dt","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB9","unstructured":"A. Brandst\u00e4dt, D. Kratsch, On the structure of (P5, gem)-free graphs, to appear."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0166-218X(00)00239-0","article-title":"A note on the \u03b1-redundant vertices in graphs","volume":"108","author":"Brandst\u00e4dt","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB11","unstructured":"A. Brandst\u00e4dt, R. Mosca, On the structure and stability number of P5- and co-chair-free graphs, this issue."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(89)90268-9","article-title":"On the diameters and radii of bridged graphs","volume":"73","author":"Farber","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","article-title":"On graphs without P5 and P\u03045","volume":"146","author":"Fouquet","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5-P\u03045)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB15","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00460-9","article-title":"Stability in P5- and banner-free graphs","volume":"125","author":"Lozin","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB16","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 B"},{"key":"10.1016\/S0166-218X(03)00399-8_BIB17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0020-0190(96)00197-4","article-title":"Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs","volume":"61","author":"Mosca","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<239::AID-JGT3>3.0.CO;2-M","article-title":"Irredundance perfect and P6-free graphs","volume":"29","author":"Puech","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00399-8_BIB19","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":"Shibi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00399-8_BIB21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003998?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003998?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:26:31Z","timestamp":1551075991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0166218X03003998"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00399-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}