Let \((G, \sigma )\) be a 2-edge-connected flow-admissible signed graph. In this paper, we prove that \((G,\sigma )\) has a signed circuit cover with length at most 3|E(G)|.

中文翻译：

---

无桥签名图的签名电路封面

令\（（（G，\ sigma）\））是2边连接的流量允许符号图。在本文中，我们证明\（（G，\ sigma）\）的带符号电路盖的长度最大为3 |。E（G）|。