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

Research output: Contribution to journalArticle

25 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)121-129
Number of pages9
JournalGraphs and Combinatorics
Volume19
Issue number1
DOIs
StatePublished - 2003

Fingerprint

Game Chromatic number
Partial K-tree
Game

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Marking games and the oriented game chromatic number of partial k-trees. / Kierstead, Henry; Tuza, Zs.

In: Graphs and Combinatorics, Vol. 19, No. 1, 2003, p. 121-129.

Research output: Contribution to journalArticle

@article{d3bb915cf02543b4935ecaef2b6eb7b8,
title = "Marking games and the oriented game chromatic number of partial k-trees",
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.",
author = "Henry Kierstead and Zs Tuza",
year = "2003",
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

Y1 - 2003

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

VL - 19

SP - 121

EP - 129

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -