Tournaments That Admit Exactly One Hamiltonian Circuit

DOI10.1112/plms/s3-21.4.716zbMath0207.23004OpenAlexW2050699414MaRDI QIDQ5607736

Robert James Douglas

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

t-Pancyclic Arcs in Tournaments ⋮ Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ A larger class of reconstructible tournaments ⋮ A characterization of unique tournaments ⋮ On the number of Hamiltonian cycles in tournaments ⋮ On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\) ⋮ Multipartite tournaments: a survey ⋮ Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three ⋮ On \(n\)-partite tournaments with unique \(n\)-cycle ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graph theory ⋮ On the number of cycles in local tournaments ⋮ On enumerating tournaments that admit exactly one Hamiltonian circuit ⋮ On local characterizations of Hamiltonian tournaments

This page was built for publication: Tournaments That Admit Exactly One Hamiltonian Circuit