Partially normal 5-edge-colorings of cubic graphs (Q2033935)

The authors consider a very important problem of normal colorings of cubic graphs. The problem is connected with the very well-known conjecture that every cubic bridgeless graph has normal 5-coloring. In turn, this hypothesis is related with other well-known conjectures. That is why the results presented in the paper are very valuable. The authors establish a lower bound for the number of so named normal edges in partially normal 5-edge-coloring of every bridgeless cubic graph.