Reconfiguring k-colourings of Complete Bipartite Graphs |
Celaya, Marcel
(School of Mathematics, Georgia Tech)
Choo, Kelly (Mathematics and Statistics, University of Victoria) MacGillivray, Gary (Mathematics and Statistics, University of Victoria) Seyffarth, Karen (Mathematics and Statistics, University of Calgary) |
1 | L. Cereceda, J. van den Heuvel and M. Johnson, Mixing 3-colourings in bipartite graphs, European J. Combin., 30(2009), 1593-1606. DOI |
2 | L. Cereceda, J. van den Heuvel and M. Johnson, Finding Paths Between 3-Colorings, J. Graph Theory, 67(2011), 69-82. DOI |
3 | K. Choo and G. MacGillivray, Gray code numbers for graphs, Ars Math. Contemp., 4(2011), 125-139. |
4 | M. Dyer, A. Flaxman, A. Frieze and E. Vigoda, Randomly coloring sparse random graphs with fewer colors than the maximum degree, Random Structures Algorithms, 29(2006), 450-465. DOI |
5 | S. Finbow and G. MacGillivray, Hamiltonicity of Bell and Stirling Colour Graphs, manuscript 2014. |
6 | R. Haas, The canonical coloring graph of trees and cycles, Ars Math. Contemp., 5(2012), 149-157. |
7 | T. Ito, K. Kawamura, H. Ono, and X. Zhou, Reconfiguration of list L(2, 1)- labelings in a graph, Theoretical Computer Science, 9702(2014), DOI: 10.1016/j.tcs.2014.04.011. DOI |
8 | M. Jerrum, A very simple algorithm for estimating the number of k-colorings of a low-degree graph, Random Structures Algorithms, 7(1995), 157-165. DOI |
9 | B. Lucier and M. Molloy, The Glauber dynamics for colorings of bounded degree trees, SIAM J. Disc. Math., 25(2011), 827-853. DOI |
10 | C. Savage and P. Winkler, Montone Gray codes and the middle levels problem, J. Combin. Theory Ser. A, 70(1995), 230-248. DOI |
11 | L. Cereceda, J. van den Heuvel and M. Johnson, Connectedness of the graph of vertex colourings, Discrete Math., 308(2008), 913-919. DOI |
12 | S. Bard, Colour graphs of complete multipartite graphs, M.Sc. Thesis, University of Victoria, Victoria, BC, Canada, 2014. |
13 | J. A. Bondy and U. S. R. Murty, Graph Theory, GTM 224, Springer, Berlin, 2008. |
14 | P. Bonsma and L. Cereceda, Finding paths between graph colourings: PSPACEcompleteness and superpolynomial distances, Theoretical Computer Science, 410(2009), 5215-5226. DOI |