Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

Combinatorics Probability and Computing

Volumn 6, Issue 3, 1997, Pages 255-261

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

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031513807     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003027     Document Type: Article

References (7)

1. Bondy, J. A. and Murty, U. S. R. (1976) Graph Theory with Applications. MacMillan.
2. Ford, L. R. and Fulkerson, D. R. (1962) Flows in Networks. Princeton University Press.
3. Fraisse, P. and Thomassen, C. (1987) Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs and Combin. 3 239-250.
4. Hoffmann, A. J. (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symposia on Applied Math. 10 113-127.
5. Thomassen, C. (1980) Hamiltonian-connected tournaments. J. Combin. Theory (B) 28 142-163.
6. Thomassen, C. (1982) Edge-disjoint Hamiltonian paths and cycles in tournaments. Proc. London Math. Soc. 45 151-168.
7. Yeo, A. (1997) One-diregular subgraphs in semicomplete multipartite digraphs. J. Graph Theory 24 1-11.