Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/9998
Nаziv: | Edge-disjoint Hamiltonian cycles in hypertournaments | Аutоri: | Petrović, Vojislav Thomassen, Carsten |
Dаtum izdаvаnjа: | 1-јан-2006 | Čаsоpis: | Journal of Graph Theory | Sažetak: | 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 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
25
prоvеrеnо 09.09.2023.
Prеglеd/i stаnicа
6
Prоtеklа nеdеljа
5
5
Prоtеkli mеsеc
0
0
prоvеrеnо 03.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.