Other Mathematics Commons^™

On The Equitable Total (𝑘+1)-Coloring Of 𝑘-Regular Graphs, Bryson Stemock

Rose-Hulman Undergraduate Mathematics Journal

A graph is considered to be totally colored when one color is assigned to each vertex and to each edge so that no adjacent or incident vertices or edges bear the same color. The \textit{total chromatic number} of a graph is the least number of colors required to totally color a graph. This paper focuses on $k$-regular graphs, whose symmetry and regularity allow for a closer look at general total coloring strategies. Such graphs include the previously defined M\"obius ladder, which has a total chromatic number of 5, as well as the newly defined bird's nest, which is shown to …