{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T17:49:41Z","timestamp":1772992181306,"version":"3.50.1"},"reference-count":20,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"},{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN\u20102016\u201006517"],"award-info":[{"award-number":["RGPIN\u20102016\u201006517"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>The reconfiguration graph of the \u2010colorings of a graph , denoted , is the graph whose vertices are the \u2010colorings of  and two colorings are adjacent in  if they differ in color on exactly one vertex. A graph  is said to be recolorable if  is connected for all . We demonstrate how to use the modular decomposition of a graph to prove that it is recolorable. In particular, we prove that every (, diamond)\u2010free graph, every (, house, bull)\u2010free graph, and every (, , co\u2010fork)\u2010free graph is recolorable. A graph is prime if it cannot be decomposed by modular decomposition except into single vertices. For a prime graph , we study the complexity of deciding if  is \u2010colorable and the complexity of deciding if there exists a path between two given \u2010colorings in . Suppose  is a hereditary class of graphs. We prove that if every blowup of every prime graph in  is recolorable, then every graph in  is recolorable.<\/jats:p>","DOI":"10.1002\/jgt.70005","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T12:43:20Z","timestamp":1771245800000},"page":"113-123","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recoloring via Modular Decomposition"],"prefix":"10.1002","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3153-2339","authenticated-orcid":false,"given":"Manoj","family":"Belavadi","sequence":"first","affiliation":[{"name":"Department of Mathematics Wilfrid Laurier University Waterloo Ontario Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0112-2494","authenticated-orcid":false,"given":"Kathie","family":"Cameron","sequence":"additional","affiliation":[{"name":"Department of Mathematics Wilfrid Laurier University Waterloo Ontario Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6562-4434","authenticated-orcid":false,"given":"Ni Luh Dewi","family":"Sintiari","sequence":"additional","affiliation":[{"name":"Department of Informatics Universitas Pendidikan Ganesha Bali Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2026,2,16]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.08.023"},{"key":"e_1_2_9_3_1","first-page":"182","volume-title":"Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA","author":"Cereceda L.","year":"2008"},{"key":"e_1_2_9_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.11.003"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9490-y"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103908"},{"key":"e_1_2_9_7_1","doi-asserted-by":"crossref","unstructured":"M.Belavadi \u201cRecoloring in Hereditary Graph Classes: Structure and Decomposition\u201d (Doctoral Diss. Wilfrid Laurier University 2024).","DOI":"10.1016\/j.dam.2024.10.026"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.10.010"},{"key":"e_1_2_9_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113108"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90036-A"},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00177-X"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111733"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2024.10.026"},{"key":"e_1_2_9_14_1","volume-title":"A Recursive Linear Time Modular Decomposition Algorithm via LexBFS","author":"Corneil D.","year":"2024"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22258"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83823-2_45"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112708"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00266-X"},{"key":"e_1_2_9_20_1","volume-title":"Seidel Complementation on (P5, House, Bull)\u2010Free Graphs","author":"Fouquet J. L.","year":"2010"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90539-6"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.70005","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.70005","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.70005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T13:45:09Z","timestamp":1772977509000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.70005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,16]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["10.1002\/jgt.70005"],"URL":"https:\/\/doi.org\/10.1002\/jgt.70005","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,16]]},"assertion":[{"value":"2024-11-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}