67 citations · 244 across the 17 of their papers we have counts for
5 papers · 1 filter
Nonrepetitive Colouring via Entropy Compression
Vida Dujmović, Gwenaël Joret, Jakub Kozik +1
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path whose first half receives the same sequence of colours as the second half. A graph is nonrepetitively -…
Towards on-line Ohba's conjecture
Jakub Kozik, Piotr Micek, Xuding Zhu
The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is stric…
Nonrepetitive games
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
(Note. The results of this manuscript has been merged and published with another paper of the same authors: A new approach to nonrepetitve sequences.) A repetition of size ($h\…
A new approach to nonrepetitive sequences
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long…
Nonrepetitive sequences on arithmetic progressions
Jarosław Grytczuk, Jakub Kozik, Marcin Witkowski
A sequence is \emph{nonrepetitive} if no two adjacent blocks of are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequenc…