Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mota, Esdras"'
A connected ordering $(v_1, v_2, \ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\{v_1, \ldots, v_{i - 1}\}$ for every $i \in \{2, \ldots, n\}$. A connected greedy coloring (CGC for short) is a co
Externí odkaz:
http://arxiv.org/abs/1807.09034
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:572-584
