On The Cycle Double Cover Problem
Combinatorics
2022-03-02 v4
Abstract
In this paper, for each graph G, a free edge set F is defined. To study the existence of cycle double cover, the naive cycle double cover of G and F have been defined and studied. In the main theorem, the paper, based on the Kuratowski minor properties, presents a condition to guarantee the existence of a naive cycle double cover for couple (G,F). As a result, the cycle double cover conjecture has been concluded. Moreover, Goddyn's conjecture - asserting if C is a cycle in bridgeless graph G, there is a cycle double cover of G containing C - will have been proved.
Keywords
Cite
@article{arxiv.1201.5203,
title = {On The Cycle Double Cover Problem},
author = {Ali Ghassab},
journal= {arXiv preprint arXiv:1201.5203},
year = {2022}
}
Comments
One of the basic lemma of the paper is false, and the following results have not been proved