Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

DOI10.1112/PLMS/S3-45.1.151MaRDI QIDQ3946196zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(16)

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

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

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