1.
An orientation of a complete graph is called a tournament.
完全图的定向图称为竞赛图。
2.
Every tournament can be transformed into a diconnected tournament by the reorientation of just one arc.
每个竞赛图只通过一条弧的改向而转变为双向连通竞赛图。
3.
In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them.
研究了二部竞赛图和竞赛图的传递性，给出了它的充分必要条件。
4.
Componentwise Complementary Cycles and Complementary Cycles in Multipartite Tournaments;
多部竞赛图中的分量共轭圈与共轭圈
5.
Problem of Componentwise Complementary Cycles in 2-Equilibrium Multipartite Tournaments;
2-均匀多部竞赛图的分量共轭圈问题
6.
The Enumeration of Walecki TournamentsWhen m Is Even;
m是偶数时 Walecki竞赛图的计数(英文)
7.
Nearly 2-Strong Bipartite Tournaments and Their Score Sequences
几乎2-强二部竞赛图及其得分序列(英文)
8.
On the Enumeration of Walecki Tournaments When m Is Odd;
Enume关于m是奇数时 Walecki竞赛图的计数(英文)
9.
CONJECTURES ON A KIND OF TOURNAMENT AND SOME PROBLEMS OF (0,1)-MATRIX;
关于一种竞赛图和(0,1)——矩阵的有关问题的猜想
10.
Componentwise complementary cycles in locally almost regular multipartite tournaments
局部几乎正则多部竞赛图中的分量共轭圈
11.
The Transitivity of Tournaments and the 3-kings-of-kings in Semicomplete Multipartite Digraphs;
竞赛图的传递性和半完全多部有向图的3-王中王
12.
Hamiltonicity of Almost Regular Multipartite Tournaments and Several Count Problems of Digraphs;
几乎正则多部竞赛图的Hamilton性和有向图中几个计数问题
13.
Study on Pictorial Handball Match Statistics System;
《图式手球竞赛技术统计系统》的研制
14.
The competition numbers of complete tetrapartite graphs K_(n_1,n_2,n_3)
完全三部图K_(n_1,n_2,n_3)的竞赛数
15.
The competition numbers of complete tetrapartite graphs K_(n,n,n,n) where n is even
完全四部图K_(n,n,n,n)(n为偶数)的竞赛数
16.
The competition numbers of complete tetrapartite graphs K_(n,n,n,n) where n is odd
完全四部图K_(n,n,n,n)(n为奇数)的竞赛数
17.
To compete in a contest of speed.
比赛赛跑参加速度竞赛
18.
BROOKLYN PUBLIC LIBRARY VISUAL & PERFORMING ARTS LIBRARY INTERNATIONAL DESIGN COMPETITION
布鲁克林公共图书馆的视觉和表演艺术图书馆国际设计竞赛