On semiextensions and circuit double covers
暂无分享,去创建一个
[1] J. A. Bondy,et al. Progress in Graph Theory , 1984 .
[2] Reinhard Diestel,et al. Graph Theory , 1997 .
[3] Melody Chan. A survey of the cycle double cover conjecture , 2009 .
[4] H. Fleischner. Eulerian graphs and related topics , 1990 .
[5] Peter Adams,et al. 3,5‐Cycle decompositions , 1998 .
[6] G. Szekeres,et al. Polyhedral decompositions of cubic graphs , 1973, Bulletin of the Australian Mathematical Society.
[7] Martin Kochol. Stable dominating circuits in snarks , 2001, Discret. Math..
[8] Herbert Fleischner,et al. Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden , 1980, J. Comb. Theory, Ser. B.
[9] W. T. Tutte. On Hamiltonian Circuits , 1946 .
[10] C. Godsil,et al. Cycles in graphs , 1985 .
[11] Tommy R. Jensen,et al. A note on semiextensions of stable circuits , 2009, Discret. Math..