{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T15:40:17Z","timestamp":1775490017927,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"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":[[1981]]},"DOI":"10.1016\/0012-365x(81)90262-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"95-98","source":"Crossref","is-referenced-by-count":12,"title":["A note on path-perfect graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"John Frederick","family":"Fink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.Joseph","family":"Straight","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90262-4_BIB1","series-title":"Introduction to the Theory of Graphs","author":"Behzad","year":"1971"},{"key":"10.1016\/0012-365X(81)90262-4_BIB2","first-page":"589","article-title":"Decompositions of complete graphs into forests","volume":"9","author":"Beineke","year":"1964","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"10.1016\/0012-365X(81)90262-4_BIB3","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"18","author":"Gy\u00e1rf\u00e1s","year":"1978","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"10.1016\/0012-365X(81)90262-4_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(81)90262-4_BIB5","series-title":"Doctoral Dissertation","article-title":"Partitions of the vertex set or edge set of a graph","author":"Straight","year":"1977"},{"key":"10.1016\/0012-365X(81)90262-4_BIB6","series-title":"Proceedings of the Scientist-in-Residence Program","article-title":"Packing trees of different size into a complete graph","author":"Straight","year":"1977"},{"key":"10.1016\/0012-365X(81)90262-4_BIB7","unstructured":"H.J. Straight and Paul Schillo, On the problem of partitioning {1,2,\u2026,n} into subsets having equal sums, Proceedings A.M.S. (to appear)."},{"key":"10.1016\/0012-365X(81)90262-4_BIB8","unstructured":"S. Zaks and C.L. Liu, Decomposition of graphs into trees, Proc. 8th S.E. Conf. Combinatorics, Graph Theory, and Computing, 643\u2013654."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T12:21:44Z","timestamp":1554898904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902624"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90262-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}