{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T08:44:51Z","timestamp":1773823491300,"version":"3.50.1"},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9355,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The linear arboricity of a graph is the minimum number of linear forests into which its lines can be decomposed. We find that the linear arboricity of every 4\u2010regular graph is 3. This result enables us to obtain bounds for the linear arboricity of any graph in terms of its maximum degree.<\/jats:p>","DOI":"10.1002\/net.3230110108","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T11:46:38Z","timestamp":1178883998000},"page":"69-72","source":"Crossref","is-referenced-by-count":69,"title":["Covering and packing in graphs IV: Linear arboricity"],"prefix":"10.1002","volume":"11","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Exoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Harary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"405","article-title":"Covering and packing in graphs III: Cyclic and acyclic invariants","volume":"30","author":"Akiyama J.","year":"1980","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_3_2","first-page":"255","article-title":"The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests","volume":"27","author":"Akiyama J.","year":"1979","journal-title":"Discrete Math."},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"F. T.Boesch S.Chen andJ. A. M.McHugh \u201cOn covering the points of a graph with point disjoint paths \u201d Graph Theory and Combinatorics R. Bari and F. Harary Eds. Springer Lecture Notes #406 (1973) pp.202\u2013212.","DOI":"10.1007\/BFb0066442"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56470.x"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/362007.362015"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-39.1.12"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70514-4"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:14:52Z","timestamp":1699791292000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,3]]}},"alternative-id":["10.1002\/net.3230110108"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110108","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,3]]}}}