A note on the number of Hamiltonian paths in strong tournaments
From MaRDI portal
Publication:813441
zbMath1080.05038MaRDI QIDQ813441
Publication date: 9 February 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125519
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ A survey on Hamilton cycles in directed graphs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ About the number of directed paths in tournaments
This page was built for publication: A note on the number of Hamiltonian paths in strong tournaments
