Number of graphs with n vertices such that a bipartite connected component doesn't exist.
A157016
Number of graphs with n vertices such that a bipartite connected component doesn't exist.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =3a(5) =16a(6) =96a(7) =812a(8) =10957a(9) =260494a(10) =11713772a(11) =1006689871a(12) =164059928509
External references
- oeis: A157016