Contains all the techniques, methods and results developed so far in a bid to solve the famous CDC conjecture.... is a vertex-coloring (or proper vertex-coloring) if c(u) = c(v) for every pair of adjacent vertices u and v. vertex-cut, cut and ... of G, there is an automorphism I a Auto(G) such that I(x) = y. weight decomposition: Let (G, w) be a weighted graph.

Title | : | Circuit Double Cover of Graphs |

Author | : | Cun-Quan Zhang |

Publisher | : | Cambridge University Press - 2012-04-26 |

Continue