Document Type
Article
Publication Date
7-21-2026
Department
Mathematics, Statistics, and Computer Science
Keywords
edge-distinguishing chromatic number, games on graphs, mathematics
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.
Source Publication Title
Communications on Number Theory and Combinatorial Theory
Publisher
Communications on Number Theory and Combinatorial Theory
Volume
7
Issue
1
DOI
https://doi.org/10.70013/x3b8n1q6
Recommended Citation
Benjamin, N., Bentham, E., Burkel, C., Chesser, M. E., & Janssen, M. (2026). The Edge-Distinguishing Game. Communications on Number Theory and Combinatorial Theory, 7 (1) https://doi.org/https://doi.org/10.70013/x3b8n1q6
Comments
Published in Communications on Number Theory and Combinatorial Theory
The Edge-Distinguished Game