Shortest circuit covers of signed graphs

Abstract

A shortest circuit cover ${\cal F}$ of a bridgeless graph $G$ is a family of circuits that covers every edge of $G$ and is of minimum total length. The total length of a shortest circuit cover ${\cal F}$ of $G$ is denoted by $SCC(G)$. For ordinary graphs (graphs without sign), the subject of shortest circuit cover is closely related to some mainstream areas, such as, Tutte's integer flow theory, circuit double cover conjecture, Fulkerson conjecture, and others. For signed graphs $G$, it is proved recently by Máčajová, Raspaud, Rollová and Škoviera that $SCC(G) \leq 11|E|$ if $G$ is s-bridgeless, and $SCC(G) \leq 9|E|$ if $G$ is $2$-edge-connected. In this paper this result is improved as follows, $$SCC(G) ~ \leq ~ |E| + 3|V| +z$$ where $z ~=~ \min \{ \frac{2}{3}|E|+\frac{4}{3}ε_N-7,~ |V| + 2ε_N -8\}$ and $ε_N$ is the negativeness of $G$. The above upper bound can be further reduced if $G$ is $2$-edge-connected with even negativeness.