{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913356,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2021R1A2C1005785","NRF-2022R1F1A1074886"],"award-info":[{"award-number":["NRF-2021R1A2C1005785","NRF-2022R1F1A1074886"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371359"],"award-info":[{"award-number":["12371359"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,2]]},"DOI":"10.1007\/s00373-024-02867-5","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T19:16:12Z","timestamp":1734376572000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["List Dynamic 4-Coloring of Planar Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Seog-Jin","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9752-7033","authenticated-orcid":false,"given":"Sang June","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopan","family":"Lian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"issue":"14","key":"2867_CR1","doi-asserted-by":"publisher","first-page":"3005","DOI":"10.1016\/j.dam.2009.05.002","volume":"157","author":"S Akbari","year":"2009","unstructured":"Akbari, S., Ghanbari, M., Jahanbekam, S.: On the list dynamic coloring of graphs. Discr. Appl. Math. 157(14), 3005\u20133007 (2009)","journal-title":"Discr. Appl. Math."},{"issue":"2\u20133","key":"2867_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.dam.2010.10.012","volume":"159","author":"M Alishahi","year":"2011","unstructured":"Alishahi, M.: On the dynamic coloring of graphs. Discr. Appl. Math. 159(2\u20133), 152\u2013156 (2011)","journal-title":"Discr. Appl. Math."},{"key":"2867_CR3","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.dam.2012.01.012","volume":"160","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Fan, S., Lai, H.-J., Song, H., Sun, L.: Conditional coloring for planar graphs and graphs of higher genus. Discr. Appl. Math. 160, 1064\u20131071 (2012)","journal-title":"Discr. Appl. Math."},{"key":"2867_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.dam.2022.06.003","volume":"321","author":"Y Chen","year":"2022","unstructured":"Chen, Y., Fan, S., Lai, H.-J., Xu, M.: Graph $$r$$-hued colorings\u2014a survey. Discr. Appl. Math. 321, 24\u201348 (2022)","journal-title":"Discr. Appl. Math."},{"key":"2867_CR5","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), volume XXVI of Congress. Numer., pages 125\u2013157. Utilitas Math., Winnipeg, MB, (1980)"},{"issue":"17","key":"2867_CR6","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1016\/j.dam.2010.08.007","volume":"158","author":"L Esperet","year":"2010","unstructured":"Esperet, L.: Dynamic list coloring of bipartite graphs. Discr. Appl. Math. 158(17), 1963\u20131965 (2010)","journal-title":"Discr. Appl. Math."},{"key":"2867_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2016.01.016","volume":"206","author":"S Jahanbekam","year":"2016","unstructured":"Jahanbekam, S., Kim, J., O, S., West, D.B.: On $$r$$-dynamic coloring of graphs. Discr. Appl. Math. 206, 65\u201372 (2016)","journal-title":"Discr. Appl. Math."},{"issue":"13\u201314","key":"2867_CR8","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1016\/j.dam.2013.03.005","volume":"161","author":"S-J Kim","year":"2013","unstructured":"Kim, S.-J., Lee, S.J., Park, W.-J.: Dynamic coloring and list dynamic coloring of planar graphs. Discr. Appl. Math. 161(13\u201314), 2207\u20132212 (2013)","journal-title":"Discr. Appl. Math."},{"issue":"5","key":"2867_CR9","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1016\/j.disc.2017.09.025","volume":"341","author":"S-J Kim","year":"2018","unstructured":"Kim, S.-J., Park, B.: List 3-dynamic coloring of graphs with small maximum average degree. Discr. Math. 341(5), 1406\u20131418 (2018)","journal-title":"Discr. Math."},{"key":"2867_CR10","doi-asserted-by":"crossref","unstructured":"Kim, S.-J., Park, W.-J.: List dynamic coloring of sparse graphs. In Combinatorial optimization and applications, volume 6831 of Lecture Notes in Comput. Sci., pages 156\u2013162. Springer, Heidelberg, (2011)","DOI":"10.1007\/978-3-642-22616-8_13"},{"key":"2867_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2016.01.022","volume":"206","author":"Y Kim","year":"2016","unstructured":"Kim, Y., Lee, S.J., Oum, S.-I.: Dynamic coloring of graphs having no $$K_5$$ minor. Discr. Appl. Math. 206, 81\u201389 (2016)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"2867_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.0.CO;2-G","volume":"27","author":"J Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Tuza, Z., Voigt, M.: Brooks-type theorems for choosability with separation. J. Graph Theory 27(1), 43\u201349 (1998)","journal-title":"J. Graph Theory"},{"issue":"16","key":"2867_CR13","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1016\/j.disc.2006.03.052","volume":"306","author":"H-J Lai","year":"2006","unstructured":"Lai, H.-J., Lin, J., Montgomery, B., Shui, T., Fan, S.: Conditional colorings of graphs. Discr. Math. 306(16), 1997\u20132004 (2006)","journal-title":"Discr. Math."},{"key":"2867_CR14","first-page":"193","volume":"68","author":"H-J Lai","year":"2003","unstructured":"Lai, H.-J., Montgomery, B., Poon, H.: Upper bounds of dynamic chromatic number. Ars Combin. 68, 193\u2013201 (2003)","journal-title":"Ars Combin."},{"issue":"3","key":"2867_CR15","first-page":"34","volume":"42","author":"Y Lin","year":"2010","unstructured":"Lin, Y., Zhao, K.W.: Dynamic coloring of planar graphs. J. Zhengzhou Univ. Nat. Sci. Ed. 42(3), 34\u201336 (2010)","journal-title":"J. Zhengzhou Univ. Nat. Sci. Ed."},{"key":"2867_CR16","first-page":"3","volume":"79","author":"X Meng","year":"2006","unstructured":"Meng, X., Miao, L., Su, B., Li, R.: The dynamic coloring numbers of pseudo-Halin graphs. Ars Combin. 79, 3\u20139 (2006)","journal-title":"Ars Combin."},{"key":"2867_CR17","first-page":"15","volume":"17","author":"M Mirzakhani","year":"1996","unstructured":"Mirzakhani, M.: A small non-$$4$$-choosable planar graph. Bull. Inst. Combin. Appl. 17, 15\u201318 (1996)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2867_CR18","unstructured":"Montgomery, B.: Dynamic coloring of graphs. ProQuest LLC, Ann Arbor, MI, (2001). Thesis (Ph.D.)\u2013West Virginia University"},{"key":"2867_CR19","first-page":"169","volume":"58","author":"R \u0160krekovski","year":"2001","unstructured":"\u0160krekovski, R.: A note on choosability with separation for planar graphs. Ars Combin. 58, 169\u2013174 (2001)","journal-title":"Ars Combin."},{"key":"2867_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2023.04.001","volume":"162","author":"X Zhu","year":"2023","unstructured":"Zhu, X.: List 4-colouring of planar graphs. J. Combin. Theory Ser. B 162, 1\u201312 (2023)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02867-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02867-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02867-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:35Z","timestamp":1748319755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02867-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2867"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02867-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,16]]},"assertion":[{"value":"17 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":3,"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":"6"}}