ECOPRO

We introduce an odd coloring of a graph, which was introduced very recently, motivated by parity type colorings of graphs. A proper vertex coloring of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$ there exists a color $c$ such that $c$ is used an odd number of …