Packing circuits in Eulerian digraphs

Let G be an eulerian digraph; let ν(G) be the maximum number of pairwise edge-disjoint directed circuits of G, and τ(G) the smallest size of a set of edges that meets all directed circuits of G. Borobia, Nutov and Penn showed that ν(G) need not be equal to τ(G). We show that ν(G) = τ(G) provided that G has a "linkless" embedding in 3-space, or equivalently, if no minor of G can be converted to K₆ by Δ - Y and Y - Δ operations.