Marking games and the oriented game chromatic number of partial k-trees

Henry Kierstead; Zs Tuza

doi:10.1007/s00373-002-0489-5

Marking games and the oriented game chromatic number of partial k-trees

Henry Kierstead, Zs Tuza

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

Nešetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.

Original language	English (US)
Pages (from-to)	121-129
Number of pages	9
Journal	Graphs and Combinatorics
Volume	19
Issue number	1
DOIs	https://doi.org/10.1007/s00373-002-0489-5
State	Published - Jul 1 2003

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00373-002-0489-5

Cite this

@article{d3bb915cf02543b4935ecaef2b6eb7b8,

title = "Marking games and the oriented game chromatic number of partial k-trees",

abstract = "Ne{\v s}et{\v r}il and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.",

author = "Henry Kierstead and Zs Tuza",

year = "2003",

month = jul,

day = "1",

doi = "10.1007/s00373-002-0489-5",

language = "English (US)",

volume = "19",

pages = "121--129",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - Marking games and the oriented game chromatic number of partial k-trees

AU - Kierstead, Henry

AU - Tuza, Zs

PY - 2003/7/1

Y1 - 2003/7/1

N2 - Nešetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.

AB - Nešetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.

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

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

U2 - 10.1007/s00373-002-0489-5

DO - 10.1007/s00373-002-0489-5

M3 - Article

AN - SCOPUS:0038576886

SN - 0911-0119

VL - 19

SP - 121

EP - 129

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Marking games and the oriented game chromatic number of partial k-trees

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this