| 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. | Vertex pancyclicity in almost regular multipartite tournaments
几乎正则多部竞赛图的点泛圈性 |
| 4. | Enumeration formula of nonisomorphic and selfcomplementary tournaments
不同构自补竞赛图的计数公式 |
| 5. | A note on posets and tournaments
有关偏序集与竞赛图的讨论 |
| 6. | In chapter i , we mainly study the pancyclicity of arcs in local tournaments
在第一章我们主要研究局部竞赛图中的点外弧泛圈性问题。 |
| 7. | In this paper , we study the transitive properties of bipartite tournaments and tournaments , and give the sufficient and necessary conditions of them
摘要研究了二部竞赛图和竞赛图的传递性，给出了它的充分必要条件。 |
| 8. | Infinite - dimensional linear systems is now an established area of research with a long list of journal articles , conference proceedings , and several textbooks to its credit
， 99 ( 2000 ) ， 245 - 249 。这里，我们把yao等人的结果推广到局部竞赛图中，并得到一个非常有意义的定理。 |
| 9. | According to the ranking method of tournament graph , we offer a method to solve multiple attribute decision making problems with the information of plans ' preference for each object
摘要对一类已知各方案对每个目标的优先次序的多属性决策问题，借鉴竞赛图的排序方法，提出了确定所有方案总排序的竞赛图法。 |
| 10. | The two theorems above give a complete solution of the problem of complementary cycles in tournaments . however , for multipartite tournaments which are not tournaments , the problem of complementary cycles is still open
以上两个定理已经完全解决了竞赛图的共轭圈问题，而多部竞赛图的共轭圈问题尚未解决。 |
