2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
Ján Karabáš, Edita Máčajová, Roman Nedela +1
We study two measures of uncolourability of cubic graphs, their colouring defect and perfect matching index. The colouring defect of a cubic graph G is the smallest number of edg…