login
A358283
Number of connected bipartite cubic simple graphs on 2n nodes with the maximum number of edge-Kempe equivalence classes of 3-edge-colorings.
0
1, 1, 1, 1, 3, 2, 7, 13, 25, 67, 111, 453, 588, 3112, 3469, 22832
OFFSET
3,5
LINKS
Jan Goedgebeur and Patric R. J. Ostergard, Switching 3-Edge-Colorings of Cubic Graphs, arXiv:2105:01363 [math.CO], May 2021. See Table 2.
CROSSREFS
Sequence in context: A052546 A260016 A320769 * A390815 A363584 A365279
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Nov 08 2022
EXTENSIONS
Name corrected by Harry Richman, Oct 16 2025
STATUS
approved