Kaleidoscopic Colorings of Graphs
For an r-regular graph G, let c : E(G) → [k] = {1, 2, . . . , k}, k ≥ 3, be an edge coloring of G, where every vertex of G is incident with at least one edge of each color. For a vertex v of G, the multiset-color cm(v) of v is defined as the ordered k-tuple (a1, a2, . . . , ak) or a1a2 … ak, where a...
| Главные авторы: | , , |
|---|---|
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
University of Zielona Góra
2017-08-01
|
| Серии: | Discussiones Mathematicae Graph Theory |
| Предметы: | |
| Online-ссылка: | https://doi.org/10.7151/dmgt.1950 |