A Simple Proof for the Cycle Double Cover Conjecture
Combinatorics
2018-11-22 v1
Abstract
Given a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we prove the Goddyn's conjecture as a stronger version of the cycle double cover conjecture which states that every cycle in G is a member of some cycle double cover of G.
Cite
@article{arxiv.1811.08719,
title = {A Simple Proof for the Cycle Double Cover Conjecture},
author = {A. Alipour and A. Tayebi},
journal= {arXiv preprint arXiv:1811.08719},
year = {2018}
}
Comments
In this paper, we will prove the Goddyn's conjecture. Thus, we prove the Cycle Double Cover Conjecture