A358286 Number of connected planar cubic graphs with 2*n nodes and the maximum number of edge-Kempe equivalence classes.
1, 1, 1, 8, 1, 3, 27, 1, 1, 1, 7, 42, 1, 2
Offset: 2
Links
- Jan Goedgebeur and Patric R. J. Ostergard, Switching 3-Edge-Colorings of Cubic Graphs, arXiv:2105:01363 [math.CO], May 2021. See Table 3.
Crossrefs
Cf. A005964.