Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지

BYPATHS IN LOCAL TOURNAMENTS

  • Published : 1999.03.01
Download PDF
⟨ Previous Next ⟩

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

References

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