图的(λ,κ)型着色问题

(λ,κ) Colouring of Graphs

推广了图论中的着色问题，提出一种（λ，κ）型着色的新概念，并给出了两种 （λ，κ）型音色多项式ＰＧ（λ，κ）和ＱＧ（λ，κ）的定义，并应用组合和群论的方法对路和 困的（λ，κ）型着色得到了计数公式。

This paper generalizes the colouring problem in graph theory and proposes a new concept which is called (λ, κ) colouring. Two types of (λ, κ) colouring polynomials PG(λ,κ) and QG (λ,κ) of a graph G are defined. Some enumeration formulas of (λ,κ) colouring for paths and cycles are obtained by means of combimatorial and group methods.