{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:20:22Z","timestamp":1772792422437,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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":10669,"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":[[1984,5]]},"DOI":"10.1016\/0012-365x(84)90163-8","type":"journal-article","created":{"date-parts":[[2004,7,27]],"date-time":"2004-07-27T21:39:26Z","timestamp":1090964366000},"page":"267-273","source":"Crossref","is-referenced-by-count":16,"title":["Arbres avec un nombre maximum de sommets pendants"],"prefix":"10.1016","volume":"49","author":[{"given":"C","family":"Payan","sequence":"first","affiliation":[]},{"given":"M","family":"Tchuente","sequence":"additional","affiliation":[]},{"given":"N.H","family":"Xuong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(84)90163-8_BIB1","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(84)90163-8_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self-stabilizing systems in spite of distributed control","volume":"11","author":"Dijkstra","year":"1974","journal-title":"Comm. ACM 17"},{"key":"10.1016\/0012-365X(84)90163-8_BIB3","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0012-365X(84)90163-8_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1981150100471","article-title":"Sur l'auto-stabilisation dans un r\u00e9seau d'ordinateurs","volume":"15","author":"Tchuente","year":"1981","journal-title":"R.A.I.R.O. Informatique Th\u00e9orique"},{"key":"10.1016\/0012-365X(84)90163-8_BIB5","series-title":"On the complexity of a degree-constrained spanning tree problem","author":"Tchuente","year":"1980"},{"issue":"2.3.4","key":"10.1016\/0012-365X(84)90163-8_BIB6","first-page":"319","article-title":"Ensembles cycliquement stables et graphes cubiques","volume":"17","author":"Payan","year":"1975","journal-title":"Cahiers du C.E.R.O."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84901638?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84901638?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T11:53:33Z","timestamp":1549367613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X84901638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["0012365X84901638"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(84)90163-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}