{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:17:53Z","timestamp":1780474673342,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19K0359"],"award-info":[{"award-number":["19K0359"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00373-021-02334-5","type":"journal-article","created":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T01:03:14Z","timestamp":1622595794000},"page":"1913-1921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7545-0327","authenticated-orcid":false,"given":"Mikio","family":"Kano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masao","family":"Tsugaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"2334_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/jgt.20204","volume":"54","author":"S Akbari","year":"2006","unstructured":"Akbari, S., Alipour, A.: Multicolored trees in complete graphs. J. Graph Theory 54, 221\u2013232 (2006)","journal-title":"J. Graph Theory"},{"key":"2334_CR2","volume-title":"Factors and factorizations of graphs, LNM 2031","author":"J Akiyama","year":"2011","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs, LNM 2031. Springer, Berlin (2011)"},{"key":"2334_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W","volume":"29","author":"H Broersma","year":"1998","unstructured":"Broersma, H., Tuinstra, H.: Independence trees and Hamilton cycles. J. Graph Theory 29, 227\u2013237 (1998)","journal-title":"J. Graph Theory"},{"key":"2334_CR4","doi-asserted-by":"publisher","first-page":"111629","DOI":"10.1016\/j.disc.2019.111629","volume":"343","author":"Y Cheng","year":"2020","unstructured":"Cheng, Y., Kano, M., Wang, G.: Properly colored spanning trees in edge-colored graphs. Discret. Math. 343, 111629 (2020)","journal-title":"Discret. Math."},{"key":"2334_CR5","doi-asserted-by":"publisher","first-page":"112042","DOI":"10.1016\/j.disc.2020.112042","volume":"343","author":"M Kano","year":"2020","unstructured":"Kano, M., Maezawa, S., Ota, K., Tsugaki, M., Yashima, T.: Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343, 112042 (2020)","journal-title":"Discret. Math."},{"key":"2334_CR6","doi-asserted-by":"publisher","first-page":"2903","DOI":"10.1016\/j.disc.2013.09.002","volume":"313","author":"M Kano","year":"2013","unstructured":"Kano, M., Matsuda, H., Tsugaki, M., Yan, G.: Spanning $$k$$-ended trees of bipartite graphs. Discret. Math. 313, 2903\u20132907 (2013)","journal-title":"Discret. Math."},{"key":"2334_CR7","first-page":"1","volume":"22","author":"M Kano","year":"2015","unstructured":"Kano, M., Ozeki, K., Suzuki, K., Tsugaki, M., Yamashita, T.: Spanning $$k$$-trees of bipartite graphs. Electron. J. Comb. 22, 1\u201313 (2015)","journal-title":"Electron. J. Comb."},{"key":"2334_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees\u2014a survey. Graphs Comb. 27, 1\u201326 (2011)","journal-title":"Graphs Comb."},{"key":"2334_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00373-006-0662-3","volume":"22","author":"K Suzuki","year":"2006","unstructured":"Suzuki, K.: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Graphs Comb. 22, 261\u2013269 (2006)","journal-title":"Graphs Comb."},{"key":"2334_CR10","doi-asserted-by":"crossref","unstructured":"Win, S.: Existenz von Gerusten mit Vorgeschiebenem Maximalgrad in Graphen. Abhandlungen aus dem Mathematichen Seminar der Universital Hamburg 43, 263\u2013267 (1975)","DOI":"10.1007\/BF02995957"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02334-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02334-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02334-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T13:21:53Z","timestamp":1635168113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02334-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["2334"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02334-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"27 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}