Powers of Hamilton cycles in tournaments

DOI10.1016/0095-8956(90)90085-EzbMath0712.05030OpenAlexW2028186119MaRDI QIDQ923097

Béla Bollobás, Roland Haeggkvist

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90085-e

zbMATH Keywords

tournamentdegreesHamilton cycle

Mathematics Subject Classification ID

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

Related Items (9)

Powers of paths in tournaments ⋮ A note on some embedding problems for oriented graphs ⋮ On the longest path of a randomly weighted tournament ⋮ A survey on Hamilton cycles in directed graphs ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ Paths with many shortcuts in tournaments ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments

Cites Work

• Unnamed Item
• On extremal problems of graphs and generalized graphs
• Long paths and cycles in oriented graphs
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

This page was built for publication: Powers of Hamilton cycles in tournaments