O'Reilly logo

Circuit Double Cover of Graphs by Cun-Quan Zhang

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

16Petersen chain and Hamilton weights

Let us start this chapter with a wrong “proof” of the CDC conjecture.

Proof”Let G be a smallest counterexample to the CDC conjecture and e0 = x0y0E(G). Let image be a circuit double cover of Ge0.

Let C = {C1,…, Ct} (⊆ image) be a chain of circuits joining x0 and y0. That is,

images

Suppose that

images

for every i = 1, …,t – 1. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required