Hamiltonian dicycles avoiding prescribed arcs in tournaments
Tóm tắt
If I is a set ofk − 1 arcs in ak-connected tournamentT, thenT − I has a Hamiltonian dicycle.
Tài liệu tham khảo
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