Exponential Lower Bound on the Number of Circuit Double Covers in Planar Cubic Graphs

Every bridgeless cubic planar (multi)graph has at least (5/2)^(n/4-1/2) circuit double covers, where n is the number of vertices.