1 paper · 2 filters
Radek Hušek, Robert Šámal
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to Ck for some k) instead of cyc…