Hamiltonian dicycles avoiding prescribed arcs in tournaments

DOI10.1007/BF01788546zbMath0622.05028MaRDI QIDQ1090684

Carsten Thomassen, Pierre Fraisse

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

tournament; Camion's theorem; Hamiltonian dicycle; k-connectedness

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs