On large sets of resolvable and almost r
โ
Qingde Kang; Jianguo Lei
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 430 KB
๐ 1 views
An MTS(v) [or DTS(v)] is said to be resolvable, denoted by RMTS(v) [or RDTS(v)], if its block set can be partitioned into parallel classes. An MTS(v) [or DTS(v)] is said to be almost resolvable, denoted by ARMTS(v) [or ARDTS(v)], if its bloak set can be partitioned into almost parallel classes. The