A358286 - OEIS

%I #5 Nov 08 2022 15:38:40

%S 1,1,1,8,1,3,27,1,1,1,7,42,1,2

%N Number of connected planar cubic graphs with 2*n nodes and the maximum number of edge-Kempe equivalence classes.

%H Jan Goedgebeur and Patric R. J. Ostergard, <a href="https://arxiv.org/abs/2105.01363">Switching 3-Edge-Colorings of Cubic Graphs</a>, arXiv:2105:01363 [math.CO], May 2021. See Table 3.

%Y Cf. A005964.

%K nonn,more

%O 2,4

%A _N. J. A. Sloane_, Nov 08 2022