𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact coverings of 2-paths by hamilton cycles

✍ Scribed by Midori Kobayashi; Gisaku Nakamura

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
291 KB
Volume
60
Category
Article
ISSN
0097-3165

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

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Ε tefko MiklaviČ; PrimoΕΎ Ε parl πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Ξ“ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Ξ“. Similarly, Ξ“ is __weakly n__‐__HP‐