The Edge-Distinguishing Game

Authors

• Nathaniel Benjamin, Dordt UniversityFollow
• Elisa Benthem, Dordt UniversityFollow
• Cooper Burkel, Dordt UniversityFollow
• Marissa E. Chesser, Dordt UniversityFollow
• Mike Janssen, Dordt CollegeFollow

Abstract

In this paper, we introduce a graph coloring game called the Edge-Distinguishing Game (EDGe). The edge-distinguishing chromatic number of a graph is used to determine the moves each player can make. We determine which player has a winning strategy for particular graphs and graph families. Additionally, utilizing principles from game theory as well as previous work on a computational solution for the Game of Cycles.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.

Recommended Citation

Benjamin, Nathaniel; Benthem, Elisa; Burkel, Cooper; Chesser, Marissa E.; and Janssen, Mike (2026) "The Edge-Distinguishing Game," Communications on Number Theory and Combinatorial Theory: Vol. 7, Article 1.
Available at: https://research.library.kutztown.edu/contact/vol7/iss1/1