BYPATHS IN LOCAL TOURNAMENTS

  • Guo, Yu-Bao (Lehrstuhl C F r Mathematik RWTH Aachen)
  • Published : 1999.03.01

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 in-neighbors of x induce tournaments. Let x and y be two vertices of a 3-connected and arc-3-cyclic local tournament T with y x. We investigate the structure of T such that T contains no (x,y)-path of length k for some k with 3 k V(T) -1. Our result generalized those of [2] and [5] for tournaments.

Keywords

bypath;cycle;strong connectivity;local tournament

References

  1. J. Combin. Theory Ser. v.B63 On the structure of local tournaments J. Huang
  2. Canad. Math. Bull. v.10 Cycles of each length in regular tournaments B. Alspach
  3. J. Combin. Theory Ser. v.B28 Hamiltonian-connected tournaments C. Thomassen
  4. J. Graph Theory v.22 Strongly Hamiltonian-connected locally semicomplete digraphs Y. Guo
  5. Discrete Math v.167;168 A classification of locally semicomplete digraphs J. Bang-Jensen;Y. Guo;G. Gutin;L. Volkmann
  6. Ars Combin Completely strong path-connectivity of local tournaments Y.-H. Bu;K.-M. Zhang
  7. Ars Combin. v.47 Arc-pancyclicity of local tournaments Y.-H. Bu;K.-M. Zhang
  8. Discrete Math. v.100 On the structure of locally semicomplete digraphs J. Bang-Jensen
  9. J. Graph Theory v.21 Weakly Hamiltonian-connected locally semicomplete digraphs J. Bang-Jensen;Y. Guo;L. Volkmann
  10. Disjoint paths with prescribed ends and cycles through given arcs in locally semicomplete digraphs and quasi-transitive digraphs J. Bang-Jensen
  11. Ph.D. thesis, RWTH Aachen Locally Semicomplete Digraphs Y. Guo
  12. J. Graph Theory v.14 Locally semiconplete digraphs: A generalization of tournaments J. Bang-Jensen
  13. J. Combin. Theory Ser. v.B17 Bypasses in asymmetric digraphs B. Alspach;K. B. Reid;D. P. Roselle
  14. Discrete Appl. Math. v.79 Bypaths in tournaments Y. Guo;L. Volkmann
  15. Proc. of the Summer School and Inaternational Conference on Combinatorics v.2 Some locally semicomplete digraphs that are not strongly hamitonian-connected Y. Guo;Ku Tung-Hsin(Ed.)
  16. J. Combin. Theory Ser. v.B33 Completely strong path-connected tournaments K.-M. Zhang
  17. J. Combin. Theory Ser. v.B33 Cycles of each length in tournaments F. Tian;Z.-S. Wu;C.-Q. Zhang
  18. J. Graph Theory v.21 Locally semicomplete digraphs that are complementary m-pancyclic Y. Guo;L. Volkmann
  19. Discrete Math. v.167;168 Path-connectivity in local tournaments Y. Guo