Number of unlabeled simple graphs covering n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
A369202
Number of unlabeled simple graphs covering n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =2a(5) =13a(6) =95a(7) =826a(8) =11137a(9) =261899a(10) =11729360a(11) =1006989636a(12) =164072166301
External references
- oeis: A369202