Abstract
It is shown that if a graph has a cycle double cover, then its line graph also has a cycle double cover. The converse of this result for 2-edge-connected graphs would imply the truth of the cycle double cover conjecture.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have