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 lifelong process of caregiving, is the ultimate link between caregivers of all ages. You and I are not just in a phase we will outgrow. This is life—birth, death, and everything in between.... The care continuum is the cycle of life turning full circle in each of our lives. And what we learn when we spoon-feed our babies will echo in our ears as we feed our parents. The point is not to be done. The point is to be ready to do again.”
—Paula C. Lowe (20th century)
“Because I have work to care about, it is possible that I may be less difficult to get along with than other women when the double chins start to form.”
—Gloria Steinem (b. 1934)
“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)