𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resolvable Coverings of 2-Paths by Cycles

✍ Scribed by Midori Kobayashi; Gisaku Nakamura

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
97 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Double coverings of 2-paths by Hamilton
Double coverings of 2-paths by Hamilton cycles*
✍ Midori Kobayashi; Nobuaki Mutoh; Kiyasu-Zen'iti; Gisaku Nakamura πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## 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

Exact coverings of 2-paths by 4-cycles
Exact coverings of 2-paths by 4-cycles
✍ Katherine Heinrich; Gillian M Nonay πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 583 KB
Vertex coverings by monochromatic paths
Vertex coverings by monochromatic paths and cycles
✍ A. GyΓ‘rfΓ‘s πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

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. ##

Maximal resolvable packings and minimal
Maximal resolvable packings and minimal resolvable coverings of triples by quadruples
✍ Xiande Zhang; Gennian Ge πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 160 KB

## 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