Marking games and the oriented game chromatic number of partial \(k\)-trees (Q1396657): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q200923 / rank | |||
Property / author | |||
Property / author: Zsolt Tuza / rank | |||
Property / author | |||
Property / author: Henry A. Kierstead / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Zsolt Tuza / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00373-002-0489-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2041300188 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:55, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Marking games and the oriented game chromatic number of partial \(k\)-trees |
scientific article |
Statements
Marking games and the oriented game chromatic number of partial \(k\)-trees (English)
0 references
8 July 2003
0 references
The oriented graph coloring game was introduced by \textit{J. Nešetřil} and \textit{E. Sopena} [Electron. J. Comb. 8, Research Paper R14 (2001; Zbl 0982.05049)] as follows: Given an oriented graph \(G=(V,A)\) and a tournament \(T = (C,D)\), two players alternately color vertices of \(G\) with colors from the set \(C\) such that, if \(v \in V\) is to be colored \(\alpha\) and \(w \in V\) has already been colored \(\beta\), then \(vw \in A\) implies \(\alpha\beta \in D\) and \(wv \in A\) implies \(\beta\alpha \in D\); in addition, every directed path of length two must have its endpoints differently colored. The first player wins if, after the game ends, all vertices are colored; the second playes wins if, during the game, some vertices cannot be colored. The oriented game chromatic number of \(G\) is the least \(t\) for which there exists a tournament \(T\) on \(t\) vertices such that the first player has a winning strategy. In this paper, the authors prove that, for fixed integer \(k\), there exists a constant upper bound on the oriented game chromatic number of any partial \(k\)-tree.
0 references
oriented game chromatic number
0 references
partial tree
0 references
marking game
0 references