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.
| Original language | English |
|---|---|
| Pages (from-to) | 563-573 |
| Number of pages | 11 |
| Journal | Journal of Graph Theory |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1985 |
| Externally published | Yes |