32 citations · 63 across the 14 of their papers we have counts for
1 paper · 1 filter
Varsha Dani, Cristopher Moore, Anna Olson
If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,…