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:
“Only mediocrities progress. An artist revolves in a cycle of masterpieces, the first of which is no less perfect than the last.”
—Oscar Wilde (1854–1900)
“Today, San Francisco has experienced a double tragedy of incredible proportions. As acting mayor, I order an immediate state of mourning in our city. The city and county of San Francisco must and will pull itself together at this time. We will carry on as best as we possibly can.... I think we all have to share the same sense of shame and the same sense of outrage.”
—Dianne Feinstein (b. 1933)
“When you are listening to music it is better to cover your eyes than your ears.”
—José Bergamín (1895–1983)