Abstract
For a graph G, the k-recolouring graph Rk(G) is the graph whose vertices are the k-colourings of G and two colourings are joined by an edge if they differ in colour on exactly one vertex. We prove that for all n≥1, there exists a k-colourable weakly chordal graph G where Rk+n(G) is disconnected, answering an open question of Feghali and Fiala. We also show that for every k-colourable 3K1-free graph G, Rk+1(G) is connected with diameter at most 4|V(G)|.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
