论文信息 - Path-connectivity in local tournaments

Path-connectivity in local tournaments

Abstract A 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.

Yubao Guo | Yubao Guo

[1] Jing Huang,et al. On the Structure of Local Tournaments , 1995, J. Comb. Theory, Ser. B.

[2] Lutz Volkmann,et al. On complementary cycles in locally semicomplete digraphs , 1994, Discret. Math..

[3] Lutz Volkmann,et al. Connectivity properties of locally semicomplete digraphs , 1994, J. Graph Theory.

[4] Lutz Volkmann,et al. Locally semicomplete digraphs that are complementary m -pancyclic , 1996 .

[5] Z Wu,et al. A NECESSARY AND SUFFICIENT CONDITION FOR ARC-PANCYCLICITY OF TOURNAMENTS , 1982 .

[6] Jørgen Bang-Jensen,et al. On the structure of locally semicomplete digraphs , 1992, Discret. Math..

[7] Yubao Guo. Strongly Hamiltonian-connected locally semicomplete digraphs , 1996 .

[8] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.

[9] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.

[10] J. Moon. Topics on tournaments , 1968 .

[11] Gregory Gutin,et al. A classification of locally semicomplete digraphs , 1997, Discret. Math..

[12] Zhang Ke-min. Completely strong path-connected tournaments , 1982 .

[13] Brian Alspach,et al. Cycles of Each Length in Regular Tournaments , 1967, Canadian Mathematical Bulletin.

[14] Cun-Quan Zhang,et al. Cycles of each length in tournaments , 1982, J. Comb. Theory, Ser. B.