The main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at leas
On local characterizations of Hamiltonian tournaments
β Scribed by Davide Carlo Demaria; Gian Mario Gianella
- Book ID
- 112908531
- Publisher
- Springer Milan
- Year
- 1993
- Tongue
- Italian
- Weight
- 544 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0009-725X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A local tournament is an oriented graph in which the inset, as well as the outset, of every vertex induces a tournament. Local tournaments are interesting in their own right, as they share many nice properties of tournaments. They are also of interest because of their relation to proper circular arc
## Abstract A homomorphism of a digraph to another digraph is an edgepreserving vertex mapping. A local tournament is a digraph in which the inset as well as the outset of each vertex induces a tournament. Thus acyclic local tournaments generalize both directed paths and transitive tournaments. In