A note on shortest circuit cover of 3-edge colorable cubic signed graphs

Abstract

A {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G,\sigma )$ is a family of sign-circuits which covers all edges of $(G,\sigma )$. The shortest sign-circuit cover problem was initiated by Má$\check{\text{c}}$ajová, Raspaud, Rollová, and Škoviera (JGT 2016) and received many attentions in recent years. In this paper, we show that every flow-admissible 3-edge colorable cubic signed graph $(G,\sigma )$ has a sign-circuit cover with length at most $\frac{20}{9}|E(G)|$.

12 pages, 4 figures