The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “ R ( 3 , 4 ) = 17 .”

On-line Ramsey theory.

Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Game list colouring of graphs.

Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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 𝓗 ₖ.

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.