Graph coloring reconfiguration systems (Prateek Bhakta, University of Richmond)
Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., ClaremontFor k >= 2, the k-coloring graph C(G) of a base graph G has a vertex set consisting of the proper k-colorings of G with edges connecting two vertices corresponding […]