3 papers
math.CO2024
Strictly critical snarks with girth or cyclic connectivity equal to 6
Ján Mazák, Jozef Rajník, Martin Škoviera
A snark -- connected cubic graph with chromatic index -- is critical if the graph resulting from the removal of any pair of distinct adjacent vertices is -edge-colourable; i…
math.CO2023
On -dimensional nowhere-zero -flows on a graph
Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1
A -dimensional nowhere-zero -flow on a graph , an -NZF from now on, is a flow where the value on each edge is an element of whose (Euclidean) norm li…
math.CO2023
A lower bound for the complex flow number of a graph: a geometric approach
Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1
Let be a real number. A complex nowhere-zero -flow on a graph is an orientation of together with an assignment such that, for all…