A084279
Number of labeled 3-colorable (i.e., chromatic number <= 3) graphs on n nodes.
Original entry on oeis.org
1, 2, 8, 63, 958, 27554, 1457047, 137144754, 22249524024, 6032417530135, 2663111111716110, 1876540387225350958
Offset: 1
- Steven R. Finch, Bipartite, k-colorable and k-colored graphs
- Steven R. Finch, Bipartite, k-colorable and k-colored graphs, June 5, 2003. [Cached copy, with permission of the author]
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8c665c7
- Eric Weisstein's World of Mathematics, n-Colorable Graph
a(7)-a(12) added using tinygraph by
Falk Hüffner, Jun 20 2018
A084280
Number of labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.
Original entry on oeis.org
1, 2, 8, 64, 1023, 32596, 2062592, 257798069, 63135260853, 29939766625614, 27055039857514327
Offset: 1
- S. R. Finch, Bipartite, k-colorable and k-colored graphs
- S. R. Finch, Bipartite, k-colorable and k-colored graphs, June 5, 2003. [Cached copy, with permission of the author]
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8c665c7
- Eric Weisstein's World of Mathematics, n-Colorable Graph
a(7)-a(11) added using tinygraph by
Falk Hüffner, Jun 20 2018
A084281
Number of labeled 5-colorable (i.e., chromatic number <= 5) graphs on n nodes.
Original entry on oeis.org
1, 2, 8, 64, 1024, 32767, 2096731, 268232643, 68572495926, 35005772219631, 35642624717803839
Offset: 1
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8c665c7
- Eric Weisstein's World of Mathematics, n-Colorable Graph
a(7)-a(11) added using tinygraph by
Falk Hüffner, Jun 20 2018
A084286
Number of connected labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.
Original entry on oeis.org
1, 1, 4, 38, 728, 26704, 1866255, 251547611, 66295198837, 34494681184926, 35636712584655663
Offset: 1
Showing 1-4 of 4 results.