| U. Jamshy and M. Tarsi. Short Cycle Covers and the Cycle Double Conjecture. J. Combin. Theory Ser. B 56 (1992), 197--204. |
....CDC conjecture for any (vertex) 2 connected graph. We shall not pursue here this geometrical motivation further. Our concern here is the combinatorial background of CDC Conjecture and its relationship to NZF and Cycle Covers. There is a numerous evidence for this. For example it has been proved in [24] that if the Conjecture 6 concerning the existence of a cycle cover C of length at most 7 5 jEj is true then the Cycle double cover conjecture is true. A cycle double cover is said to be k colorable (k 2) if we can color its cycles with k colors in such way that each edge appears in two cycles ....
U. Jamshy and M. Tarsi. Short Cycle Covers and the Cycle Double Conjecture. J. Combin. Theory Ser. B 56 (1992), 197--204.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC