Number of connected bipartite cubic simple graphs on 2n nodes with the maximum number of edge-Kempe equivalence classes of 3-edge-colorings.
A358283
Number of connected bipartite cubic simple graphs on 2n nodes with the maximum number of edge-Kempe equivalence classes of 3-edge-colorings.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =2a(6) =7a(7) =13a(8) =25a(9) =67a(10) =111a(11) =453a(12) =588a(13) =3112a(14) =3469a(15) =22832
External references
- oeis: A358283