Circle graphs and the cycle double cover conjecture

AbstractThe long standing Cycle Double Cover Conjecture states that every bridgeless graph can be covered by a family of cycles such that every edge is covered exactly twice. Intimately related is the problem of finding, in an eulerian graph, a circuit decomposition compatible with a given transition system (transition systems are also known as decompositions into closed paths). One approach that seems promising consists in finding a black anticlique in the corresponding Sabidussi orbit of bicolored circle graphs