Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

The strong game colouring number of directed graphs

Language

English

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. © 2013 Elsevier B.V. All rights reserved.

Keywords

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

Publication Date

2013

Source Publication Title

Discrete Mathematics

Volume

313

Issue

10

Start Page

1070

End Page

1077

Publisher

Elsevier

DOI

10.1016/j.disc.2013.02.001

Link to Publisher's Edition

http://dx.doi.org/10.1016/j.disc.2013.02.001

ISSN (print)

0012365X

This document is currently not available here.

Share

COinS