The strong game colouring number of directed graphs

Wai Hong Chan, Wai Chee SHIU, Pak Kiu SUN, Xuding Zhu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)1070-1077
Number of pages8
JournalDiscrete Mathematics
Volume313
Issue number10
DOIs
Publication statusPublished - 2013

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

User-Defined Keywords

  • Colouring game
  • Digraph
  • 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.

Cite this