Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.21185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912558704754688 |
|---|---|
| author | Benjamin, Nathaniel Benthem, Elisa Burkel, Cooper Chesser, Marissa Janssen, Mike |
| author_facet | Benjamin, Nathaniel Benthem, Elisa Burkel, Cooper Chesser, Marissa Janssen, Mike |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_21185 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Edge-Distinguishing Game Benjamin, Nathaniel Benthem, Elisa Burkel, Cooper Chesser, Marissa Janssen, Mike Combinatorics 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. |
| title | The Edge-Distinguishing Game |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2508.21185 |