Reconfiguring k-colourings of Complete Bipartite Graphs

DOI10.5666/KMJ.2016.56.3.647zbMath1372.05066OpenAlexW2553645248MaRDI QIDQ5360763

Gary MacGillivray, Kelly Choo, Karen Seyffarth, Marcel Celaya

Publication date: 26 September 2017

Published in: Kyungpook mathematical journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5666/kmj.2016.56.3.647

zbMATH Keywords

graph colouringHamilton cyclesGray codesreconfiguration problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Reconfiguration graphs for dominating sets ⋮ Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs ⋮ Introduction to reconfiguration ⋮ Hamilton paths in dominating graphs of trees and cycles

This page was built for publication: Reconfiguring k-colourings of Complete Bipartite Graphs