Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Joseph Feffer"'
A Gallai coloring of a complete graph $K_n$ is an edge coloring without triangles colored with three different colors. A sequence $e_1\ge \dots \ge e_k$ of positive integers is an $(n,k)$-sequence if $\sum_{i=1}^k e_i=\binom{n}{2}$. An $(n,k)$-sequen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f462a49d0a3de89df0e21b2ad7176cf8
Publikováno v:
Journal of Vision. 17:86
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::692b19864a33e5755db38e7ccf55c3d6
https://doi.org/10.1167/17.10.86
https://doi.org/10.1167/17.10.86
