The Petersen Coloring Conjecture in terms of normal chromatic index
Let be a bridgeless cubic graph. A normal edge coloring of is a proper edge coloring in which every edge is poor or rich, and let be the smallest number of colors in such a coloring.
Petersen Coloring Conjecture.
This is a restatement of the Petersen Coloring Conjecture for bridgeless cubic graphs. The supplied text does not state whether the conjecture has been resolved.
References
2 papers in this index state this conjecture (2006–2023). The statement above is taken from the most recent of them; the others are arXiv:math/0701016.
Source: Jelena Sedlar and Riste Škrekovski, “Normal 5-edge coloring of some more snarks superpositioned by the Petersen graph”, arXiv:2312.08739 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.