4 citations · 5 across the 3 of their papers we have counts for
1 paper · 2 filters
Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6
Let c:E(G)→[k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let cˉ(v)=(a1,…,ak), where ai is the number of edges incident…