3-transitive Digraphs

  title={3-transitive Digraphs},
  author={C{\'e}sar Hern{\'a}ndez-Cruz},
  journal={Discussiones Mathematicae Graph Theory},
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is 3-transitive if the existence of the directed path (u, v, w, x) of length 3 in D implies the existence of the arc (u, x) ∈ A(D). In this article strong 3-transitive digraphs are characterized and the structure of non-strong 3-transitive digraphs is described. The results are used, e.g., to characterize 3-transitive digraphs that are transitive and to characterize 3-transitive digraphs… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-5 of 5 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references


  • J. Bang-Jensen, G. Gutin
  • Theory, Algorithms and Applications
  • 2002
Highly Influential
2 Excerpts

The structure of arc-locally in-semicomplete digraphs

  • S. Wang, R. Wang
  • Discrete Math. 309
  • 2009
1 Excerpt

Perfect graphs

  • E. Boros, V. Gurvich
  • kernels and cores of cooperative games, Discrete…
  • 2006
1 Excerpt

Graph Theory 3rd Edition

  • R. Diestel
  • (Springer-Verlag Berlin Heidelberg New York,
  • 2005
1 Excerpt

On the computational complexity of finding a kernel , Report No

  • H. Galeana-Sánchez, I. A. Goldfeder
  • Graph Theory
  • 2005

Similar Papers

Loading similar papers…