On the facial Thue choice number of plane graphs via entropy compression method

Jakub Przybyło, Jens Schreyer, Erika Škrabuľáková

Let $G$ be a plane graph. A vertex-colouring $\phi$ of $G$ is called {\em facial non-repetitive} if for no sequence $r_1{r}_2\dots r_{2n}$, $n\ge 1$, of consecutive vertex colours of…