The strong game colouring number of directed graphs

Wai Hong CHAN, Wai Chee SHIU, Pak Kiu SUN, Xuding ZHU

Research output: Contribution to journalArticles

3 Citations (Scopus)

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 © 2013 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)1070-1077
JournalDiscrete Mathematics
Volume313
Issue number10
Early online dateMar 2013
DOIs
Publication statusPublished - May 2013

Citation

Chan, W. H., Shiu, W. C., Sun, P. K., & Zhu, X. D. (2013). The strong game colouring number of directed graphs. Discrete Mathematics, 313(10), 1070-1077.

Keywords

  • Digraph
  • Colouring game
  • Marking game
  • Partial 2-tree
  • Planar graph

Fingerprint Dive into the research topics of 'The strong game colouring number of directed graphs'. Together they form a unique fingerprint.