Scholarly Works - Preprints
Preprint
·
December 10, 2025
Given a graph $G$, the Bell $k$-coloring graph $\mathcal{B}_k(G)$ has vertices given by partitions of $V(G)$ into $k$ independent sets (allowing empty parts), with two partitions adjacent if they differ only in the placement of a single vertex. We first gi ...
Link to item
Cite
Preprint
·
December 3, 2025
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 diameter of $\mathcal{C}_3(T)$ the 3-coloring diameter of $T$. We introduce ...
Link to item
Cite
