{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:03Z","timestamp":1759063743582},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(99)00247-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:45Z","timestamp":1027636725000},"page":"281-287","source":"Crossref","is-referenced-by-count":25,"title":["Linear k-arboricities on trees"],"prefix":"10.1016","volume":"103","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bor-Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Ching","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00247-4_BIB1","first-page":"5","article-title":"Linear arboricity for graphs with maximum degree six or seven and edge multiplicity two","volume":"20","author":"Ait-Djafter","year":"1985","journal-title":"Ars. Combin."},{"year":"1980","series-title":"Three developing topics in graph theory, Doctoral Dissertation","author":"Akiyama","key":"10.1016\/S0166-218X(99)00247-4_BIB2"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB3","doi-asserted-by":"crossref","unstructured":"J. Akiyama, A status on the linear arboricity, Lecture Notes in Computer Science, Vol. 108, Springer, Berlin, 1981, 38\u201344.","DOI":"10.1007\/3-540-10704-5_4"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB4","first-page":"1","article-title":"A short proof of the linear arboricity for cubic graphs","volume":"2","author":"Akiyama","year":"1981","journal-title":"Bull. Liber. Arts and Sci., NMS"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB5","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\/S0166-218X(99)00247-4_BIB6","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"},{"year":"1984","series-title":"Path factors of a graph, Graph Theory and its Applications","author":"Akiyama","key":"10.1016\/S0166-218X(99)00247-4_BIB7"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02783300","article-title":"The linear arboricity of graphs","volume":"62","author":"Alon","year":"1988","journal-title":"Israel J. Math."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(84)90075-X","article-title":"On linear k-arboricity","volume":"52","author":"Bermond","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.11650\/twjm\/1500407055","article-title":"Algorithmic aspects of linear k-arboricity","volume":"3","author":"Chang","year":"1999","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB11","unstructured":"C.Y. Chen, Y.P. Chen, G.J. Chang, The tree arboricity of a graph, submitted for publication."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB12","first-page":"55","article-title":"Decomposing graphs into forests of paths with size less than three","volume":"3","author":"Chen","year":"1991","journal-title":"Austr. J. Combin."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB13","unstructured":"B.L. Chen, K.C. Huang, On the linear k-arboricity of Kn and Kn,n, Manuscript, 1996."},{"year":"1981","series-title":"The linear arboricity of 5-regular graphs","author":"Enomoto","key":"10.1016\/S0166-218X(99)00247-4_BIB14"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190080211","article-title":"The linear arboricity of some regular graphs","volume":"8","author":"Enomoto","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB16","first-page":"309","article-title":"The linear 2-arboricity of complete bipartite graphs","volume":"38","author":"Fu","year":"1994","journal-title":"Ars. Combinatoria"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB17","first-page":"225","article-title":"The linear arboricity of 10-regular graphs","volume":"36","author":"Guldan","year":"1986","journal-title":"Math. Slovaca"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB18","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1002\/jgt.3190100408","article-title":"Some results on linear arboricity","volume":"10","author":"Guldan","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(82)90209-6","article-title":"Some problems about linear arboricity","volume":"41","author":"Habib","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB20","first-page":"307","article-title":"La k-arboricit\u00e9 lin\u00e9aire des arbres","volume":"17","author":"Habib","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB21","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1111\/j.1749-6632.1970.tb56470.x","article-title":"Covering and packing in graphs I","volume":"175","author":"Harary","year":"1970","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB22","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge colourings","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB23","unstructured":"K.C. Huang, Some results on linear k-arboricity, Manuscript, 1996."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB24","unstructured":"F. Jaeger, Etude de quelques invariants et probl\u00e8mes d'existence en th\u00e9orie des graphes, Th\u00e8se d'Etat, IMAG Grenbole, 1976."},{"key":"10.1016\/S0166-218X(99)00247-4_BIB25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/net.3230170104","article-title":"Linear arboricity of digraphs","volume":"17","author":"Nakayama","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB26","doi-asserted-by":"crossref","DOI":"10.1051\/ro\/1982160201251","article-title":"Complexit\u00e9 de l'arboricit\u00e9 lin\u00e1ire d'un graphe","volume":"16","author":"Peroche","year":"1982","journal-title":"RAIRO"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB27","first-page":"239","article-title":"Note on linear arboricity","volume":"32","author":"Tomasta","year":"1982","journal-title":"Math. Slovaca"},{"key":"10.1016\/S0166-218X(99)00247-4_BIB28","doi-asserted-by":"crossref","first-page":"353","DOI":"10.11650\/twjm\/1500406975","article-title":"The path-partition problem in bipartite distance-hereditary graphs","volume":"2","author":"Yeh","year":"1998","journal-title":"Taiwanese J. Math."},{"year":"1997","series-title":"Linear arboricities of complete r-partite graphs","author":"Yeh","key":"10.1016\/S0166-218X(99)00247-4_BIB29"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T06:59:56Z","timestamp":1555225196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X99002474"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00247-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}