Odd edge-colorings of subdivisions of odd graphs

Mirko Petruševski, Riste Škrekovski

An odd graph is a finite graph all of whose vertices have odd degrees. Given graph $G$ is decomposable into $k$ odd subgraphs if its edge set can be partitioned into $k$ subsets ea…