Simon MacLean

collaborators

3 papers

math.CO2026

Extremal diameters of 3-coloring graphs of trees

Shamil Asgarli, Sara Krehbiel, Simon MacLean +1

Given a tree $T$ , its 3-coloring graph $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…

math.CO2025

Bell coloring graphs: realizability and reconstruction

Shamil Asgarli, Sara Krehbiel, Simon MacLean

Given a graph $G$ , the Bell $k$ -coloring graph $B_{k} (G)$ has vertices given by partitions of $V (G)$ into $k$ independent sets (allowing empty parts), with two partitions a…

math.CO2025

Counting subgraphs of coloring graphs using shadow graphs

Simon MacLean

Given a graph $G$ , the $k$ -coloring graph $C_{k} (G)$ is constructed by selecting proper $k$ -colorings of $G$ as vertices, with an edge between two colorings if they differ…