Normal edge‐colorings of cubic graphs

A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors having the additional property that when looking at the set of colors assigned to any edge $e$ and the four edges adjacent it, we have either exactly five distinct colors or exactly three distinct colors. We denote by $\chi'_{N}(G)$ the smallest $k$, for which $G$ admits a normal $k$-edge-coloring. Normal $k$-edge-colorings were introduced by Jaeger in order to study his well-known Petersen Coloring Conjecture. More precisely, it is known that proving $\chi'_{N}(G)\leq 5$ for every bridgeless cubic graph is equivalent to proving Petersen Coloring Conjecture and then, among others, Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture. Considering the larger class of all simple cubic graphs (not necessarily bridgeless), some interesting questions naturally arise. For instance, there exist simple cubic graphs, not bridgeless, with $\chi'_{N}(G)=7$. On the other hand, the known best general upper bound for $\chi'_{N}(G)$ was $9$. Here, we improve it by proving that $\chi'_{N}(G)\leq7$ for any simple cubic graph $G$, which is best possible. We obtain this result by proving the existence of specific no-where zero $\mathbb{Z}_2^2$-flows in $4$-edge-connected graphs.

[1]  Eckhard Steffen,et al.  Petersen-colorings and some families of snarks , 2014, Ars Math. Contemp..

[2]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[3]  Jean-Sébastien Sereni,et al.  Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs , 2010, Canadian Journal of Mathematics.

[4]  Giuseppe Mazzuoccolo,et al.  Normal 6-edge-colorings of some bridgeless cubic graphs , 2020, Discret. Appl. Math..

[5]  F. Jaeger,et al.  Flows and generalized coloring theorems in graphs , 1979, J. Comb. Theory, Ser. B.

[6]  Fred C. Holroyd,et al.  Colouring of cubic graphs by Steiner triple systems , 2004, J. Comb. Theory, Ser. B.

[7]  Riste Skrekovski,et al.  Variations on the Petersen Colouring Conjecture , 2020, Electron. J. Comb..

[8]  Lars Døvling Anderson The strong chromatic index of a cubic graph is at most 10 , 1992 .

[9]  Vahan V. Mkrtchyan,et al.  A remark on the Petersen coloring conjecture of Jaeger , 2012, Australas. J Comb..

[10]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[11]  P. D. Seymour,et al.  On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte , 1979 .

[12]  Cun-Quan Zhang Integer Flows and Cycle Covers of Graphs , 1997 .

[13]  Nathan Linial,et al.  Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.

[14]  Hana Bílková,et al.  Petersenovské obarvení a jeho varianty , 2012 .

[15]  Robert Sámal New approach to Petersen coloring , 2011, Electron. Notes Discret. Math..

[16]  Myriam Preissmann Sur les colorations des arêtes des graphes cubiques. (On colors of cubic graph ridges) , 1981 .