Paths and cycles in extended and decomposable digraphs

Discrete Mathematics

Volumn 164, Issue 1-3, 1997, Pages 5-19

  Bang Jensen, Jørgen ^a   Gutin, Gregory ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039380065     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00038-6     Document Type: Article

References (16)

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 and G. Gutin, Vertex heaviest paths and cycles in quasi-transitive digraphs, Discrete Math. 163 (1997) 217-223.
4. J. Bang-Jensen, G. Gutin and J. Huang, Weakly Hamiltonian-connected ordinary multipartite tournaments, Discrete Math. 138 (1995) 63-74.
5. J. Bang-Jensen and J. Huang, Quasi-transitive digraphs, J. Graph Theory 20 (1995) 141-161.
6. L.W. Beineke and R.J. Wilson, Selected Topics in Graph Theory 3 (Academic Press, New York, 1988).
7. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, Press, 1976).
8. Y. Guo and L. Volkmann, Connectivity properties of locally semicomplete digraphs, J. Graph Theory 18 (1994) 269-280.
9. G. Gutin, A criterion for complete bipartite digraphs to be Hamiltonian, Vestsi Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk No. 1 (1984) 99-100 (in Russian).
10. G. Gutin, Finding a longest path in a complete multipartite digraph, SIAM J. Discrete Math. 6 (1993) 270-273.
11. G. Gutin, Paths and cycles in directed graphs, Ph.D Thesis, Tel-Aviv University, 1993.
12. G. Gutin, Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Discrete Math. 141 (1995) 153-162.
13. G. Gutin, Polynomial algorithms for finding Hamiltonian paths and cycles in quasi-transitive digraphs, Australasian J. Combin. 10 (1994) 231-236.
14. R. Häggkvist, Hamilton cycles in oriented graphs, Combinatorics, Probability and Computing 2 (1993) 25-32.
15. R. Häggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configuration, Combinatorica 9 (1989) 33-38.
16. J. Huang, Tournament-like oriented graphs, Ph.D thesis, Simon Fraser University, 1992.