{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T19:47:54Z","timestamp":1652644074963},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"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":[[1991,3]]},"DOI":"10.1016\/0012-365x(91)90054-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:41:28Z","timestamp":1034293288000},"page":"1-9","source":"Crossref","is-referenced-by-count":3,"title":["Partitioning regular graphs into equicardinal linear forests"],"prefix":"10.1016","volume":"88","author":[{"given":"R.E.L.","family":"Aldred","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90054-6_BIB1","first-page":"405","article-title":"Covering and packing in graphs III: cyclic and acyclic invariants","volume":"30","author":"Akiyama","year":"1980","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(91)90054-6_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230110108","article-title":"Covering and packing in graphs IV: linear arboricity","volume":"11","author":"Akiyama","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0012-365X(91)90054-6_BIB3","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(91)90054-6_BIB4","first-page":"332","article-title":"Problem 13","volume":"23 A","author":"Aldred","year":"1987","journal-title":"Ars Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91900546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91900546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T11:55:01Z","timestamp":1554983701000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X91900546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0012365X91900546"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90054-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}