摘要
讨论了r元的n重复排列，其中有s个元的每一个不许3个相邻的问题，作为应用，又讨论了3×n广义棋盘的2染色问题．
This paper deals with the problems of enumeration of repeated permutations in which no element may repeated three times consecutioely. As an application, we discuss 2 - color problems of 3 x n generalized chessboards.
出处
《抚州师专学报》
1999年第1期1-7,共7页
Journal of Fuzhou Teachers College
关键词
重复排列
广义排盘
染色
计数
repeated permutation
generaliged chess boarcl
