Extremal diameters of 3-coloring graphs of trees

Shamil Asgarli, Sara Krehbiel, Simon MacLean +1

Given a tree $T$, its 3-coloring graph ${\mathcal{C}}_3(T)$ has as vertices the proper 3-colorings of $T$, with edges joining colorings that differ at exactly one vertex. We call the…