Oct 6, 2023
Contact: Gexin Yu
Summary
{{https://www.people.vcu.edu/~dcranston/, Dan Cranston}} (VCU)
Full Description
Title: An Analogue of Mohar’s Conjecture for List-Coloring
Abstract: Bonamy et. al recently confirmed a conjecture of Mohar about using Kempe swaps to move between all different k-colorings of a k-regular graph. We extend this result to list-coloring, where each vertex gets k allowable colors, but the colors allowable at distinct vertices may differ. (This is joint work with Reem Mahmoud.)