Shortest circuit covers of signed graphs

Jian Cheng, You Lu, Rong Luo +1

A shortest circuit cover $\mathcal{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 c…