{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:44:07Z","timestamp":1777596247359,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90382-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"247-255","source":"Crossref","is-referenced-by-count":6,"title":["Packing paths perfectly"],"prefix":"10.1016","volume":"85","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Va\u0161ek","family":"Chv\u00e1tal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90382-R_BIB1","series-title":"Graphs and Applications","first-page":"1","article-title":"Path factors of a graph","author":"Akiyama","year":"1985"},{"key":"10.1016\/0012-365X(90)90382-R_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(90)90382-R_BIB3","series-title":"Topics on Perfect Graphs","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u0151tschel","year":"1984"},{"key":"10.1016\/0012-365X(90)90382-R_BIB4","first-page":"273","article-title":"Scheduling, matching, and coloring","volume":"25","author":"Hell","year":"1978","journal-title":"Colloq. Math. Soc. Janos Bolyai"},{"key":"10.1016\/0012-365X(90)90382-R_BIB5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1145\/800133.804353","article-title":"On the completeness of a generalized matching problem","author":"Kirkpatrick","year":"1978","journal-title":"Proc. Tenth Annual ACM Symposium on Theory and Computing"},{"key":"10.1016\/0012-365X(90)90382-R_BIB6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90382-R_BIB7","first-page":"17","article-title":"An O(|V|\u00b7|E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980","journal-title":"Proc. 21st Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0012-365X(90)90382-R_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01593791","article-title":"Line perfect graphs","volume":"12","author":"Trotter","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(90)90382-R_BIB9","series-title":"Topics on Perfect Graphs","first-page":"281","volume":"21","author":"Whitesides","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090382R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090382R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:57Z","timestamp":1555134957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090382R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090382R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90382-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}