Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments
From MaRDI portal
Publication:4611873
DOI10.1093/imrn/rnw009zbMath1405.05097arXiv1406.7556OpenAlexW2963272781MaRDI QIDQ4611873
Publication date: 22 January 2019
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7556
Related Items (7)
Bipartitions of highly connected tournaments ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments
This page was built for publication: Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments
