{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:45Z","timestamp":1759063605269},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T00:00:00Z","timestamp":1384473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-013-9680-2","type":"journal-article","created":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T04:24:20Z","timestamp":1384403060000},"page":"274-287","source":"Crossref","is-referenced-by-count":5,"title":["Minimum number of disjoint linear forests covering a planar graph"],"prefix":"10.1007","volume":"28","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,15]]},"reference":[{"key":"9680_CR1","doi-asserted-by":"crossref","unstructured":"A $$\\ddot{\\rm I}$$ I \u00a8 t-djafer H (1987) Linear arboricity for graphs with multiple edges. J Graph Theory 11:135\u2013140","DOI":"10.1002\/jgt.3190110203"},{"key":"9680_CR2","first-page":"405","volume":"30","author":"J Akiyama","year":"1980","unstructured":"Akiyama J, Exoo G, Harary F (1980) Covering and packing in graphs III: cyclic and acyclic invariants. Math Slovaca 30:405\u2013417","journal-title":"Math Slovaca"},{"key":"9680_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230110108","volume":"11","author":"J Akiyama","year":"1981","unstructured":"Akiyama J, Exoo G, Harary F (1981) Covering and packing in graphs IV: Linear arboricity. Networks 11:69\u201372","journal-title":"Networks"},{"key":"9680_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02783300","volume":"62","author":"N Alon","year":"1988","unstructured":"Alon N (1988) The linear arboricity of graphs. Israel J Math 62:311\u2013325","journal-title":"Israel J Math"},{"key":"9680_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/PL00007233","volume":"17","author":"N Alon","year":"2001","unstructured":"Alon N, Teague VJ, wormald NC (2001) Linear arboricity and linear $$k$$ k -arboricity of regular graphs. Graphs Combin 17:11\u201316","journal-title":"Graphs Combin"},{"key":"9680_CR6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/s10878-011-9385-3","volume":"24","author":"P Angelini","year":"2012","unstructured":"Angelini P, Frati F (2012) Acyclically 3-colorable planar graphs. J Comb Optim 24:116\u2013130","journal-title":"J Comb Optim"},{"key":"9680_CR7","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10878-011-9448-5","volume":"25","author":"S Bessy","year":"2013","unstructured":"Bessy S, Havet F (2013) Enumerating the edge-colourings and total colourings of a regular graph. J Comb Optim 25:523\u2013535","journal-title":"J Comb Optim"},{"key":"9680_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications (M)","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications (M). North-Holland, New York"},{"key":"9680_CR9","unstructured":"Chen HY, Tan X, Wu JL. The linear arboricity of planar graphs with maximum degree at least 7, Utilitas Math, to appear"},{"key":"9680_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1002\/jgt.20592","volume":"69","author":"M Cygan","year":"2012","unstructured":"Cygan M, Hou JF, Kowalik L, Luzar B, Wu JL (2012) A planar linear arboricity conjecture. J Graph Theory 69:403\u2013425","journal-title":"J Graph Theory"},{"key":"9680_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/B:JOGO.0000006750.85332.0f","volume":"28","author":"HW Du","year":"2004","unstructured":"Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Global Optim 28:115\u2013119","journal-title":"J Global Optim"},{"key":"9680_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190080211","volume":"8","author":"H Enomoto","year":"1984","unstructured":"Enomoto H, P\u00e9roche B (1984) The linear arboricity of some regular graphs. J Graph Theory 8:309\u2013324","journal-title":"J Graph Theory"},{"key":"9680_CR13","first-page":"225","volume":"36","author":"F Guldan","year":"1986","unstructured":"Guldan F (1986) The linear arboricity of 10 regular graphs. Math Slovaca 36:225\u2013228","journal-title":"Math Slovaca"},{"key":"9680_CR14","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1111\/j.1749-6632.1970.tb56470.x","volume":"175","author":"F Harary","year":"1970","unstructured":"Harary F (1970) Covering and packing in graphs I. Ann NY Acad Sci 175:198\u2013205","journal-title":"Ann NY Acad Sci"},{"key":"9680_CR15","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/s10878-012-9525-4","volume":"25","author":"XW Li","year":"2013","unstructured":"Li XW, Mak-Hau V, Zhou SM (2013) The $$L(2,1)$$ L ( 2 , 1 ) -labelling problem for cubic cayley graphs on dihedral groups. J Comb Optim 25:716\u2013736","journal-title":"J Comb Optim"},{"key":"9680_CR16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/rsa.3240010405","volume":"1","author":"CJH McDiarmid","year":"1990","unstructured":"McDiarmid CJH, Reed BA (1990) The linear arboricity of random regular graphs. Random Struct Algorithms 1:443\u2013445","journal-title":"Random Struct Algorithms"},{"key":"9680_CR17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1051\/ro\/1982160201251","volume":"16","author":"B P\u00e9oche","year":"1982","unstructured":"P\u00e9oche B (1982) Complexity of the linear arboricity of a graph. RAIRO Rech Oper 16:125\u2013129","journal-title":"RAIRO Rech Oper"},{"key":"9680_CR18","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10878-008-9178-5","volume":"19","author":"WF Wang","year":"2010","unstructured":"Wang WF, Wang YQ (2010) Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J Comb Optim 19:471\u2013485","journal-title":"J Comb Optim"},{"key":"9680_CR19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<129::AID-JGT5>3.0.CO;2-A","volume":"31","author":"JL Wu","year":"1999","unstructured":"Wu JL (1999) On the linear arboricity of planar graphs. J Graph Theory 31:129\u2013134","journal-title":"J Graph Theory"},{"key":"9680_CR20","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/jgt.20305","volume":"58","author":"JL Wu","year":"2008","unstructured":"Wu JL, Wu YW (2008) The linear arboricity of planar graphs of maximum degree seven are four. J Graph Theory 58:210\u2013220","journal-title":"J Graph Theory"},{"key":"9680_CR21","first-page":"219","volume":"15","author":"JL Wu","year":"1996","unstructured":"Wu JL (1996) Some path decompositions of Halin graphs. J Shandong Mining Inst 15:219\u2013222","journal-title":"J Shandong Mining Inst"},{"key":"9680_CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s373-000-8299-9","volume":"16","author":"JL Wu","year":"2000","unstructured":"Wu JL (2000) The linear arboricity of series-parallel graphs. Graphs Combin 16:367\u2013372","journal-title":"Graphs Combin"},{"key":"9680_CR23","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2007.05.003","volume":"381","author":"JL Wu","year":"2007","unstructured":"Wu JL, Hou JF, Liu GZ (2007) The linear arboricity of planar graphs with no short cycles. Theor Comp Sci 381:230\u2013233","journal-title":"Theor Comp Sci"},{"key":"9680_CR24","unstructured":"Wu JL, Hou JF, Sun XY (2009) A note on the linear arboricity of planar graphs without 4-cycles. ISORA\u201909, 174\u2013178"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9680-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9680-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9680-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T19:57:51Z","timestamp":1564689471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9680-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,15]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9680"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9680-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,15]]}}}