Name
Abstract | ||
|---|---|---|
A Kirkman holey covering design, denoted by KHCD(g^u), is a resolvable group-divisible covering design of type g^u. Each of its parallel class contains one block of size @d, while other blocks have size 3. Here @d is equal to 2, 3 and 4 when gu=2, 3 and 4 (mod 3) in turn. In this paper, we study the existence problem of a KHCD(g^u) which has minimum possible number of parallel classes, and give a solution for most values of even g and u. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.02.016 | Discrete Mathematics |
Keywords | Field | DocType |
existence,kirkman covering design,hole | Discrete mathematics,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
309 | 6 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianxing Yin | 1 | 373 | 30.16 |
| Chengmin Wang | 2 | 44 | 8.30 |