Enumeration of cyclically 4‐connected cubic graphs
Nicholas Wormald · Journal of Graph Theory · 1985
Abstract The number of labeled cyclically 4‐connected cubic graphs on n vertices is shown to satisfy a simple recurrence relation. The proof involves the unique decomposition of 3‐connected cubic graphs into cyclically 4‐connected components.