A note on weak odd edge-colorings of graphs (Q266706)

An edge-coloring of a graph \(G\) is said to be a weak-odd edge coloring if each non-isolated vertex of \(G\) uses at least one color odd number of times on its incident edges. The weak-odd chromatic \(\xi^\prime_{\mathrm{wo}}(G)\) is the minimum number of colors needed for a weak-odd edge-coloring of \(G\). In this paper, author characterizes all connected graphs according to the value of their weak-odd chromatic index.