特定竞赛图中的最长圈问题

The Longest Cycles in Special Tournaments

若有向图T满足条件:uvA(T)使得d_T^+(u)+d_T^-(v)≥k,则称图T满足O(k)条件.讨论了有向图及特殊有向图的最长圈,并且给出了某些特殊竞赛图的Hamilton圈的存在条件.

A digraph T is said to satisfy the condition O（k） if dT^＋（u）＋dT^-（v）≥k whenever uv is not an arc of T. In this paper we discuss the longest cycles in digraph and special digraph, then derive Hamilton properties in some special tournaments.