{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T11:47:05Z","timestamp":1782560825351,"version":"3.54.5"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:00:00Z","timestamp":1782518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:00:00Z","timestamp":1782518400000},"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":["12031018"],"award-info":[{"award-number":["12031018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LJHSZ26A010001"],"award-info":[{"award-number":["LJHSZ26A010001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["12101563"],"award-info":[{"award-number":["12101563"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["12371360"],"award-info":[{"award-number":["12371360"]}],"id":[{"id":"10.13039\/501100004731","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,8]]},"DOI":"10.1007\/s00373-026-03053-5","type":"journal-article","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T11:28:58Z","timestamp":1782559738000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["List Recoloring of Two Classes of Planar Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Chenran","family":"Pan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Runrun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,27]]},"reference":[{"key":"3053_CR1","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/21M1463598","volume":"37","author":"V Bartier","year":"2023","unstructured":"Bartier, V., Bousquet, N., Feghali, C., Heinrich, M., Moore, B., Pierron, T.: Recolouring planar graphs of girth at least five. SIAM J. Discrete Math. 37, 332\u2013350 (2023)","journal-title":"SIAM J. Discrete Math."},{"key":"3053_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.dam.2024.10.026","volume":"361","author":"M Belavadi","year":"2024","unstructured":"Belavadi, M., Cameron, K.: Recoloring some hereditary graph classes. Discret. Appl. Math. 361, 389\u2013401 (2024)","journal-title":"Discret. Appl. Math."},{"key":"3053_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103908","volume":"118","author":"M Belavadi","year":"2024","unstructured":"Belavadi, M., Cameron, K., Merkel, O.: Reconfiguration of vertex coloring and forbidden induced subgraphs. European J. Combin. 118, 103908 (2024)","journal-title":"European J. Combin."},{"key":"3053_CR4","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Heinrich, M.: A polynomial version of Cereceda s conjecture. J. Comb. Theory, Ser. B 155, 1\u201316 (2022)","DOI":"10.1016\/j.jctb.2022.01.006"},{"key":"3053_CR5","unstructured":"Belavadi, M., Karthick, T.: Reconfiguration graph of vertex colorings for some generalized split graphs. (). arxiv:2509.03190"},{"key":"3053_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2015.08.001","volume":"52","author":"N Bousquet","year":"2016","unstructured":"Bousquet, N., Perarnau, G.: Fast recoloring of sparse graphs. European J. Combin. 52, 1\u201311 (2016)","journal-title":"European J. Combin."},{"key":"3053_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103798","volume":"115","author":"S Cambie","year":"2024","unstructured":"Cambie, S., van Batenburg, W.C., Cranston, D.W.: Optimally reconfiguring list andcorrespondence colourings. European J. Combin. 115, 103798 (2024)","journal-title":"European J. Combin."},{"key":"3053_CR8","unstructured":"Cereceda, L.: Mixing Graph Colourings, London School of Economics (2007). (Ph.D Thesis)"},{"key":"3053_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103562","volume":"105","author":"DW Cranston","year":"2022","unstructured":"Cranston, D.W.: List-recoloring of sparse graphs. European J. Combin. 105, 103562 (2022)","journal-title":"European J. Combin."},{"key":"3053_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2025.104190","volume":"130","author":"DW Cranston","year":"2025","unstructured":"Cranston, D.W.: 10-list recoloring of planar graphs. European J. Combin. 130, 104190 (2025)","journal-title":"European J. Combin."},{"key":"3053_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2024.11.031","volume":"363","author":"LS Chandran","year":"2025","unstructured":"Chandran, L.S., Gupta, U.K., Pradhan, D.: List recoloring of planar graphs. Discrete Appl. Math. 363, 71\u201387 (2025)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"3053_CR12","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1002\/jgt.23064","volume":"105","author":"DW Cranston","year":"2024","unstructured":"Cranston, D.W., Mahmoud, R.: 5-coloring reconfiguration of planar graphs with no short odd Cycles. J. Graph Theory 105(4), 670\u2013679 (2024)","journal-title":"J. Graph Theory"},{"key":"3053_CR13","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Feghali, C.: An update on reconfiguring 10-colorings of planar graphs. Electronic J. Combin , 4\u201351 (2020)","DOI":"10.37236\/9391"},{"key":"3053_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103319","volume":"95","author":"Z Dvo\u0159\u00e1k","year":"2021","unstructured":"Dvo\u0159\u00e1k, Z., Feghali, C.: A Thomassen-type method for planar graph recoloring. European J. Combin. 95, 103319 (2021)","journal-title":"European J. Combin."},{"key":"3053_CR15","first-page":"394","volume":"40","author":"H Lei","year":"2024","unstructured":"Lei, H., Ma, Y., Miao, Z., Shi, Y., Wang, S.: Reconfiguration graphs for vertex colorings of $$P_5$$-free graphs, Annals of. Appl. Math. 40, 394\u2013411 (2024)","journal-title":"Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03053-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T11:29:02Z","timestamp":1782559742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03053-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,27]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3053"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03053-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,27]]},"assertion":[{"value":"6 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 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":"On behalf of all authors, the corresponding author states there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"61"}}