{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:24:59Z","timestamp":1648632299385},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0012-365x(03)00132-8","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"303-310","source":"Crossref","is-referenced-by-count":9,"title":["On a tree graph defined by a set of cycles"],"prefix":"10.1016","volume":"271","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u0131\u0301ctor","family":"Neumann-Lara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Rivera-Campo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00132-8_BIB1","first-page":"225","article-title":"The connectivity of the leaf-exchange spanning tree graph of a graph","volume":"43","author":"Broersma","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(03)00132-8_BIB2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TCT.1966.1082546","article-title":"Hamilton circuits in tree graphs","volume":"CT-13","author":"Cummins","year":"1966","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"7","key":"10.1016\/S0012-365X(03)00132-8_BIB3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TCS.1983.1085385","article-title":"Interpolation theorem for diameters of spanning trees","volume":"30","author":"Harary","year":"1983","journal-title":"IEEE Trans. Circuits Systems"},{"issue":"1","key":"10.1016\/S0012-365X(03)00132-8_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/jgt.3190120110","article-title":"A lower bound on the number of spanning trees with k endvertices","volume":"12","author":"Heinrich","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00132-8_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0122021","article-title":"On the tree graph of a matroid","volume":"22","author":"Holzmann","year":"1972","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/S0012-365X(03)00132-8_BIB6","first-page":"1","article-title":"Connectivity of (adjacency) tree graphs","volume":"3","author":"Zhang","year":"1986","journal-title":"J. Xinjiang Univ. Natur. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:26:05Z","timestamp":1553073965000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0012365X03001328"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00132-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}