10 citations · 48 across the 31 of their papers we have counts for
1 paper · 1 filter
Carl Johan Casselgren, Petros A. Petrosyan
A k-improper edge coloring of a graph G is a mapping α:E(G)⟶N such that at most k edges of G with a common endpoint have the same color. An improp…