Skip to main content
Log in

Hamiltonian dicycles avoiding prescribed arcs in tournaments

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

If I is a set ofk − 1 arcs in ak-connected tournamentT, thenT − I has a Hamiltonian dicycle.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C.R. Acad. Sci. Paris249, 2151–2152 (1959)

    Google Scholar 

  2. Thomassen, C.: Hamiltonian-connected tournaments. J. Comb. Theory (B)28, 142–163 (1980)

    Google Scholar 

  3. Thomassen, C.: Edge — disjoint Hamiltonian paths and cycles in tournaments. Proc. London Math. Soc.45, 151–168 (1982).

    Google Scholar 

  4. Thomassen, C.: Connectivity in tournaments. In: Graph Theory and Combinatorics (B. Bollobás, ed.) pp. 305–313. London: Academic Press 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788546

Navigation