{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:59:52Z","timestamp":1775717992882,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014717","name":"National Outstanding Youth Science Fund Project of National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801522"],"award-info":[{"award-number":["11801522"]}],"id":[{"id":"10.13039\/100014717","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002641","name":"Konkuk University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002641","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"ZJNSF","doi-asserted-by":"crossref","award":["LY22A010016"],"award-info":[{"award-number":["LY22A010016"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901258"],"award-info":[{"award-number":["11901258"]}],"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":[[2026,4]]},"DOI":"10.1007\/s00373-026-03032-w","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:16:15Z","timestamp":1772637375000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable"],"prefix":"10.1007","volume":"42","author":[{"given":"Ligang","family":"Jin","sequence":"first","affiliation":[]},{"given":"Yingli","family":"Kang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5896-6751","authenticated-orcid":false,"given":"Seog-Jin","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,4]]},"reference":[{"issue":"1","key":"3032_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114225","volume":"348","author":"K Aoki","year":"2025","unstructured":"Aoki, K.: Improved 2-distance coloring of planar graphs with maximum degree 5. Discrete Math. 348(1), 114225 (2025)","journal-title":"Discrete Math."},{"issue":"4","key":"3032_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113288","volume":"346","author":"N Bousquet","year":"2023","unstructured":"Bousquet, N., Deschamps, Q., Meyer, L., Pierron, T.: Improved square coloring of planar graphs. Discrete Math. 346(4), 113288 (2023)","journal-title":"Discrete Math."},{"issue":"1","key":"3032_CR3","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/22M1492623","volume":"38","author":"N Bousquet","year":"2024","unstructured":"Bousquet, N., Deschamps, Q., Meyer, L., Pierron, T.: Square coloring planar graphs with automatic discharging. SIAM J. Discrete Math. 38(1), 504\u2013528 (2024)","journal-title":"SIAM J. Discrete Math."},{"key":"3032_CR4","doi-asserted-by":"crossref","unstructured":"Cranston, D. W.: Coloring, list Coloring, and painting squares of graphs (and other related problems), Electron. J. Combin. 30(2) (2023), $$\\#$$DS25","DOI":"10.37236\/10898"},{"issue":"1","key":"3032_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/jgt.20273","volume":"57","author":"DW Cranston","year":"2008","unstructured":"Cranston, D.W., Kim, S.-J.: List-coloring the square of a subcubic graph. J. Graph Theory 57(1), 65\u201387 (2008)","journal-title":"J. Graph Theory"},{"issue":"4","key":"3032_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114379","volume":"348","author":"Z Deniz","year":"2025","unstructured":"Deniz, Z.: On 2-distance 16-coloring of planar graphs with maximum degree at most five. Discrete Math. 348(4), 114379 (2025)","journal-title":"Discrete Math."},{"key":"3032_CR7","unstructured":"Hartke, S. G., Jahanbekam, S., Thomas, B.: The chromatic number of the square of subcubic planar graphs, (2016) arXiv:1604.06504"},{"key":"3032_CR8","unstructured":"Hasanvand, M.: The List Square Coloring Conjecture fails for cubic bipartite graphs and planar line graphs, (2022) arXiv:2211.00622"},{"key":"3032_CR9","first-page":"515","volume":"29","author":"F Havet","year":"2007","unstructured":"Havet, F., van den Heuvel, J., McDiarmid, C., Reed, B.: List colouring squares of planar graphs, Electron. Notes. Discrete Math. 29, 515\u2013519 (2007)","journal-title":"Discrete Math."},{"key":"3032_CR10","doi-asserted-by":"crossref","unstructured":"Jin, L., Kang, Y., Zhu, X.: Planar graphs having no cycle of length 4, 6 or 8 are DP-3-colorable, (2024) arXiv:2412.19059","DOI":"10.1002\/jgt.23123"},{"key":"3032_CR11","doi-asserted-by":"crossref","unstructured":"S.-J. Kim and X. Lian, The square of every subcubic planar graph of girth at least 6 is 7-choosable, Discrete Math. 347(6), 113963 (2024)","DOI":"10.1016\/j.disc.2024.113963"},{"issue":"4","key":"3032_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.21802","volume":"78","author":"S-J Kim","year":"2015","unstructured":"Kim, S.-J., Park, B.: Counterexamples to the list square coloring conjecture. J. Graph Theory 78(4), 239\u2013247 (2015)","journal-title":"J. Graph Theory"},{"key":"3032_CR13","doi-asserted-by":"crossref","unstructured":"M. Molloy and M. Salavatipour, A bound on the chromatic number of the square of a planar graph, J. Comb. Theory, Ser. B 94 (2005) 189\u2013213","DOI":"10.1016\/j.jctb.2004.12.005"},{"key":"3032_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jctb.2017.08.010","volume":"128","author":"C Thomassen","year":"2018","unstructured":"Thomassen, C.: The square of a planar cubic graph is 7-colorable. J. Combin. Theory Ser. B 128, 192\u2013218 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3032_CR15","unstructured":"Wegner, G.: Graphs with given diameter and a colouring problem, preprint, University of Dortmund (1977)"},{"key":"3032_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.dam.2024.04.001","volume":"353","author":"J Zou","year":"2024","unstructured":"Zou, J., Han, M., Lai, H.-J.: Square coloring of planar graphs with maximum degree at most five. Discrete Appl. Math. 353, 4\u201311 (2024)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03032-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03032-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03032-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:15:56Z","timestamp":1775715356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03032-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3032"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03032-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,4]]},"assertion":[{"value":"22 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","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":"Conflicts of interest"}}],"article-number":"31"}}