{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T05:25:49Z","timestamp":1697693149362},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,12,22]],"date-time":"2006-12-22T00:00:00Z","timestamp":1166745600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2007,5]]},"abstract":"Abstract<\/jats:title>For a graph G<\/jats:italic>, we denote by i<\/jats:italic>(G<\/jats:italic>) the number of isolated vertices of G<\/jats:italic>. We prove that for a connected graph G<\/jats:italic> of order at least five, if i<\/jats:italic>(G<\/jats:italic>\u2013S<\/jats:italic>)\u2009<\u2009|S<\/jats:italic>| for all \u2205\ufe01 \u2260 S<\/jats:italic> \u2286 V<\/jats:italic>(G<\/jats:italic>), then G<\/jats:italic> has a spanning tree T<\/jats:italic> such that the distance in T<\/jats:italic> between any two leaves of T<\/jats:italic> is at least four. This result was conjectured by Kaneko in \u201cSpanning trees with constrains on the leaf degree<\/jats:italic>\u201d, Discrete Applied Math, 115 (2001), 73\u201376. Moreover, the condition in the result is sharp in a sense that the condition i<\/jats:italic>(G<\/jats:italic>\u2013S<\/jats:italic>)\u2009<\u2009|S<\/jats:italic>| cannot be replaced by i<\/jats:italic>(G<\/jats:italic>\u2013S<\/jats:italic>)\u2009\u2264\u2009|S<\/jats:italic>|. \u00a9 2006 Wiley Periodicals, Inc. J Graph Theory 55: 83\u201390, 2007<\/jats:p>","DOI":"10.1002\/jgt.20221","type":"journal-article","created":{"date-parts":[[2006,12,22]],"date-time":"2006-12-22T18:51:27Z","timestamp":1166813487000},"page":"83-90","source":"Crossref","is-referenced-by-count":2,"title":["Spanning trees with leaf distance at least four"],"prefix":"10.1002","volume":"55","author":[{"given":"Atsushi","family":"Kaneko","sequence":"first","affiliation":[]},{"given":"M.","family":"Kano","sequence":"additional","affiliation":[]},{"given":"Kazuhiro","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,12,22]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00216-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00018-1"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10019"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-004-0587-7"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788671"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.20221","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.20221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T18:56:29Z","timestamp":1697655389000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.20221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,22]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["10.1002\/jgt.20221"],"URL":"https:\/\/doi.org\/10.1002\/jgt.20221","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,22]]}}}