Title of article
The strong game colouring number of directed graphs
Author/Authors
Chan، نويسنده , , Wai Hong and Shiu، نويسنده , , Wai Chee and Sun، نويسنده , , Pak Kiu and Zhu، نويسنده , , Xuding، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
8
From page
1070
To page
1077
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
Partial 2-tree , marking game , Planar graph , Digraph , Colouring game
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600306
Link To Document