×

zbMATH — the first resource for mathematics

Hamiltonian cycles avoiding prescribed arcs in tournaments. (English) Zbl 0878.05036
A tournament \(T\) is called \(k\)-strong if removing any set of less than \(k\) vertices of \(T\) results in a strong tournament. P. Fraisse and C. Thomassen [Graphs Comb. 3, 239-250 (1987; Zbl 0622.05028)] proved that if \(T\) is a \(k\)-strong tournament then the digraph obtained from \(T\) by removing any set of at most \(k-1\) arcs is hamiltonian. In the paper the authors give a generalization of the above result.
Reviewer: P.Horák (Safat)

MSC:
05C20 Directed graphs (digraphs), tournaments
05C45 Eulerian and Hamiltonian graphs
PDF BibTeX XML Cite
Full Text: DOI