Abstract
In this paper, we study the strong game colouring number of directed graphs. It is proved that every oriented partial 2-tree has strong game colouring number at most 7 and every oriented planar graph has strong game colouring number at most 15.
Original language | English |
---|---|
Pages (from-to) | 1070-1077 |
Number of pages | 8 |
Journal | Discrete Mathematics |
Volume | 313 |
Issue number | 10 |
DOIs | |
Publication status | Published - 28 May 2013 |
Scopus Subject Areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
User-Defined Keywords
- Colouring game
- Digraph
- Marking game
- Partial 2-tree
- Planar graph