2 papers
math.CO2023
Distinguishing chromatic number of Hamiltonian circulant graphs
Michael D. Barrus, Jean Guillaume, Benjamin Lantz
The distinguishing chromatic number of a graph is the smallest number of colors needed to properly color the vertices of so that the trivial automorphism is the only symmet…
math.CO2019
Graphs in which the Maxine heuristic produces a maximum independent set
Benjamin Lantz
The residue of a graph is the number of zeros left after iteratively applying the Havel-Hakimi algorithm to its degree sequence. Favaron, Mahéo, and Saclé showed that the residue i…