Cycle Double Cover

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 Buddha, the Godhead, resides quite as comfortably in the circuits of a digital computer or the gears of a cycle transmission as he does at the top of a mountain or in the petals of a flower.
    Robert M. Pirsig (b. 1928)

    I grew up confidently expecting to have a profession and earn my own living, and also confidently expecting to be married and have children. It was fifty-fifty with me. I was just as passionately determined to have children as I was to have a career. And my mother was the triumphant answer to all doubts as to the success of this double role. From my earliest memory she had more than half supported the family and yet she was supremely a mother.
    Crystal Eastman (1881–1928)

    You may call a jay a bird. Well, so he is, in a measure—because he’s got feathers on him, and don’t belong to no church, perhaps; but otherwise he is just as much a human as you be. And I’ll tell you for why. A jay’s gifts and instincts, and feelings, and interests, cover the whole ground. A jay hasn’t got any more principle than a Congressman.
    Mark Twain [Samuel Langhorne Clemens] (1835–1910)