{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:52Z","timestamp":1759063852746},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,23]],"date-time":"2011-12-23T00:00:00Z","timestamp":1324598400000},"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-1118-y","type":"journal-article","created":{"date-parts":[[2011,12,22]],"date-time":"2011-12-22T05:51:51Z","timestamp":1324533111000},"page":"373-385","source":"Crossref","is-referenced-by-count":2,"title":["The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords"],"prefix":"10.1007","volume":"29","author":[{"given":"Hongyu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,23]]},"reference":[{"key":"1118_CR1","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":"1118_CR2","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.: Covering and packing in graphs IV: linear arboricity. Networks 11, 69\u201372 (1981)","journal-title":"Networks"},{"key":"1118_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, New York (1976)"},{"key":"1118_CR4","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":"1118_CR5","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":"1118_CR6","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.: Covering and packing in graphs I. Ann. N.Y. Acad. Sci. 175, 198\u2013205 (1970)","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"1118_CR7","first-page":"92","volume":"17","author":"J.L. Wu","year":"1998","unstructured":"Wu J.L.: Some path decompositions of Halin graphs. J. Shandong Mining Institute 17, 92\u201396 (1998)","journal-title":"J. Shandong Mining Institute"},{"key":"1118_CR8","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":"1118_CR9","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. Graphs Combin. 16, 367\u2013372 (2000)","journal-title":"Graphs Combin."},{"key":"1118_CR10","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2007.05.003","volume":"381","author":"J.L. Wu","year":"2007","unstructured":"Wu J.L., Hou J.F., Liu G.Z.: The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381, 230\u2013233 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1118_CR11","first-page":"372","volume":"15","author":"J.L. Wu","year":"2002","unstructured":"Wu J.L., Liu G.Z., Wu Y.L.: The linear arboricity of composition of two graphs. J. Syst. Sci. Complex 15, 372\u2013375 (2002)","journal-title":"J. Syst. Sci. Complex"},{"key":"1118_CR12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/jgt.20305","volume":"58","author":"J.L. Wu","year":"2008","unstructured":"Wu J.L., Wu Y.W.: The linear arboricity of planar graphs of maximum degree seven are four. J. Graph Theory 58, 210\u2013220 (2008)","journal-title":"J. Graph Theory"},{"key":"1118_CR13","first-page":"174","volume":"10","author":"J.L. Wu","year":"2009","unstructured":"Wu J.L., Hou J.F., Sun X.Y.: A note on the linear arboricity of planar graphs without 4-cycles. ISORA\u2019 Lect. Notes Oper. Res. 10, 174\u2013178 (2009)","journal-title":"ISORA\u2019 Lect. Notes Oper. Res."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1118-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1118-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1118-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:32Z","timestamp":1559055572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1118-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,23]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1118"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1118-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,23]]}}}