The strong game colouring number of directed graphs

Wai Hong Chan; Wai Chee SHIU; Pak Kiu SUN; Xuding Zhu

doi:10.1016/j.disc.2013.02.001

The strong game colouring number of directed graphs

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

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	1070-1077
Number of pages	8
Journal	Discrete Mathematics
Volume	313
Issue number	10
DOIs	https://doi.org/10.1016/j.disc.2013.02.001
Publication status	Published - 2013

Scopus Subject Areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

User-Defined Keywords

Colouring game
Digraph
Marking game
Partial 2-tree
Planar graph

Access to Document

10.1016/j.disc.2013.02.001

Cite this

@article{04bff80ffb3740d7bd01a8787e4d774a,

title = "The strong game colouring number of directed graphs",

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 = "Colouring game, Digraph, Marking game, Partial 2-tree, Planar graph",

author = "Chan, {Wai Hong} and SHIU, {Wai Chee} and SUN, {Pak Kiu} and Xuding Zhu",

note = "Funding Information: The first author was partially supported by Internal Research Grant R3297 , HKIEd . The fourth author was supported by Natural Science Foundation of China under Grant NSF11171310 and Natural Science foundation of Zhejiang Province under Grant Z6110786 . ",

year = "2013",

doi = "10.1016/j.disc.2013.02.001",

language = "English",

volume = "313",

pages = "1070--1077",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "10",

}

TY - JOUR

T1 - The strong game colouring number of directed graphs

AU - Chan, Wai Hong

AU - SHIU, Wai Chee

AU - SUN, Pak Kiu

AU - Zhu, Xuding

N1 - Funding Information: The first author was partially supported by Internal Research Grant R3297 , HKIEd . The fourth author was supported by Natural Science Foundation of China under Grant NSF11171310 and Natural Science foundation of Zhejiang Province under Grant Z6110786 .

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Colouring game

KW - Digraph

KW - Marking game

KW - Partial 2-tree

KW - Planar graph

UR - http://www.scopus.com/inward/record.url?scp=84874897352&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2013.02.001

DO - 10.1016/j.disc.2013.02.001

M3 - Article

AN - SCOPUS:84874897352

VL - 313

SP - 1070

EP - 1077

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 10

ER -

The strong game colouring number of directed graphs

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this