Document Type
Lecture
Publication Date
2-11-2004
Abstract
In this talk I will introduce the cycle double cover conjecture. The conjecture claims that in any 2-connected graph G one can find a collection of cycles such that each edge is contained in exactly two of these cycles. I will review some of the known results on this conjecture and some of the many related conjectures.
Relational Format
presentation
Recommended Citation
Markström, Klas, "An Introduction to Cycle Double Cover Conjecture" (2004). Combinatorics Seminar. 104.
https://egrove.olemiss.edu/math_combinatorics/104
COinS
