Resolvable coverings of 2-paths by 4-cycles
β Scribed by Midori Kobayashi; Gisaku Nakamura
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 137 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A double Dudeney set in __K~n~__ is a multiset of Hamilton cycles in __K~n~__ having the property that each 2βpath in __K~n~__ lies in exactly two of the cycles. A double Dudeney set in __K~n~__ has been constructed when __n__ββ₯β4 is even. In this paper, we construct a double Dudeney se
We survey some results on covering the vertices of 2-colored complete graphs by t w o paths or by t w o cycles Qf different color. W e show the role of these results i n determining path Ramsey numbers and in algorithms for finding long monochromatic paths or cycles in 2-colored complete graphs. ##
## Abstract Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order __v__ (MRPQS(__v__)) and minimal resolvabl
For given positive integers u and v with u β‘ v β‘ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u ΒΏ 3v.