Every Hist-snark has a cycle double cover containing all outer cycles
Statement
Let a Hist-snark be a snark with a Hist, where a Hist is a spanning tree having only vertices of degree three and one, and the outer cycles are the vertex-disjoint cycles induced by the edges outside the Hist. A cycle double cover is a collection of cycles such that every edge is contained in exactly two cycles. Cycle double-cover conjecture for Hist-snarks. Every Hist-snark has a cycle double cover which contains all outer cycles. This is posed as an open problem about cycle double covers of snarks with special spanning trees; the source gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.