摘要
本文证明在每一非双向连通竞赛图 T 中,对于使 d^+(u)=△^+及 d^-(v)=△的任一对顶点 u 及 v,T 中都包含一条从 u 到 v 的有向哈密顿路.同时给出△^+及△^-的一个下界.
We prove that in any non-diconnected tournament there exists a directed (u,v)-Hamilton path,for each pair of vertices u and v such that d^+(u)=△^+, d^-(v)=△^-.And we get some lower bounds on △^+ and △^-.
