11 citations · 23 across the 21 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Cubic graphs with colouring defect 3
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 -edge-colourable graphs have defect , those…
math.CO2023
Decycling cubic graphs
Roman Nedela, Michaela Seifrtová, Martin Škoviera
A set of vertices of a graph is said to be decycling if its removal leaves an acyclic subgraph. The size of a smallest decycling set is the decycling number of . Generally,…