Game colouring directed graphs.
Yang, Daqing, Zhu, Xuding (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Game chromatic number of Cartesian product graphs.”
Game colouring directed graphs.
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the oriented game chromatic number.
Nešetřil, J., Sopena, E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vertex deletion games with parity rules.
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Similarity:
Note On The Game Colouring Number Of Powers Of Graphs
Stephan Dominique Andres, Andrea Theuser (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.
.
Pralat, Pawel (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cutthroat, an all-small game on graphs.
McCurdy, Sarah K., Nowakowski, Richard J. (2005)
Integers
Similarity:
Carrying umbrellas: An online relocation game on a graph.
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
The first player wins the one-colour triangle avoidance game on 16 vertices
Przemysław Gordinowicz, Paweł Prałat (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity:
Permissive strategies : from parity games to safety games
Julien Bernet, David Janin, Igor Walukiewicz (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Colouring game and generalized colouring game on graphs with cut-vertices
Elżbieta Sidorowicz (2010)
Discussiones Mathematicae Graph Theory
Similarity:
For k ≥ 2 we define a class of graphs 𝓗 ₖ = {G: every block of G has at most k vertices}. The class 𝓗 ₖ contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from 𝓗 ₖ.