Longest paths in 2-edge-connected cubic graphs

Nikola K. Blanchard, Eldar Fischer, Oded Lachish +1

We prove almost tight bounds on the length of paths in $2$-edge-connected cubic graphs. Concretely, we show that (i) every $2$-edge-connected cubic graph of size $n$ has a path of…