{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:10Z","timestamp":1767340030878},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0020-0190(03)00223-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"311-316","source":"Crossref","is-referenced-by-count":10,"title":["Finding augmenting chains in extensions of claw-free graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"A.","family":"Hertz","sequence":"first","affiliation":[]},{"given":"V.","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"D.","family":"Schindl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(03)00223-0_BIB001","first-page":"3","article-title":"Polynomial algorithm for finding the largest independent sets in graphs without forks","volume":"6","author":"Alekseev","year":"1999","journal-title":"Discrete Anal. Oper. Res."},{"key":"10.1016\/S0020-0190(03)00223-0_BIB002","author":"Alekseev"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB003","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB004","author":"Boliac"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB005","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(03)00223-0_BIB006","author":"Gerber"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB007","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0166-218X(01)00321-3","article-title":"On the stable set problem in special P5-free graphs","volume":"125","author":"Gerber","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00223-0_BIB008","doi-asserted-by":"crossref","unstructured":"M. Gerber, A. Hertz, D. Schindl, P5-free augmenting graphs and the maximum stable set problem, Discrete Appl. Math., to appear","DOI":"10.1016\/S0166-218X(03)00394-9"},{"issue":"2","key":"10.1016\/S0020-0190(03)00223-0_BIB009","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. Research"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB010","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\/S0020-0190(03)00223-0_BIB011","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\/S0020-0190(03)00223-0_BIB012","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(99)00046-3","article-title":"Stable sets in certain P6-free graphs","volume":"92","author":"Mosca","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00223-0_BIB013","doi-asserted-by":"crossref","unstructured":"R. Mosca, Some results on maximum stable sets in certain P5-free graphs, Discrete Appl. Math., to appear","DOI":"10.1016\/S0166-218X(03)00399-8"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB014","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","article-title":"Computing independent sets in graphs with large girth","volume":"35","author":"Murphy","year":"1992","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0020-0190(03)00223-0_BIB015","first-page":"194","article-title":"A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph","volume":"44","author":"Nakamura","year":"2001","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/S0020-0190(03)00223-0_BIB016","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un independent de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T03:57:02Z","timestamp":1553227022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0020019003002230"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00223-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}