Vertex-distinguishing edge-colorings of 2-regular graphs Original Research Article

Aigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) ⩽ √8n + O(1) holds. Here it is shown that c(G) ⩽ √2n + O(1).