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)
“In a symbol there is concealment and yet revelation: here therefore, by silence and by speech acting together, comes a double significance.... In the symbol proper, what we can call a symbol, there is ever, more or less distinctly and directly, some embodiment and revelation of the Infinite; the Infinite is made to blend itself with the Finite, to stand visible, and as it were, attainable there. By symbols, accordingly, is man guided and commanded, made happy, made wretched.”
—Thomas Carlyle (1795–1881)
“Nothing can we call our own but death,
And that small model of the barren earth
Which serves as paste and cover to our bones.”
—William Shakespeare (1564–1616)