{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:22:07Z","timestamp":1758824527966},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>The linear [Formula: see text]-arboricity [Formula: see text] of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] can be partitioned into [Formula: see text] edge-disjoint forests, whose components are paths of length at most 2. In this paper, we study the linear [Formula: see text]-arboricity of sparse graphs, and prove the following results: (1) let [Formula: see text] be a 2-degenerate graph, we have [Formula: see text]; (2) if [Formula: see text], then [Formula: see text]; (3) if [Formula: see text], then [Formula: see text]; (4) if [Formula: see text], then [Formula: see text]; (5) if [Formula: see text], then [Formula: see text].<\/jats:p>","DOI":"10.1142\/s1793830917500471","type":"journal-article","created":{"date-parts":[[2017,7,3]],"date-time":"2017-07-03T08:25:50Z","timestamp":1499070350000},"page":"1750047","source":"Crossref","is-referenced-by-count":3,"title":["The linear 2-arboricity of sparse graphs"],"prefix":"10.1142","volume":"09","author":[{"given":"Yuanchao","family":"Li","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}]},{"given":"Xiaoxue","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"S1793830917500471BIB001","first-page":"97","volume":"18","author":"Aldred R. E. L.","year":"1998","journal-title":"Australas. J. Combin."},{"key":"S1793830917500471BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90075-X"},{"key":"S1793830917500471BIB003","doi-asserted-by":"publisher","DOI":"10.11650\/twjm\/1500407055"},{"key":"S1793830917500471BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00247-4"},{"key":"S1793830917500471BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21646"},{"key":"S1793830917500471BIB006","first-page":"55","volume":"3","author":"Chen B. L.","year":"1991","journal-title":"J. Combin."},{"key":"S1793830917500471BIB007","first-page":"309","volume":"38","author":"Fu H. L.","year":"1994","journal-title":"Ars Combin."},{"key":"S1793830917500471BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90209-6"},{"key":"S1793830917500471BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00293-6"},{"key":"S1793830917500471BIB010","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00373-002-0504-x","volume":"19","author":"Lih K. W.","year":"2003","journal-title":"Graphs Combin."},{"key":"S1793830917500471BIB011","first-page":"13","volume":"73","author":"Lih K. W.","year":"2004","journal-title":"Ars Combin."},{"key":"S1793830917500471BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.07.033"},{"key":"S1793830917500471BIB013","first-page":"121","volume":"29","author":"Qian J.","year":"2006","journal-title":"J. Zhejiang Norm. Univ."},{"key":"S1793830917500471BIB014","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1868"},{"key":"S1793830917500471BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.07.003"},{"key":"S1793830917500471BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-016-0434-z"},{"key":"S1793830917500471BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9178-5"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T11:38:50Z","timestamp":1602416330000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":17,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,16]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S1793830917500471"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500471","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}