{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:45Z","timestamp":1758823545651},"reference-count":4,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"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":9816,"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":[[1986,9]]},"DOI":"10.1016\/0012-365x(86)90106-8","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"329-331","source":"Crossref","is-referenced-by-count":2,"title":["Partitions of digraphs into paths or circuits"],"prefix":"10.1016","volume":"61","author":[{"given":"W.","family":"Bienia","sequence":"first","affiliation":[]},{"given":"H.","family":"Meyniel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90106-8_BIB1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0095-8956(76)90013-7","article-title":"Path number of tournaments","volume":"20","author":"Alspach","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(86)90106-8_BIB2","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1017\/S0004972700041101","article-title":"Path decomposition of digraphs","volume":"10","author":"Alspach","year":"1974","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0012-365X(86)90106-8_BIB3","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1972"},{"key":"10.1016\/0012-365X(86)90106-8_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0095-8956(77)90009-0","article-title":"An upper bound on the path number of a digraph","volume":"22","author":"O'Brien","year":"1977","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901068?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901068?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:53:16Z","timestamp":1553932396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86901068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":4,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["0012365X86901068"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90106-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}