| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647764 | Discrete Mathematics | 2013 | 8 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wai Hong Chan, Wai Chee Shiu, Pak Kiu Sun, Xuding Zhu,