Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\dots ,a_k)$, where $a_i$ is the number of edges incident…