Regular colorings and factors of regular graphs

Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4

An $(r-1,1)$-coloring of an $r$-regular graph $G$ is an edge coloring such that each vertex is incident to $r-1$ edges of one color and $1$ edge of a different color. In this paper…