{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T23:53:21Z","timestamp":1772236401779,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00373-008-0775-y","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T13:59:19Z","timestamp":1210773559000},"page":"107-111","source":"Crossref","is-referenced-by-count":8,"title":["Path-Factors in the Square of a Tree"],"prefix":"10.1007","volume":"24","author":[{"given":"Xiaojuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"775_CR1","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs - a survey. J. Graph Theory 9, 1\u201342 (1985)","DOI":"10.1002\/jgt.3190090103"},{"key":"775_CR2","doi-asserted-by":"crossref","unstructured":"Ando, K., Egawa, Y., Kaneko, A., Kawarabayashi, K., Matsuda, H.: Path factors in claw-free graphs. Discrete Math. 243, 195\u2013200 (2002)","DOI":"10.1016\/S0012-365X(01)00214-X"},{"key":"775_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications (Macmillan, London 1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"775_CR4","doi-asserted-by":"crossref","unstructured":"Hell, P., Kirkpatrick, D.G.: On the completeness of a generalized matching problem. Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, 240\u2013245 (1978)","DOI":"10.1145\/800133.804353"},{"key":"775_CR5","unstructured":"Hell, P., Kirkpatrick, D.G.: On the complexity of general graph factor problems. SIAM J. Comp. 12, 601\u2013609 (1983)"},{"key":"775_CR6","unstructured":"Ishizuka, S.: Closure, path-factors and path coverings in claw-free graphs. Ars Combin. 50, 115\u2013128 (1998)"},{"key":"775_CR7","doi-asserted-by":"crossref","unstructured":"Johansson, R.: An El-Zah\u00e1r type condition ensuring path-factors. J. Graph Theory 28, 39\u201342 (1998)","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<39::AID-JGT4>3.0.CO;2-G"},{"key":"775_CR8","unstructured":"Kaneko, A.: A necessary and sufficent condition for the existence of a path factor every component of which is a path of length at least two. J. Combin. Theory Ser. B 88, 195\u2013218 (2003)"},{"key":"775_CR9","doi-asserted-by":"crossref","unstructured":"Kano, M., Katona, G.Y., Kir\u00e1ly, Z.: Packing paths of length at least two. Discrete Math. 283, 129\u2013135 (2004)","DOI":"10.1016\/j.disc.2004.01.016"},{"key":"775_CR10","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Matsuda, H., Oda, Y., Ota, K.: Path factors in cubic graphs. J. Graph Theory 39, 188\u2013193 (2002)","DOI":"10.1002\/jgt.10022"},{"key":"775_CR11","doi-asserted-by":"crossref","unstructured":"Wang, H.: Path factors of bipartite graphs. J. Graph Theory 18(2), 161\u2013167 (1994)","DOI":"10.1002\/jgt.3190180207"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0775-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0775-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0775-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:28Z","timestamp":1559041108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0775-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["775"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0775-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}