{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T12:46:47Z","timestamp":1778762807030,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(03)00027-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T02:16:19Z","timestamp":1051236979000},"page":"195-218","source":"Crossref","is-referenced-by-count":94,"title":["A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two"],"prefix":"10.1016","volume":"88","author":[{"given":"Atsushi","family":"Kaneko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00027-3_BIB1","unstructured":"C. Bazgan, A. H. Benhamdine, H. Li, M. Wo\u017aniak, Partitioning vertices of 1-tough graph into paths, preprint."},{"key":"10.1016\/S0095-8956(03)00027-3_BIB2","unstructured":"G. Chartrand, L. Lesniak, \u201cGraphs and Digraphs,\u201d 2nd Edition, Mathematics Series, Wadsworth & Brooks\/Cole, Monterery, 1986."},{"key":"10.1016\/S0095-8956(03)00027-3_BIB3","first-page":"279","article-title":"A note on factor-critical graphs","volume":"7","author":"Lov\u00e1sz","year":"1972","journal-title":"Studia Sci. Math. Hungar"},{"key":"10.1016\/S0095-8956(03)00027-3_BIB4","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0095-8956(03)00027-3_BIB5","volume":"Vol. 29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0095-8956(03)00027-3_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/jgt.3190180207","article-title":"Path factors of bipartite graphs","volume":"18","author":"Wang","year":"1994","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:54:17Z","timestamp":1553205257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895603000273"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00027-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}