| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776910 | Discrete Mathematics | 2017 | 9 Pages |
Abstract
In this paper we study the neighbour-sum-distinguishing edge-colouring game on various classes of graphs. In particular, we prove that Bob wins the game on the complete graph Kn, nâ¥3, whoever starts the game, except when n=4. In that case, Bob wins the game on K4 if and only if Alice starts the game.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Olivier Baudon, Jakub PrzybyÅo, Mohammed Senhaji, Elżbieta Sidorowicz, Ãric Sopena, Mariusz Woźniak,