Variations on the Petersen colouring conjecture

Abstract : The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with 5 colours such that for every edge e, the set of colours assigned to the edges adjacent to e has cardinality either 2 or 4 but not 3. We prove that every bridgeless cubic graph G admits an edge-colouring with 4 such that at most 4 |V(G)| / 5 edges do not satisfy the above condition. This bound is tight and the Petersen graph is the only connected graph for which the bound cannot be decreased. We obtain such a 4-edge-colouring by using a carefully chosen subset of edges of a perfect matching, and the analysis relies on a simple discharging procedure with essentially no reductions and very few rules.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Jean-Sébastien Sereni <>
Submitted on : Monday, May 20, 2019 - 8:49:33 AM
Last modification on : Friday, June 7, 2019 - 11:27:29 AM


Files produced by the author(s)


  • HAL Id : hal-02133840, version 1



François Pirot, Jean-Sébastien Sereni, Riste Škrekovski. Variations on the Petersen colouring conjecture. 2018. ⟨hal-02133840⟩



Record views


Files downloads