Strong tournaments with the fewest Hamiltonian paths

被引：0

作者：

Moon, J. W. ^{[1
]}

Yang, Laura L. M. ^{[1
]}

机构：

[1] Univ Alberta, Dept Math Sci, Edmonton, AB T6G 2G1, Canada

来源：

UTILITAS MATHEMATICA | 2007年 / 72卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum.

引用

页码：193 / 198

页数：6

共 50 条

[31] Paths with many shortcuts in tournaments
Yuster, Raphael
[J]. DISCRETE MATHEMATICS, 2021, 344 (01)
[32] Monochromatic paths in random tournaments
Bucic, Matija
Letzter, Shoham
Sudakov, Benny
[J]. RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (01) : 69 - 81
[33] Disjoint paths in unions of tournaments
Chudnovsky, Maria
Scott, Alex
Seymour, Paul
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 135 : 238 - 255
[34] A PARALLEL REDUCTION OF HAMILTONIAN CYCLE TO HAMILTONIAN PATH IN TOURNAMENTS
BAMPIS, E
ELHADDAD, M
MANOUSSAKIS, Y
SANTHA, M
[J]. JOURNAL OF ALGORITHMS, 1995, 19 (03) : 432 - 440
[35] Kings in strong tournaments
Wang, Ruixia
Wang, Shiying
[J]. ARS COMBINATORIA, 2016, 126 : 351 - 358
[36] Tournaments as strong subcontractions
Jagger, C
[J]. DISCRETE MATHEMATICS, 1997, 176 (1-3) : 177 - 184
[37] On Hamiltonian cycles and Hamiltonian paths
Rahman, MS
Kaykobad, M
[J]. INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 37 - 41
[38] THE COMPLEXITY OF FINDING GENERALIZED PATHS IN TOURNAMENTS
HELL, P
ROSENFELD, M
[J]. JOURNAL OF ALGORITHMS, 1983, 4 (04) : 303 - 309
[39] REALIZATION OF CERTAIN GENERALIZED PATHS IN TOURNAMENTS
ALSPACH, B
ROSENFELD, M
[J]. DISCRETE MATHEMATICS, 1981, 34 (02) : 199 - 202
[40] ANTIDIRECTED HAMILTON CIRCUITS AND PATHS IN TOURNAMENTS
THOMASSEN, C
[J]. MATHEMATISCHE ANNALEN, 1973, 201 (03) : 231 - 238

← 1 2 3 4 5 →