Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

DOI10.1112/plms/s3-45.1.151zbMath0486.05049OpenAlexW1996277976MaRDI QIDQ3946196

Carsten Thomassen

Publication date: 1982

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-45.1.151

zbMATH Keywords

regular tournamenthamiltonian cycleshamiltonian paths

Mathematics Subject Classification ID

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

Related Items (16)

A sufficient condition for oriented graphs to be Hamiltonian ⋮ Hamiltonian dicycles avoiding prescribed arcs in tournaments ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Path decompositions of tournaments ⋮ A survey on Hamilton cycles in directed graphs ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ Powers of Hamilton cycles in tournaments ⋮ On the structure of locally semicomplete digraphs ⋮ Hamiltonian degree sequences in digraphs ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Approximate Hamilton decompositions of random graphs ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments