Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Schreyer Jens"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 635-643 (2018)
A sequence is called non-repetitive if none of its subsequences forms a repetition (a sequence r1r2⋯r2n such that ri = rn+i for all 1 ≤ i ≤ n). Let G be a graph whose vertices are coloured. A colouring ϕ of the graph G is non-repetitive if the
Externí odkaz:
https://doaj.org/article/3fa65af1e8c342d189f1cf5a96b88d48
A sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_1,r_2,\dots,r_{2n}$ such that $r_i=r_{n+i}$ for all $1\leq i \leq n$). Let $G$ be a graph whose vertices are coloured. A colouring $\varphi$ of the graph
Externí odkaz:
http://arxiv.org/abs/1409.5154
Autor:
Schreyer, Jens, Škrabuľáková, Erika
Publikováno v:
European Journal of Mathematics, Volume 1, Issue 1, March 2015, pp. 186-197
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 endvertex coloured $c$ too. A weak total Thue colouring of a graph $G$ i
Externí odkaz:
http://arxiv.org/abs/1309.3164
Let $G$ be a plane graph. A vertex-colouring $\varphi$ of $G$ is called {\em facial non-repetitive} if for no sequence $r_1 r_2 \dots r_{2n}$, $n\geq 1$, of consecutive vertex colours of any facial path it holds $r_i=r_{n+i}$ for all $i=1,2,\dots,n$.
Externí odkaz:
http://arxiv.org/abs/1308.5128
Autor:
Schreyer, Jens, Škrabul’áková, Erika
Publikováno v:
In Discrete Mathematics 28 May 2012 312(10):1713-1721
Publikováno v:
In Discrete Mathematics 2007 307(11):1538-1544
Publikováno v:
In Theoretical Computer Science 2005 349(1):92-98
Autor:
Przybyło, Jakub1 jakubprz@agh.edu.pl, Schreyer, Jens2 jens.schreyer@tu-ilmenau.de, Škrabul'áková, Erika3 erika.skrabulakova@tuke.sk
Publikováno v:
Graphs & Combinatorics. May2016, Vol. 32 Issue 3, p1137-1153. 17p.
Autor:
Schreyer, Jens, Walther, Hansjoachim
Publikováno v:
In Discrete Applied Mathematics 2004 136(2):315-327