{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:39Z","timestamp":1759063539356},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00306-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"219-222","source":"Crossref","is-referenced-by-count":9,"title":["Spanning trees with pairwise nonadjacent endvertices"],"prefix":"10.1016","volume":"170","author":[{"given":"T.","family":"B\u00f6hme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.J.","family":"Broersma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"G\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.V.","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","series-title":"Graphs and Digraphs","author":"Behzad","key":"10.1016\/S0012-365X(96)00306-8_BIB1"},{"key":"10.1016\/S0012-365X(96)00306-8_BIB2","first-page":"194","article-title":"On coloring the nodes of a network","volume":"37","author":"Brooks","year":"1941"},{"key":"10.1016\/S0012-365X(96)00306-8_BIB3","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0116056","article-title":"Randomly traceable graphs","volume":"16","author":"Chartrand","year":"1968","journal-title":"SIAM J. Appl. Math."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0012-365X(96)00306-8_BIB4"},{"key":"10.1016\/S0012-365X(96)00306-8_BIB5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0012-365X(94)90282-8","article-title":"The forest plus stars colouring problem","volume":"126","author":"Stiebitz","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00306-8_BIB6","first-page":"271","article-title":"Graphs in which every path is contained in a Hamilton path","volume":"268\/269","author":"Thomassen","year":"1974","journal-title":"J. Reine Angew. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003068?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003068?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:58Z","timestamp":1553196418000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96003068"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00306-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}