ANTIDIRECTED HAMILTON CIRCUITS AND PATHS IN TOURNAMENTS

被引：17
|
作者：
THOMASSEN, C [1 ]
机构：
[1] MATEMA INST, AARHUS 8000, DENMARK
来源：
MATHEMATISCHE ANNALEN | 1973年 / 201卷 / 03期
关键词：
D O I：
10.1007/BF01427945
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：231 / 238
页数：8
相关论文
共 50 条
  • [31] THE MAXIMUM NUMBER OF HAMILTONIAN PATHS IN TOURNAMENTS
    ALON, N
    COMBINATORICA, 1990, 10 (04) : 319 - 324
  • [32] REALIZATION OF CERTAIN GENERALIZED PATHS IN TOURNAMENTS
    ALSPACH, B
    ROSENFELD, M
    DISCRETE MATHEMATICS, 1981, 34 (02) : 199 - 202
  • [33] SOME RECENT RESULTS ON PATHS IN TOURNAMENTS
    REID, KB
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (07): : A650 - A650
  • [34] Strong tournaments with the fewest Hamiltonian paths
    Moon, J. W.
    Yang, Laura L. M.
    UTILITAS MATHEMATICA, 2007, 72 : 193 - 198
  • [35] About the number of directed paths in tournaments
    El Sahili, Amine
    Aad, Maria Abi
    DISCRETE APPLIED MATHEMATICS, 2020, 277 : 115 - 126
  • [36] Finding Hamiltonian paths in tournaments on clusters
    Huang, Chun-Hsi
    Rajasekaran, Sanguthevar
    Yang, Laurence Tianruo
    He, Xin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2006, 9 (03): : 345 - 353
  • [37] On the maximum number of Hamiltonian paths in tournaments
    Adler, I
    Alon, N
    Ross, SM
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) : 291 - 296
  • [38] Finding Hamiltonian paths in tournaments on clusters
    Chun-Hsi Huang
    Sanguthevar Rajasekaran
    Laurence Tianruo Yang
    Xin He
    Cluster Computing, 2006, 9 : 345 - 353
  • [39] Tight bounds for powers of Hamilton cycles in tournaments
    Draganic, Nemanja
    Correia, David Munha
    Sudakov, Benny
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 158 : 305 - 340
  • [40] Antidirected Hamiltonian Paths and Cycles of Digraphs with α2-Stable Number 2
    Yang, Hong
    Liu, Juan
    Meng, Jixiang
    GRAPHS AND COMBINATORICS, 2023, 39 (04)
12345