Edge Grundy numbers of the regular Turán graphs
暂无分享,去创建一个
Suppose r ≥ 3 and k ≥ 2 are integers. If k(r − 1) is even then the edge Grundy number of the Turán graph Tkr,r is 2k(r − 1) − 1. Otherwise, the edge Grundy number of Tkr,r is 2k(r − 1) − m for some m ∈ {1, . . . ,min[g(k), 2r − 1]}, where g(k) = 2 if k = 3 and g(k) = k − 2 otherwise.
[1] Paul Erdös,et al. On the equality of the grundy and ochromatic numbers of a graph , 1987, J. Graph Theory.
[3] Dean G. Hoffman,et al. The chromatic index of complete multipartite graphs , 1992, J. Graph Theory.