A358288 Number of 3-connected planar cubic simple graphs on 2n unlabeled nodes with the maximum number of edge-Kempe equivalence classes of 3-edge-colorings.

1, 1, 1, 1, 1, 3, 23, 1, 1, 1, 6, 31, 1, 2, 55, 1, 1, 1

Offset

2,6

Links

Table of n, a(n) for n=2..19.

Jan Goedgebeur and Patric R. J. Östergård, Switching 3-Edge-Colorings of Cubic Graphs, arXiv:2105.01363 [math.CO], May 2021. See Table 4.

Crossrefs

Cf. A000109.

Sequence in context: A232016 A365116 A132558 * A072113 A105433 A196086

Adjacent sequences: A358285 A358286 A358287 * A358289 A358290 A358291

Keyword

nonn,more

Author

N. J. A. Sloane, Nov 08 2022

Extensions

Name corrected by Harry Richman, Oct 16 2025

Status

approved