Back to Search
Start Over
The strong game colouring number of directed graphs
- Source :
-
Discrete Mathematics . May2013, Vol. 313 Issue 10, p1070-1077. 8p. - Publication Year :
- 2013
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 313
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 86156701
- Full Text :
- https://doi.org/10.1016/j.disc.2013.02.001