Kaleidoscopic colorings of graphs
Gary Chartrand, Sean E. English, Ping Zhang · Discussiones Mathematicae Graph Theory · 2017
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