Signed Cycle Double Covers

  • Lingsheng Shi
  • Zhang Zhang
Keywords: Cycle cover, Even graph, Flow, Signed graph


The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together cover every edge of the graph exactly twice. A signed graph is a graph with each edge assigned by a positive or a negative sign. In this article, we prove a weak version of this conjecture that is the existence of a signed cycle double cover for all bridgeless graphs. We also show the relationships of the signed cycle double cover and other famous conjectures such as the Tutte flow conjectures and the shortest cycle cover conjecture etc.

Article Number