Odd Edge Colorings of Graphs with Odd Order

Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki

An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph $G$ is said to be {\em odd $k$-edge-colorable} if there exists an edge-coloring $E(G) \…