Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/9998
Title: | Edge-disjoint Hamiltonian cycles in hypertournaments | Authors: | Petrović, Vojislav Thomassen, Carsten |
Issue Date: | 1-Jan-2006 | Journal: | Journal of Graph Theory | 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 + 24d vertices (when k ≥ 4) or on n ≥ 30d + 2 vertices (when k = 3) has d edge-disjoint Hamiltonian cycles if and only if it is d-edge-connected. Ironically, this is proved by ordinary tournament arguments although it only holds for k ≥ 3. We also characterizatize the pancyclic k-tournaments, a problem posed by Gutin and Yeo.(Our characterization is slightly incomplete in that we prove it only for n large compared to k.) © 2005 Wiley Periodicals, Inc. | URI: | https://open.uns.ac.rs/handle/123456789/9998 | ISSN: | 03649024 | DOI: | 10.1002/jgt.20120 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
25
checked on Sep 9, 2023
Page view(s)
6
Last Week
5
5
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.