{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:32:07Z","timestamp":1772847127173,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100009102","name":"education department of Jiangxi Province","doi-asserted-by":"publisher","award":["GJJ2201343"],"award-info":[{"award-number":["GJJ2201343"]}],"id":[{"id":"10.13039\/501100009102","id-type":"DOI","asserted-by":"publisher"}]},{"name":"PhD Scientific Research Foundation of Jiangxi Science and Technology Normal University","award":["2021BSQD29"],"award-info":[{"award-number":["2021BSQD29"]}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.12301440"],"award-info":[{"award-number":["No.12301440"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00373-024-02820-6","type":"journal-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T07:02:15Z","timestamp":1723100535000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Vertex Arboricity of 1-Planar Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Dongdong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hehua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"key":"2820_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02760181","volume":"6","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Kronk, H.V., Wall, C.E.: The point-arboricity of a graph. Isr. J. Math. 6, 169\u2013175 (1968)","journal-title":"Isr. J. Math."},{"key":"2820_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/0402007","volume":"2","author":"SL Hakimi","year":"1989","unstructured":"Hakimi, S.L., Schmeichel, E.F.: A note on the vertex arboricity of a graph. SIAM J. Discrete Math. 2, 64\u201367 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"2820_CR3","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1016\/j.ejc.2011.09.017","volume":"33","author":"M Chen","year":"2012","unstructured":"Chen, M., Raspaud, A., Wang, W.: Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Combin. 33, 905\u2013923 (2012)","journal-title":"Eur. J. Combin."},{"key":"2820_CR4","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1016\/j.disc.2012.03.035","volume":"312","author":"D Huang","year":"2012","unstructured":"Huang, D., Shiu, W., Wang, W.: On the vertex-arboricity of planar graphs without $$7$$-cycles. Discrete Math. 312, 2304\u20132315 (2012)","journal-title":"Discrete Math."},{"key":"2820_CR5","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Combin. 29, 1064\u20131075 (2008)","journal-title":"Eur. J. Combin."},{"key":"2820_CR6","doi-asserted-by":"publisher","first-page":"2438","DOI":"10.1016\/j.disc.2006.10.017","volume":"307","author":"A Yang","year":"2007","unstructured":"Yang, A., Yuan, J.: On the vertex arboricity of planar graphs of diameter two. Discrete Math. 307, 2438\u20132447 (2007)","journal-title":"Discrete Math."},{"key":"2820_CR7","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17, 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"2820_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ Hamb. 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ Hamb."},{"key":"2820_CR9","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Math. 307, 854\u2013865 (2007)","journal-title":"Discrete Math."},{"key":"2820_CR10","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"OV Borodin","year":"1995","unstructured":"Borodin, O.V.: A new proof of the $$6$$ color theorem. J. Graph Theory 19, 507\u2013521 (1995)","journal-title":"J. Graph Theory"},{"key":"2820_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(00)00359-0","volume":"114","author":"OV Borodin","year":"2001","unstructured":"Borodin, O.V., Kostochka, A.V., Raspaud, A., Sopena, E.: Acyclic colouring of 1-planar graphs. Discrete Appl. Math. 114, 29\u201341 (2001)","journal-title":"Discrete Appl. Math."},{"key":"2820_CR12","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1137\/20M133261X","volume":"35","author":"W Yang","year":"2021","unstructured":"Yang, W., Wang, Y., Wang, W., Lih, K.-W.: IC-planar graphs are $$6$$-choosable. SIAM J. Discrete Math. 35, 1729\u20131745 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"2820_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ipl.2010.11.001","volume":"111","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Wu, J.: On edge colorings of $$1$$-planar graphs. Inform. Process. Lett. 111, 124\u2013128 (2011)","journal-title":"Inform. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02820-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02820-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02820-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T15:03:45Z","timestamp":1729782225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02820-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,8]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2820"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02820-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,8]]},"assertion":[{"value":"1 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We deny that we have any intention to obtain any financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"96"}}