圈的(λ,k)着色问题

(λ,k)-coloring problem of cycle

从(λ,k)着色这一概念出发,应用组合论的方法对圈的(λ,k)着色进行分析,得到了相应的计数公式PG(λ,k),并应用这一计数公式解决了一个实际问题.

Using combinatorial method,the(λ,k)coloring of cycle is discussed,and the corresponding enumeration formula PG(λ,k) is obtained.Applying this enumeration formula a practical problem is solved.