On the structure of strong 3-quasi-transitive digraphs-Reference-Cited by-同舟云学术

On the structure of strong 3-quasi-transitive digraphs

Published:2010-10 Issue:19 Volume:310 Page:2495-2498
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Galeana-Sánchez Hortensia,Goldfeder Ilan A.,Urrutia Isabel

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. Locally semicomplete digraphs: a generalization of tournaments;Bang-Jensen;J. Graph Theory,1990

2. J. Bang-Jensen, Arc-local tournament digraphs: a generalization of tournaments and bipartite tournaments. Technical Report Preprint No. 10, Department of Mathematics and Computer Science, University of Southern Denmark, 1993.

3. The structure of strong arc-locally semicomplete digraphs;Bang-Jensen;Discrete Math.,2004

4. A classification of locally semicomplete digraphs;Bang-Jensen;Discrete Math.,1998

5. Digraphs: Theory, Algorithms, and Applications;Bang-Jensen,2001

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An analogue of quasi-transitivity for edge-coloured graphs;Discussiones Mathematicae Graph Theory;2023

2. Seymour’s Second Neighborhood Conjecture for m-Free Oriented Graphs;Mathematical Problems in Engineering;2022-08-11

3. Extension of Gyárfás-Sumner Conjecture to Digraphs;The Electronic Journal of Combinatorics;2021-05-21

4. Digraphs with proper connection number two;Theoretical Computer Science;2021-04

5. Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter;Discussiones Mathematicae Graph Theory;2021