{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T14:33:14Z","timestamp":1770215594725,"version":"3.49.0"},"reference-count":11,"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":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A linear diforest is a digraph whose connected components are paths. We define the linear arboricity of a digraph, denoted <jats:italic>la(G)<\/jats:italic>, as the minimum number of linear diforests which partition the arcs of <jats:italic>G.<\/jats:italic> In this paper, we prove that the determination of <jats:italic>la(G)<\/jats:italic> is NP\u2010complete. We prove also that the problem becomes polynomial for acyclic digraphs. Finally, we give the value of <jats:italic>la(G)<\/jats:italic> for several families of digraphs, in particular 2\u2010regular digraphs.<\/jats:p>","DOI":"10.1002\/net.3230170104","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T21:50:35Z","timestamp":1178920235000},"page":"39-53","source":"Crossref","is-referenced-by-count":13,"title":["Linear arboricity of digraphs"],"prefix":"10.1002","volume":"17","author":[{"given":"A.","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"B.","family":"Peroche","sequence":"additional","affiliation":[]}],"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","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110108"},{"key":"e_1_2_1_4_2","volume-title":"Graphs and Hypergraphs","author":"Berge C.","year":"1973"},{"key":"e_1_2_1_5_2","unstructured":"G.ChatyandM.Chein Path number of k\u2010graphs and symmetric digraphs. Proc. 7th S.E. Conf. on Combinatorics Graph Theory and Computing Baton Rouge Congressus Numerantium 17 Utilitas Math. (1976)203\u2013216."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080211"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90068-4"},{"key":"e_1_2_1_8_2","unstructured":"F.Guldan The linear arboricity of 10\u2010regular graphs to appear."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56470.x"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/362007.362015"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90101-X"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T12:22:56Z","timestamp":1697890976000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170104"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170104","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}