Szczegóły publikacji
Opis bibliograficzny
The neighbour-sum-distinguishing edge-colouring game / Olivier Baudon, Jakub PRZYBYŁO, Mohammed Senhaji, Elżbieta Sidorowicz, Éric Sopena, Mariusz WOŹNIAK // Discrete Mathematics ; ISSN 0012-365X. — 2017 — vol. 340 iss. 7, s. 1564–1572. — Bibliogr. s. 1572, Abstr. — Publikacja dostępna online od: 2017-03-22
Autorzy (6)
- Baudon Olivier
- AGHPrzybyło Jakub
- Senhaji Mohammed
- Sidorowicz Elżbieta
- Sopena Éric
- AGHWoźniak Mariusz
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 109372 |
|---|---|
| Data dodania do BaDAP | 2017-10-19 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.disc.2017.02.019 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics |
Abstract
Let gamma : E(G) -> N* = N \ {0} be an edge colouring of a graph G and sigma(gamma) : V(G) -> N* the vertex colouring given by sigma(gamma)(v) = Sigma(e(sic)v)gamma(e) for every v is an element of V(G). A neighbour-sum-distinguishing edge-colouring of G is an edge colouring gamma such that for every edge uv in G, sigma(gamma)(u) not equal sigma(gamma)(v). The neighbour-sum-distinguishing edge-colouring game on G is the 2-player game defined as follows. The two players, Alice and Bob, alternately colour an uncoloured edge of G. Alice wins the game if, when all edges are coloured, the so-obtained edge colouring is a neighbour-sum-distinguishing edge-colouring of G. Otherwise, Bob wins. n 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 K-n, n >= 3, whoever starts the game, except when n = 4. In that case, Bob wins the game on K-4 if and only if Alice starts the game.
