Jens Schreyer

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

3 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014★ 2 cited

A note on the Thue chromatic number of lexicographic products of graphs

Iztok Peterin, Jens Schreyer, Erika Škrabuľáková +1

A sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_{1}, r_{2}, \dots, r_{2 n}$ such that $r_{i} = r_{n + i}$ for all $1 \leq i \leq n$ ). Let $G$ be a…

math.CO2013

Total Thue colourings of graphs

Jens Schreyer, Erika Škrabuľáková

A total colouring of a graph is a colouring of its vertices and edges such that no two adjacent vertices or edges have the same colour and moreover, no edge coloured $c$ has its en…

math.CO2013★ 3 cited

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 $φ$ of $G$ is called {\em facial non-repetitive} if for no sequence $r_{1} r_{2} \dots r_{2 n}$ , $n \geq 1$ , of consecutive vertex colours of…