{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:44Z","timestamp":1758823724074},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,29]],"date-time":"2011-12-29T00:00:00Z","timestamp":1325116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-011-1122-2","type":"journal-article","created":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T09:10:28Z","timestamp":1325063428000},"page":"661-667","source":"Crossref","is-referenced-by-count":2,"title":["Linear 2-Arboricity of Planar Graphs with Neither 3-Cycles Nor Adjacent 4-Cycles"],"prefix":"10.1007","volume":"29","author":[{"given":"Hong-Xia","family":"Niu","sequence":"first","affiliation":[]},{"given":"Jian-Sheng","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,29]]},"reference":[{"key":"1122_CR1","unstructured":"Akiyama, J. Three developing topics in graph theory. Doctoral dissertation, University of Tokyo (1980)"},{"key":"1122_CR2","first-page":"405","volume":"30","author":"J. Akiyama","year":"1980","unstructured":"Akiyama J., Exoo G., Harary F.: Covering and packing in graphs III: cyclic and acyclic invariants. Math. Slovaca 30, 405\u2013417 (1980)","journal-title":"Math. Slovaca"},{"key":"1122_CR3","first-page":"97","volume":"18","author":"R.E.L. Aldred","year":"1998","unstructured":"Aldred R.E.L., Wormald N.C.: More on the linear k-arboricity of regular graphs. Aust. J. Comb. 18, 97\u2013104 (1998)","journal-title":"Aust. J. Comb."},{"key":"1122_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(84)90075-X","volume":"52","author":"J.C. Bermond","year":"1984","unstructured":"Bermond J.C., Fouquet J.L., Habib M., P\u00e9roche B.: On linear k-arboricity. Discret. Math. 52, 123\u2013132 (1984)","journal-title":"Discret. Math."},{"key":"1122_CR5","first-page":"73","volume":"3","author":"G.J. Chang","year":"1999","unstructured":"Chang G.J.: Algorithmic aspects of linear k-arboricity. Taiwan. J. Math. 3, 73\u201381 (1999)","journal-title":"Taiwan. J. Math."},{"key":"1122_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0166-218X(99)00247-4","volume":"103","author":"G.J. Chang","year":"2000","unstructured":"Chang G.J., Chen B.L., Fu H.L., Huang K.C.: Linear k-arboricities on trees. Discret. Appl. Math. 103, 281\u2013287 (2000)","journal-title":"Discret. Appl. Math."},{"key":"1122_CR7","first-page":"55","volume":"3","author":"B.L. Chen","year":"1991","unstructured":"Chen B.L., Fu H.L., Huang K.C.: Decomposing graphs into forests of paths with size less than three. Aust. J. Comb 3, 55\u201373 (1991)","journal-title":"Aust. J. Comb"},{"key":"1122_CR8","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.: The linear arboricity of some regular graphs. J. Graph Theory 8, 309\u2013324 (1984)","journal-title":"J. Graph Theory"},{"key":"1122_CR9","first-page":"309","volume":"38","author":"H.L. Fu","year":"1994","unstructured":"Fu H.L., Huang K.C.: The linear 2-arboricity of complete bipartite graphs. Ars Comb. 38, 309\u2013318 (1994)","journal-title":"Ars Comb."},{"key":"1122_CR10","first-page":"225","volume":"36","author":"F. Guldan","year":"1986","unstructured":"Guldan F.: The linear arboricity of 10-regular graphs. Math. Slovaca 36, 225\u2013228 (1986)","journal-title":"Math. Slovaca"},{"key":"1122_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(82)90209-6","volume":"41","author":"M. Habib","year":"1982","unstructured":"Habib M., P\u00e9roche P.: Some problems about linear arboricity. Discret. Math. 41, 219\u2013220 (1982)","journal-title":"Discret. Math."},{"key":"1122_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(95)00293-6","volume":"162","author":"B. Jackson","year":"1996","unstructured":"Jackson B., Wormald N.C.: On linear k-arboricity of cubic graphs. Discret. Math. 162, 293\u2013297 (1996)","journal-title":"Discret. Math."},{"key":"1122_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00373-002-0504-x","volume":"19","author":"K.W. Lih","year":"2003","unstructured":"Lih K.W., Tong L.D., Wang W.F.: The linear 2-arboricity of planar graphs. Graphs Comb. 19, 241\u2013248 (2003)","journal-title":"Graphs Comb."},{"key":"1122_CR14","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1016\/j.disc.2008.07.033","volume":"309","author":"Q. Ma","year":"2009","unstructured":"Ma Q., Wu J.L., Yu X.: Planar graphs without 5-cycles or without 6-cycles. Discret. Math. 309, 2998\u20133005 (2009)","journal-title":"Discret. Math."},{"key":"1122_CR15","first-page":"121","volume":"29","author":"J. Qian","year":"2006","unstructured":"Qian J., Wang W.F.: The linear 2-arboricity of planar graphs without 4-cycles. J.Zhejiang Norm. Univ. 29, 121\u2013125 (2006)","journal-title":"J.Zhejiang Norm. Univ."},{"key":"1122_CR16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.1998.1868","volume":"75","author":"C. Thomassen","year":"1999","unstructured":"Thomassen C.: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Comb. Theory Ser. B 75, 100\u2013109 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1122_CR17","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":"J.L. Wu","year":"1999","unstructured":"Wu J.L.: On the linear arboricity of planar graphs. J. Graph Theory 31, 129\u2013134 (1999)","journal-title":"J. Graph Theory"},{"key":"1122_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s373-000-8299-9","volume":"16","author":"J.L. Wu","year":"2000","unstructured":"Wu J.L.: The linear arboricity of series-parallel graphs. Graph Comb. 16, 367\u2013372 (2000)","journal-title":"Graph Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1122-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1122-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1122-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T12:32:49Z","timestamp":1593433969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1122-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,29]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1122"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1122-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,29]]}}}