12 citations · 41 across the 15 of their papers we have counts for
3 papers · 1 filter
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
Jan Goedgebeur, Edita Máčajová, Martin Škoviera
The family of snarks -- connected bridgeless cubic graphs that cannot be 3-edge-coloured -- is well-known as a potential source of counterexamples to several important and long-sta…
Critical and flow-critical snarks coincide
Edita Máčajová, Martin Škoviera
Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of sna…
Shorter signed circuit covers of graphs
Tomáš Kaiser, Robert Lukot'ka, Edita Máčajová +1
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on edges can be covered b…