I'm working with bridgeless cubic graphs and this bound is a good theoretical bound for my purposes. I'd like to know references for this bound.

## Reference for log(n) bound

I'm working with bridgeless cubic graphs and this bound is a good theoretical bound for my purposes. I'd like to know references for this bound.