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

12Reductions of weights, coverages

For an eulerian weighted graph (G, w), if (G, w) is a contra pair, can we find another admissible eulerian weight w* of G such that (G, w*) remains as a contra pair while w*(G) < w(G) and 0 ≤ w*(e) ≤ w(e) for every edge e? If the answer to this question is “yes,” then we should concentrate on eulerian (1, 2)-weights in the study of contra pairs.

It is obvious that every bridgeless graph has a circuit cover. However, we do not know yet how “small” the maximum coverage would be. If one is able to find another circuit cover that reduces the coverage while the parity of coverage is retained, then one is able to reduce the coverage recursively down to 1 or 2, and the CDC conjecture is followed.

These two problems ...

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