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 $m$ edges can be covered b…