Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mkhitaryan, Sargis T."'
A proper edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an \emph{interval cyclic $t$-coloring} if all colors are used, and the edges incident to each vertex $v\in V(G)$ are colored by $d_{G}(v)$ consecutive colors modulo $t$, where $
Externí odkaz:
http://arxiv.org/abs/1411.0290
