Number of connected bipartite cubic simple graphs on 2*n unlabeled nodes with a unique 3-edge-coloring up to edge-Kempe equivalence.

A358282

Number of connected bipartite cubic simple graphs on 2*n unlabeled nodes with a unique 3-edge-coloring up to edge-Kempe equivalence.

Terms

    a(0) =0a(1) =1a(2) =0a(3) =2a(4) =1a(5) =6a(6) =4a(7) =24a(8) =28a(9) =140a(10) =244a(11) =1026a(12) =2588a(13) =10066a(14) =30848a(15) =117304

External references