𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

✍ Scribed by Thomassen, C.

Book ID
120101426
Publisher
Oxford University Press
Year
1982
Tongue
English
Weight
445 KB
Volume
s3-45
Category
Article
ISSN
0024-6115

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-disjoint Hamiltonian cycles in hype
Edge-disjoint Hamiltonian cycles in hypertournaments
✍ Vojislav Petrovic; Carsten Thomassen πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ β‰₯ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ β‰₯ k + 1 + 24__d__ vertices (when __k__ β‰₯ 4) or on __n__ β‰₯ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Edge-disjoint paths and cycles in n-edge
Edge-disjoint paths and cycles in n-edge-connected graphs
✍ Andreas Huck πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l β‰₯ 0 let g(k, l) be the minimal __n__ β‰₯ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a