{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:58:30Z","timestamp":1648659510243},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T00:00:00Z","timestamp":1526947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1906-8","type":"journal-article","created":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T10:46:23Z","timestamp":1526985983000},"page":"693-701","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on a spanning \n                \n                  \n                \n                $$(\\alpha ,\\beta )$$\n                \n                  \n                    \n                      (\n                      \u03b1\n                      ,\n                      \u03b2\n                      )\n                    \n                  \n                \n              -ended tree in a bipartite graph"],"prefix":"10.1007","volume":"34","author":[{"given":"Masao","family":"Tsugaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,22]]},"reference":[{"key":"1906_CR1","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":"1906_CR2","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 \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -ended trees of bipartite graphs. Discrete Math. 313, 2903\u20132907 (2013)","journal-title":"Discrete Math."},{"key":"1906_CR3","first-page":"1297","volume":"272","author":"M Las Vergnas","year":"1971","unstructured":"Las Vergnas, M.: Sur une propri\u00e9t\u00e9 des arbres maximaux dans un graphe. CR Acad. Sci. Paris S\u00e9r A. 272, 1297\u20131300 (1971)","journal-title":"CR Acad. Sci. Paris S\u00e9r A."},{"key":"1906_CR4","first-page":"21","volume":"42","author":"O Ore","year":"1963","unstructured":"Ore, O.: Hamilton connected graph. J. Math. Pures. Appl. 42, 21\u201327 (1963)","journal-title":"J. Math. Pures. Appl."},{"key":"1906_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disc.2016.07.015","volume":"340","author":"R Matsubara","year":"2017","unstructured":"Matsubara, R., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discrete Math. 340, 87\u201395 (2017)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1906-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1906-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1906-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T12:46:21Z","timestamp":1558529181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1906-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,22]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1906"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1906-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,22]]},"assertion":[{"value":"23 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}