A classification of locally semicomplete digraphs

Discrete Mathematics

Volumn 167-168, Issue , 1997, Pages 101-114

  Bang Jensen, Jørgen ^a   Guo, Yubao ^b   Gutin, Gregory ^a   Volkmann, Lutz ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039768789     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00219-1     Document Type: Article

References (23)

1. B. Alspach and C. Tabib, A note on the number of 4-circuits in a tournament, Ann. Discrete Math. 12 (1982) 13-19.
2. J. Bang-Jensen, Locally semicomplete digraphs: a generalization of tournaments, J. Graph Theory 14 (1990) 371-390.
3. J. Bang-Jensen, On the structure of locally semicomplete digraphs, Discrete Math. 100 (1992) 1-23.
4. J. Bang-Jensen, A reformulation of Huang's structure theorem for local tournaments with some consequences, unpublished manuscript.
5. J. Bang-Jensen, G. Gutin and H. Li, Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theory, to appear.
6. J. Bang-Jensen, G. Gutin and A. Yeo, On k-strong and k-cyclic digraphs, Discrete Math. 162 (1996) 1-11.
7. J. Bang-Jensen, P. Hell and J. Huang, Optimal recognition of local tournaments, Congr. Numer. 100 (1994) 141-146.
8. B. Bhattacharya, P. Hell and J. Huang, A linear algorithm for maximum weight cliques in proper circular arc graphs, SIAM J. Discrete Math. 9 (1996) 274-289.
9. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976).
10. Y.H. Bu and K.M. Zhang, Arc-pancyclicity of local tournaments, submitted.
11. X. Deng, P. Hell and J. Huang, Recognition and representation of proper circular arc graphs, in: E. Balas, G. Cornuejols and R. Kannan, eds., Integer Programming and Combinatorial Optimization, Proc. 2nd IPCO Conf. (1992) 114-121.
12. Y. Guo, Locally semicomplete digraphs, Ph.D. Thesis, RWTH, Aachen, 1995.
13. Y. Guo and L. Volkmann, Pancyclic locally semicomplete digraphs, unpublished manuscript (1992).
14. Y. Guo and L. Volkmann, Connectivity properties of locally semicomplete digraphs, J. Graph Theory 18 (1994) 269-280.
15. Y. Guo and L. Volkmann, On complementary cycles in locally semicomplete digraphs, Discrete Math. 135 (1994) 121-127.
16. Y. Guo and L. Volkmann, Locally semicomplete digraphs that are complementary m-pancyclic, J. Graph Theory 21 (1996) 121-136.
17. P. Hell, J. Bang-Jensen and J. Huang, Local tournaments and proper circular arc graphs, in: T. Asano, T. Ibaraki, H. Imai and T. Nishizeki, eds., Algorithms, Lecture Notes in Computer Science, Vol. 450 (1991) 101-108.
18. P. Hell and J. Huang, Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs, J. Graph Theory 20 (1995) 361-374.
19. J. Huang, Tournament-like oriented graphs, Ph.D. Thesis, Simon Fraser University, 1992.
20. J. Huang, On the structure of local tournaments, J. Combin. Theory Ser. B 63 (1995) 200-221.
21. J.W. Moon, Topics on Tournaments (Holt, Reinhard and Winston, New York, 1968).
22. D.J. Skrien, A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular arc graphs, and nested interval graphs, J. Graph Theory 6 (1982) 309-316.
23. C.Q. Zhang and C. Zhao, On locally semicomplete digraphs, J. Combin. Math. Combin. Comput. 20 (1996) 186-192.