On Graph Odd Edge-Colorings and Odd Edge-Coverings

Xiao-Chuan Liu, Mirko Petruševski, Xu Yang

An odd $k$-edge-coloring of a graph $G$ is a (not necessarily proper) edge-coloring with at most $k$ colors such that each non-empty color class induces a graph in which every vert…