1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Ján Karabáš, Edita Máčajová, Roman Nedela +1
The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While 3-edge-colourable graphs have defect 0, those…