{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:09:25Z","timestamp":1772791765728,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"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":[[1992,6]]},"DOI":"10.1016\/0012-365x(92)90331-9","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:41:28Z","timestamp":1034293288000},"page":"167-183","source":"Crossref","is-referenced-by-count":59,"title":["Spanning trees in graphs of minimum degree 4 or 5"],"prefix":"10.1016","volume":"104","author":[{"given":"Jerrold R.","family":"Griggs","sequence":"first","affiliation":[]},{"given":"Mingshen","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90331-9_BIB1","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/jgt.3190130604","article-title":"Spanning trees with many leaves in cubic graphs","volume":"13","author":"Griggs","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(92)90331-9_BIB2","doi-asserted-by":"crossref","unstructured":"D.J. Kleitman and D.B. West, Spanning trees with many leaves, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/0404010"},{"key":"10.1016\/0012-365X(92)90331-9_BIB3","article-title":"Spanning trees with many leaves","author":"Kleitman","year":"1988","journal-title":"SIAM Discrete Math. Conf. San Francisco"},{"key":"10.1016\/0012-365X(92)90331-9_BIB4","article-title":"The maximum leaf spanning tree problem for cubic graphs is NP-complete","author":"Lemke","year":"1988","journal-title":"Institute for Mathematics and its Application"},{"key":"10.1016\/0012-365X(92)90331-9_BIB5","unstructured":"N. Linial, personal communication, 1988."},{"key":"10.1016\/0012-365X(92)90331-9_BIB6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0020-0190(81)90141-1","article-title":"Constructing full spanning trees for cubic graphs","volume":"13","author":"Storer","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92903319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92903319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T11:55:05Z","timestamp":1554983705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92903319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0012365X92903319"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90331-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}