The Edge-Distinguishing Game
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.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Scheduling and Timetabling Solutions
Publication details
- Journal / source
- Communications on number theory and combinatorial theory.
- Volume
- 7
- Issue
- 1
- Pages
- 1–21
- Publication date
- 1 January 2026
- Language
- EN