4 citations · 7 across the 2 of their papers we have counts for
1 paper · 1 filter
Barbora Candráková, Robert Lukoťka
We show that every bridgeless cubic graph G on n vertices other than the Petersen graph has a 2-factor with at most 2(n−2)/15 circuits of length 5. An infinite family of gr…