Abstract
If I is a set ofk − 1 arcs in ak-connected tournamentT, thenT − I has a Hamiltonian dicycle.
Similar content being viewed by others
References
Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C.R. Acad. Sci. Paris249, 2151–2152 (1959)
Thomassen, C.: Hamiltonian-connected tournaments. J. Comb. Theory (B)28, 142–163 (1980)
Thomassen, C.: Edge — disjoint Hamiltonian paths and cycles in tournaments. Proc. London Math. Soc.45, 151–168 (1982).
Thomassen, C.: Connectivity in tournaments. In: Graph Theory and Combinatorics (B. Bollobás, ed.) pp. 305–313. London: Academic Press 1984
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fraisse, P., Thomassen, C. Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs and Combinatorics 3, 239–250 (1987). https://doi.org/10.1007/BF01788546
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788546