A Constructive Proof of the Cycle Double Cover Conjecture

Details A Constructive Proof of the Cycle Double Cover Conjecture A Constructive Proof of the Cycle Double Cover Conjecture

2012-02-02

arxiv.org/abs/1202.0569v2

Computer Science

Discrete Mathematics

Due to a flaw in Lemma 9, the paper has been withdrawn

Scientific paper

The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and Seymour (1979). In this paper, we settle the conjecture in the affirmative. In particular, we give an algorithm, which inductively constructs a cycle double cover in polynomial time.

Affiliated with

Also associated with

No associations

Rating

A Constructive Proof of the Cycle Double Cover Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Constructive Proof of the Cycle Double Cover Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Constructive Proof of the Cycle Double Cover Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-3902