Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/9998
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Petrović, Vojislav | en_US |
dc.contributor.author | Thomassen, Carsten | en_US |
dc.date.accessioned | 2020-03-03T14:36:31Z | - |
dc.date.available | 2020-03-03T14:36:31Z | - |
dc.date.issued | 2006-01-01 | - |
dc.identifier.issn | 03649024 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/9998 | - |
dc.description.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. | en |
dc.relation.ispartof | Journal of Graph Theory | en |
dc.title | Edge-disjoint Hamiltonian cycles in hypertournaments | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1002/jgt.20120 | - |
dc.identifier.scopus | 2-s2.0-33645292309 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/33645292309 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 52 | en |
dc.relation.firstpage | 49 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 51 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
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.