{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T23:18:41Z","timestamp":1783120721081,"version":"3.54.6"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Zhejiang Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejc.2026.104411","type":"journal-article","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:28:51Z","timestamp":1780720131000},"page":"104411","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Partitioning triangle-free planar graphs into a forest and a linear forest"],"prefix":"10.1016","volume":"137","author":[{"given":"Guanwu","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rongxing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejc.2026.104411_b1","first-page":"429","article-title":"Every planar map is four colorable. I. Discharging","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104411_b2","first-page":"491","article-title":"Every planar map is four colorable. II. Reducibility","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"issue":"1","key":"10.1016\/j.ejc.2026.104411_b3","first-page":"18","article-title":"A proof of b. Gr\u00fcnbaum\u2019s conjecture on the acyclic 5-colorability of planar graphs","volume":"231","author":"Borodin","year":"1976","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"10.1016\/j.ejc.2026.104411_b4","first-page":"34","article-title":"On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph","volume":"8","author":"Borodin","year":"2001","journal-title":"Diskretn. Anal. Issled. Oper. Ser. 1"},{"key":"10.1016\/j.ejc.2026.104411_b5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02760181","article-title":"The point-arboricity of a graph","volume":"6","author":"Chartrand","year":"1968","journal-title":"Israel J. Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104411_b6","doi-asserted-by":"crossref","DOI":"10.37236\/6738","article-title":"On t-common list-colorings","volume":"24","author":"Choi","year":"2017","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104411_b7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ejc.2017.06.014","article-title":"Partitioning a triangle-free planar graph into a forest and a forest of bounded degree","volume":"66","author":"Dross","year":"2017","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104411_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103878","article-title":"Decomposing a triangle-free planar graph into a forest and a subcubic forest","volume":"116","author":"Feghali","year":"2024","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104411_b9","first-page":"109","article-title":"Zur theorie der diskreten gebilde. VII. Ein dreifarbensatz f\u00fcr dreikreisfreie netze auf der kugel","volume":"8","author":"Gr\u00f6tzsch","year":"1958","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe"},{"issue":"4","key":"10.1016\/j.ejc.2026.104411_b10","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.jctb.2008.11.002","article-title":"Decomposing a planar graph of girth 5 into an independent set and a forest","volume":"99","author":"Kawarabayashi","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2026.104411_b11","doi-asserted-by":"crossref","DOI":"10.37236\/3509","article-title":"Near-colorings: non-colorable graphs and NP-completeness","volume":"22","author":"Montassier","year":"2015","journal-title":"Electron. J. Combin."},{"issue":"1","key":"10.1016\/j.ejc.2026.104411_b12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.3190140108","article-title":"On the linear vertex-arboricity of a planar graph","volume":"14","author":"Poh","year":"1990","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.ejc.2026.104411_b13","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","article-title":"On the vertex-arboricity of planar graphs","volume":"29","author":"Raspaud","year":"2008","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2026.104411_b14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1006\/jctb.1995.1057","article-title":"Decomposing a planar graph into degenerate graphs","volume":"65","author":"Thomassen","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.ejc.2026.104411_b15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1006\/jctb.2001.2056","article-title":"Decomposing a planar graph into an independent set and a 3-degenerate graph","volume":"83","author":"Thomassen","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104411_b16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jctb.2019.07.006","article-title":"A refinement of choosability of graphs","volume":"141","author":"Zhu","year":"2020","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566982600079X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566982600079X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T22:32:26Z","timestamp":1783117946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019566982600079X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":16,"alternative-id":["S019566982600079X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104411","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partitioning triangle-free planar graphs into a forest and a linear forest","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104411","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104411"}}