Tournaments That Admit Exactly One Hamiltonian Circuit
From MaRDI portal
Publication:5607736
DOI10.1112/plms/s3-21.4.716zbMath0207.23004MaRDI QIDQ5607736
Publication date: 1970
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.4/2851
05C20: Directed graphs (digraphs), tournaments
Related Items
IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES, Graph theory, Graph theory (algorithmic, algebraic, and metric problems), Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three, On the number of cycles in local tournaments, On the number of Hamiltonian cycles in tournaments, On local characterizations of Hamiltonian tournaments, Cycles of all lengths in arc-3-cyclic semicomplete digraphs, A characterization of unique tournaments, A larger class of reconstructible tournaments, Multipartite tournaments: a survey, On \(n\)-partite tournaments with unique \(n\)-cycle, On enumerating tournaments that admit exactly one Hamiltonian circuit