A Lower Bound of the Number of HamiltonPath for Tournament
Yang Ai-min · Journal of North China Institute of Technology · 2004
Let T be a tournament, and T-1,T-2,:,T-s(s≥1) be the strong components of T. Though considering the in-degree sequence of T-i, for every i∈{1,2,:,s}, this paper gives a lower bound of the number of Hamilton path for tournament T.