Search
Abstract
In the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic one, are related: our new parameter is an upper bound for the game chromatic number.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (4)
-
Krzysztof Turowski dr inż.
- Uniwersytet Jagielloński
Cite as
Full text
download paper
downloaded 1 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2021.11.020
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
DISCRETE APPLIED MATHEMATICS
no. 309,
pages 138 - 146,
ISSN: 0166-218X - Language:
- English
- Publication year:
- 2022
- Bibliographic description:
- Janczewski R., Obszarski P., Turowski K., Wróblewski B.: Infinite chromatic games// DISCRETE APPLIED MATHEMATICS -Vol. 309, (2022), s.138-146
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2021.11.020
- Verified by:
- Gdańsk University of Technology
seen 116 times
Recommended for you
Minimum order of graphs with given coloring parameters
- G. Bacsó,
- P. Borowiecki,
- M. Hujter
- + 1 authors
2015