Path-connectivity in local tournaments

AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancyclic local tournaments, respectively. Moreover, these also extend the corresponding results in Tian et al. (1982) and Zhang (1982) for tournaments