Weakly Hamiltonian-Connected Locally Semicomplete Digraphs

Journal of Graph Theory

Volumn 21, Issue 2, 1996, Pages 163-172

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

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030537926     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199602)21:2<163::AID-JGT5>3.0.CO;2-P     Document Type: Article

References (6)

1. J. Bang-Jensen, Locally semicomplete digraphs: A generalization of tournaments, J. Graph Theory 14 (1990), 371-390.
2. J. Bang-Jensen, On the structure of locally semicomplete digraphs, Discrete Math. 100 (1992), 243-265.
3. J. Bang-Jensen, A reformulation of Huang's structure theorem on local tournament digraphs with some consequences, Institut for Mathematik og Datalogi Odense Universitet, Preprint No. 13 (1994).
4. Y. Guo and L. Volkmann, Connectivity properties of locally semicomplete digraphs, J. Graph Theory, 18 (1994), 269-280.
5. J. Huang, On the structure of local tournaments, J. Combin. Theory B, 63 (1995), 200-221.
6. C. Thomassen, Hamiltonian-connected tournaments, J. Combin. Theory B 28 (1980), 142-163.