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)
“I met Jack Kennedy in November, 1946.... We went out on a double date and it turned out to be a fair evening for me. I seduced a girl who would have been bored by a diamond as big as the Ritz.”
—Norman Mailer (b. 1923)
“He is a stranger to me but he is a most remarkable man—and I am the other one. Between us, we cover all knowledge; he knows all that can be known and I know the rest”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)