In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a double cover of the graph: each edge belongs to exactly two faces.
It is an unsolved problem, posed by George Szekeres and Paul Seymour and known as the cycle double cover conjecture, whether every bridgeless graph has a cycle double cover. The conjecture can equivalently be formulated in terms of graph embeddings, and in that context is also known as the circular embedding conjecture.
Read more about Cycle Double Cover: Formulation, Reduction To Snarks, Reducible Configurations, Circular Embedding Conjecture, Stronger Conjectures and Related Problems
Famous quotes containing the words cycle, double and/or cover:
“Oh, life is a glorious cycle of song,
A medley of extemporanea;
And love is a thing that can never go wrong;
And I am Marie of Roumania.”
—Dorothy Parker (1893–1967)
“We are, I know not how, double within ourselves, with the result that we do not believe what we believe, and we cannot rid ourselves of what we condemn.”
—Michel de Montaigne (1533–1592)
“Though the whole wind
slash at your bark,
you are lifted up,
aye though it hiss
to cover you with froth.”
—Hilda Doolittle (1886–1961)