12 citations · 41 across the 15 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Cubic graphs that cannot be covered with four perfect matchings
Edita Máčajová, Martin Škoviera
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the…
math.CO2020★ 3 cited
Some snarks are worse than others
Edita Máčajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan +1
Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problem…