|
%I #5 Nov 08 2022 15:33:34
%S 1,1,1,8,28,111,556,3108,19368,128811,897475
%N Number of connected planar cubic graphs with 2*n nodes and exactly one edge-Kempe equivalence class.
%C The reference gives further terms.
%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
|
