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
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
A084282
Number of labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.
Original entry on oeis.org
1, 2, 8, 64, 1024, 32768, 2097151, 268434467, 68718375600, 35182553667342, 36023832051695607
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(8)-a(11) added using tinygraph by
Falk Hüffner, Jun 20 2018
A084284
Number of connected labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.
Original entry on oeis.org
1, 1, 4, 38, 727, 26538, 1832900, 241187797, 60807843592, 29307734588670, 26725594885115575
Offset: 1
A084272
Number of labeled 4-chromatic (i.e., chromatic number = 4) graphs on n nodes.
Original entry on oeis.org
0, 0, 0, 1, 65, 5042, 605545, 120653315, 40885736829, 23907349095479, 24391928745798217
Offset: 1
Showing 1-5 of 5 results.