|
|
A263324
|
|
Triangle read by rows: T(n,k) (n>=1,0<=k<n) is the number of graphs with n vertices and Grundy number k.
|
|
0
|
|
|
1, 1, 1, 1, 2, 1, 1, 5, 4, 1, 1, 8, 18, 6, 1, 1, 15, 67, 63, 9, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
The Grundy number of a graph is the largest k such that the graph has a greedy k-coloring for some ordering of its vertices. - Charles R Greathouse IV, Oct 16 2015
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1,
1,1,
1,2,1,
1,5,4,1,
1,8,18,6,1,
1,15,67,63,9,1,
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|