A note on the number of Hamiltonian paths in strong tournaments

zbMATH Open1080.05038MaRDI QIDQ813441FDOQ813441

Authors: Arthur H. Busch 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 3977040
• scientific article; zbMATH DE number 5178703
• On the maximum number of Hamiltonian paths in tournaments
• The maximum number of Hamiltonian paths in tournaments
• About the number of oriented Hamiltonian paths and cycles in tournaments
• On the Number of Hamiltonian Cycles in a Tournament
• scientific article; zbMATH DE number 3884197
• Tight bounds for powers of Hamilton cycles in tournaments
• scientific article; zbMATH DE number 3902692

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cited In (7)

• On the maximum number of Hamiltonian paths in tournaments
• Non-critical vertices and long circuits in strong tournaments of order \(n\) and diameter \(d\)
• A survey on Hamilton cycles in directed graphs
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Title not available (Why is that?)
• About the number of directed paths in tournaments
• About the number of oriented Hamiltonian paths and cycles in tournaments

This page was built for publication: A note on the number of Hamiltonian paths in strong tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813441)