{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T05:40:18Z","timestamp":1781415618473,"version":"3.54.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":12251,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1980]]},"DOI":"10.1016\/0012-365x(90)90287-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"53-76","source":"Crossref","is-referenced-by-count":207,"title":["Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile"],"prefix":"10.1016","volume":"29","author":[{"given":"Najiba","family":"Sbihi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90287-R_BIB1","series-title":"Graphes et hypergraphes","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(90)90287-R_BIB2","series-title":"Rapport de Recherche","article-title":"Polytope des stables d'un graphe s\u00e9rie-parall\u00e9le","author":"Boulala","year":"1978"},{"key":"10.1016\/0012-365X(90)90287-R_BIB3","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."},{"issue":"1, 2","key":"10.1016\/0012-365X(90)90287-R_BIB4","first-page":"125","article-title":"Maximum matching and a polyhedron with (0, 1) vertices","volume":"65 B","author":"Edmonds","year":"1965","journal-title":"J. Res. Bureau Stand."},{"key":"10.1016\/0012-365X(90)90287-R_BIB5","series-title":"Proceedings of the Advanced Seminar in Graph Theory","article-title":"Blocking polyhedra","author":"Fulkerson","year":"1969"},{"key":"10.1016\/0012-365X(90)90287-R_BIB6","unstructured":"Georges J. Minty, On maximal independent sets of vertices in claw-free graphs. Indiana University (\u00e0 para\u00eetre)."},{"key":"10.1016\/0012-365X(90)90287-R_BIB7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect-graph conjecture is true for K1, 3\u03c9free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/0012-365X(90)90287-R_BIB8","series-title":"Th\u00e8se de 3\u00e8me cycle","author":"Sbihi","year":"1978"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090287R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090287R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:23:45Z","timestamp":1555140225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090287R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X9090287R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90287-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}