  A signed circuit cover of a signed graph is a natural analog of a circuit
cover of a graph, and is equivalent to a covering of its corresponding
signed-graphic matroid with circuits. It was conjectured that a signed graph
whose signed-graphic matroid has no coloops has a 6-cover. In this paper, we
prove that the conjecture holds for signed Eulerian graphs.
