{"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":1774370129833,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0166-218x(99)00046-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"177-191","source":"Crossref","is-referenced-by-count":30,"title":["Stable sets in certain P6-free graphs"],"prefix":"10.1016","volume":"92","author":[{"given":"Raffaele","family":"Mosca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00046-3_BIB1","unstructured":"C. Arbib, R. Mosca, Stable sets in P5- and diamond free graphs, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tecnical Report n. 79, February 1995."},{"issue":"4","key":"10.1016\/S0166-218X(99)00046-3_BIB2","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."},{"issue":"4","key":"10.1016\/S0166-218X(99)00046-3_BIB3","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(99)00046-3_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","article-title":"Stability number of bull and chair-free graphs","volume":"41","author":"De Simone","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB5","unstructured":"J.F. Desler, S.L. Hakimi, On finding a maximum stable set of a graph, Proceedings of the Fourth Annual Princeton Conference on Information Science and Systems, Princeton, NJ, 1970."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB6","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(99)00046-3_BIB7","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02253207","article-title":"The complexity of comparability graph recognition and coloring","volume":"18","author":"Golumbic","year":"1977","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(99)00046-3_BIB10","first-page":"301","article-title":"Algorithmic aspects of perfect graphs","volume":"21","author":"Golumbic","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB11","doi-asserted-by":"crossref","unstructured":"M. Groetschel, L. Lov\u00e0sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"10.1016\/S0166-218X(99)00046-3_BIB12","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0166-218X(99)00046-3_BIB13","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(99)00046-3_BIB14","doi-asserted-by":"crossref","unstructured":"R. Mosca, Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs, Inform. Process. Lett. 61 (1997).","DOI":"10.1016\/S0020-0190(96)00197-4"},{"key":"10.1016\/S0166-218X(99)00046-3_BIB15","unstructured":"R. Mosca, Maximal stable sets in certain P5-free graphs, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tecnical Report, April 1998."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","article-title":"Paw-free Graphs","volume":"28","author":"Olariu","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00046-3_BIB17","first-page":"307","article-title":"A note on stable set and colorings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolina"},{"key":"10.1016\/S0166-218X(99)00046-3_BIB18","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:53:21Z","timestamp":1556132001000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0166218X99000463"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00046-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}