{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:20:52Z","timestamp":1768202452166,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.11861069"],"award-info":[{"award-number":["No.11861069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Youth Science Foundation of Guangxi Province","award":["No.2019JJB110007"],"award-info":[{"award-number":["No.2019JJB110007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00373-022-02605-9","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T16:02:41Z","timestamp":1672675361000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest"],"prefix":"10.1007","volume":"39","author":[{"given":"Xiaojie","family":"Huang","sequence":"first","affiliation":[]},{"given":"Ziwen","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jian-Bo","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,2]]},"reference":[{"issue":"3","key":"2605_CR1","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. I. Discharging. Illinois J. Math. 21(3), 429\u2013490 (1977)","journal-title":"Illinois J. Math."},{"issue":"3","key":"2605_CR2","first-page":"491","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. II. Reducibility. Illinois J. Math. 21(3), 491\u2013567 (1977)","journal-title":"Illinois J. Math."},{"issue":"1","key":"2605_CR3","first-page":"18","volume":"231","author":"OV Borodin","year":"1976","unstructured":"Borodin, O.V.: A proof of B. Grnbaums conjecture on the acyclic $$5$$-colorability of planar graphs. Dokl. Akad. Nauk SSSR 231(1), 18\u201320 (1976)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"2605_CR4","first-page":"34","volume":"8","author":"OV Borodin","year":"2001","unstructured":"Borodin, O.V., Glebov, A.N.: On the partition of a planar graph of girth $$5$$ into an empty and an acyclic subgraph. Diskretn. Anal. Issled. Oper. Ser. 1 8(4), 34\u201353 (2001)","journal-title":"Diskretn. Anal. Issled. Oper. Ser. 1"},{"key":"2605_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jctb.2013.10.002","volume":"104","author":"OV Borodin","year":"2014","unstructured":"Borodin, O.V., Kostochka, A.V.: Defective 2-colorings of sparse graphs. J. Combin. Theory Ser. B 104, 72\u201380 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2605_CR6","doi-asserted-by":"crossref","unstructured":"Cho, E.K., Choi, I., Park, B.: Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discrete Math. 344, 112172 (2021)","DOI":"10.1016\/j.disc.2020.112172"},{"issue":"4","key":"2605_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/jgt.22039","volume":"84","author":"H Choi","year":"2017","unstructured":"Choi, H., Choi, I., Jeong, J., Suh, G.: $$(1, k)$$-coloring of graphs with girth at least five on a surface. J. Graph Theory 84(4), 521\u2013535 (2017)","journal-title":"J. Graph Theory"},{"issue":"12","key":"2605_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.06.033","volume":"342","author":"I Choi","year":"2019","unstructured":"Choi, I., Yu, G., Zhang, X.: Planar graphs with girth at least $$5$$ are $$(3, 4)$$-colorable. Discrete Math. 342(12), 111577 (2019)","journal-title":"Discrete Math."},{"key":"2605_CR9","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jctb.2016.07.006","volume":"122","author":"V Cohen-Addad","year":"2017","unstructured":"Cohen-Addad, V., Hebdige, M., Kr\u00e1l, D., Li, Z., Salgado, E.: Steinberg\u2019s conjecture is false. J. Combin. Theory Ser. B 122, 452\u2013456 (2017)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2605_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"2605_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ejc.2017.06.014","volume":"66","author":"F Dross","year":"2017","unstructured":"Dross, F., Montassier, M., Pinlou, A.: Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Combin. 66, 81\u201394 (2017)","journal-title":"Eur. J. Combin."},{"key":"2605_CR12","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"2605_CR13","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch, H.: Ein dreifarbensatz f\u00fcr dreikreisfreienetze auf der kugel. Math.-Nat. Reihe 8, 109\u2013120 (1959)","journal-title":"Math.-Nat. Reihe"},{"key":"2605_CR14","doi-asserted-by":"crossref","unstructured":"Jensen, T., Toft, B.: Graph Coloring Problems. John Wily and Sons, New York (1995)","DOI":"10.1002\/9781118032497"},{"key":"2605_CR15","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1007\/s40840-019-00819-4","volume":"43","author":"L Liu","year":"2020","unstructured":"Liu, L., Lv, J.: Every planar graph without 4-cycles and 5-cycles is (2, 6)-colorable. Bull. Malays. Math. Sci. Soc. 43, 2493\u20132507 (2020)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"1","key":"2605_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/jgt.3190140108","volume":"14","author":"K Poh","year":"1990","unstructured":"Poh, K.: On the linear vertex-arboricity of a plane graph. J. Graph Theory 14(1), 73\u201375 (1990)","journal-title":"J. Graph Theory"},{"issue":"8","key":"2605_CR17","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1016\/j.disc.2018.04.024","volume":"341","author":"P Sittitrai","year":"2018","unstructured":"Sittitrai, P., Nakprasit, K.: Defective 2-colorings of planar graphs without $$4$$-cycles and $$5$$-cycles. Discrete Math. 341(8), 2142\u20132150 (2018)","journal-title":"Discrete Math."},{"key":"2605_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-5060(08)70391-1","volume":"55","author":"R Steinberg","year":"1993","unstructured":"Steinberg, R.: The state of the three color problem. Quo Vadis, Graph Theory?,. Ann. Discrete Math. 55, 211\u2013248 (1993)","journal-title":"Ann. Discrete Math."},{"issue":"18","key":"2605_CR19","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/j.ipl.2013.06.001","volume":"113","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Xu, J.: Planar graphs with cycles of length neither 4 nor 6 are $$(2, 0, 0)$$-colorable. Inf. Proc. Lett. 113(18), 659\u2013663 (2013)","journal-title":"Inf. Proc. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02605-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02605-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02605-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T21:46:55Z","timestamp":1677016015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02605-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2605"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02605-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,2]]},"assertion":[{"value":"23 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"10"}}