{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:10:37Z","timestamp":1697955037669},"reference-count":4,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6792,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1988,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>If a graph <jats:italic>G<\/jats:italic> with cycle rank \u03c1 contains both spanning trees with <jats:italic>m<\/jats:italic> and with <jats:italic>n<\/jats:italic> end\u2010vertices, <jats:italic>m<\/jats:italic> &lt; <jats:italic>n<\/jats:italic>, then <jats:italic>G<\/jats:italic> has at least 2\u03c1 spanning trees with <jats:italic>k<\/jats:italic> end\u2010vertices for each integer <jats:italic>k, m<\/jats:italic> &lt; <jats:italic>k<\/jats:italic> &lt; <jats:italic>n.<\/jats:italic> Moreover, the lower bound of 2<jats:italic>\u03c1<\/jats:italic> is best possible.<\/jats:p>","DOI":"10.1002\/jgt.3190120110","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:21:07Z","timestamp":1181362867000},"page":"95-100","source":"Crossref","is-referenced-by-count":7,"title":["A lower bound on the number of spanning trees with <i>k<\/i> end\u2010vertices"],"prefix":"10.1002","volume":"12","author":[{"given":"Katherine","family":"Heinrich","sequence":"first","affiliation":[]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"7","article-title":"A solution of Chartrand's problem on spanning trees","volume":"1","author":"Cai M. C.","year":"1984","journal-title":"Acta Math. Appl. Sin."},{"key":"e_1_2_1_3_2","volume-title":"Proceedings of the Fourth International Conference on Graph Theory Applications","author":"Chartrand G.","year":"1981"},{"issue":"1","key":"e_1_2_1_4_2","first-page":"134","article-title":"A simpler proof of interpolation theorem for spanning trees","volume":"30","author":"Lin Y. X.","year":"1985","journal-title":"Kexue Tongbao (English Ed.)"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070209"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190120110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190120110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T03:56:54Z","timestamp":1697860614000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190120110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["10.1002\/jgt.3190120110"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190120110","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}