Showing math.COShow all
2 papers · 1 filter
math.CO2024
An 8-flow theorem for signed graphs
Rong Luo, Edita Máčajová, Martin Škoviera +1
We prove that a signed graph admits a nowhere-zero -flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero -flow. When combined with the 4-co…
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…