Hamiltonian Cycles in Regular Tournaments
From MaRDI portal
Publication:5295411
DOI10.1017/S0963548306008170zbMath1123.05058OpenAlexW2159335922MaRDI QIDQ5295411
Publication date: 30 July 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548306008170
Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments ⋮ Entropy bounds for perfect matchings and Hamiltonian cycles ⋮ A survey on Hamilton cycles in directed graphs ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Hamiltonian cycles in Dirac graphs ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs