{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:26Z","timestamp":1759335326623,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T00:00:00Z","timestamp":1590796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T00:00:00Z","timestamp":1590796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Research Council of Norway","doi-asserted-by":"crossref","award":["249994"],"award-info":[{"award-number":["249994"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["19-21082S"],"award-info":[{"award-number":["19-21082S"]}],"id":[{"id":"10.13039\/501100001824","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":[[2020,11]]},"DOI":"10.1007\/s00373-020-02199-0","type":"journal-article","created":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T18:02:42Z","timestamp":1590861762000},"page":"1815-1818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reconfiguring 10-Colourings of Planar Graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6727-7213","authenticated-orcid":false,"given":"Carl","family":"Feghali","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,30]]},"reference":[{"key":"2199_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ejc.2017.10.010","volume":"69","author":"M Bonamy","year":"2018","unstructured":"Bonamy, M., Bousquet, N.: Recoloring graphs via tree decompositions. Eur. J. Comb. 69, 200\u2013213 (2018)","journal-title":"Eur. J. Comb."},{"key":"2199_CR2","unstructured":"Bousquet, N., Heinrich, M.: A polynomial version of Cereceda\u2019s conjecture. arXiv (2019)"},{"key":"2199_CR3","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. Eur. J. Comb. 52, 1\u201311 (2016)","journal-title":"Eur. J. Comb."},{"key":"2199_CR4","unstructured":"Cereceda, L.: Mixing graph colourings. PhD thesis, London School of Economics (2007)"},{"key":"2199_CR5","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Feghali, C.: An update on reconfiguring $$10 $$-colorings of planar graphs (2020). arXiv:2002.05383","DOI":"10.37236\/9391"},{"issue":"3","key":"2199_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/jgt.22447","volume":"92","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z., Norin, S., Postle, L.: List coloring with requests. J. Graph Theory 92(3), 191\u2013206 (2019)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2199_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.22518","volume":"94","author":"E Eiben","year":"2020","unstructured":"Eiben, E., Feghali, C.: Toward Cereceda\u2019s conjecture for planar graphs. J. Graph Theory 94(2), 267\u2013277 (2020)","journal-title":"J. Graph Theory"},{"key":"2199_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2018.12.006","volume":"144","author":"C Feghali","year":"2019","unstructured":"Feghali, C.: Paths between colourings of graphs with bounded tree-width. Inf. Process. Lett. 144, 37\u201338 (2019)","journal-title":"Inf. Process. Lett."},{"key":"2199_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ejc.2018.09.001","volume":"75","author":"C Feghali","year":"2019","unstructured":"Feghali, C.: Paths between colourings of sparse graphs. Eur. J. Comb. 75, 169\u2013171 (2019)","journal-title":"Eur. J. Comb."},{"key":"2199_CR10","unstructured":"Feghali, C.: Reconfiguring colourings of graphs with bounded maximum average degree (2019). arXiv:1904.12698"},{"issue":"4","key":"2199_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1002\/jgt.22000","volume":"83","author":"C Feghali","year":"2016","unstructured":"Feghali, C., Johnson, M., Paulusma, D.: A reconfigurations analogue of Brooks\u2019 theorem and its consequences. J. Graph Theory 83(4), 340\u2013358 (2016)","journal-title":"J. Graph Theory"},{"issue":"4","key":"2199_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018)","journal-title":"Algorithms"},{"issue":"1","key":"2199_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is 5-choosable. J. Comb. Theory Ser. B 62(1), 180\u2013181 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2199_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jctb.1995.1027","volume":"64","author":"C Thomassen","year":"1995","unstructured":"Thomassen, C.: 3-list-coloring planar graphs of girth 5. J. Comb. Theory Ser. B 64(1), 101\u2013107 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2199_CR15","unstructured":"van den\u00a0Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics 2013, London Mathematical Society Lecture Notes Series, vol. 409 (2013). http:\/\/arxiv.org\/abs\/1312.2816"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02199-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02199-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02199-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T23:30:14Z","timestamp":1622331014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02199-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,30]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2199"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02199-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,5,30]]},"assertion":[{"value":"16 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}