Berge's conjecture for cubic graphs with small colouring defect

Ján Karabáš, Edita Máčajová, Roman Nedela +1

A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3…