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:
“The cycle of the machine is now coming to an end. Man has learned much in the hard discipline and the shrewd, unflinching grasp of practical possibilities that the machine has provided in the last three centuries: but we can no more continue to live in the world of the machine than we could live successfully on the barren surface of the moon.”
—Lewis Mumford (1895–1990)
“Art has a double face, of expression and illusion, just like science has a double face: the reality of error and the phantom of truth.”
—René Daumal (1908–1944)
“Now folks, I hereby declare the first church of Tombstone, which ain’t got no name yet or no preacher either, officially dedicated. Now I don’t pretend to be no preacher, but I’ve read the Good Book from cover to cover and back again, and I nary found one word agin dancin’. So we’ll commence by havin’ a dad blasted good dance.”
—Samuel G. Engel (1904–1984)