A survey on Hamilton cycles in directed graphs

Authors:
Daniela Kühn;Deryk Osthus
Affiliations:
-;-
Venue:
European Journal of Combinatorics
Year:
2012

Citing 29
Cited 2

A Chva´tal-Erdo¨s condition for Hamilton cycles in digraphs

Journal of Combinatorial Theory Series A
Chva´tal–Erdo´s conditions for paths and cycles in graphs and digraphs. A survey

Discrete Mathematics
Powers of Hamilton cycles in tournaments

Journal of Combinatorial Theory Series B
Complementary cycles of all lengths in tournaments

Journal of Combinatorial Theory Series B
Pancyclic oriented graphs

Journal of Graph Theory
Oriented Hamilton cycles in digraphs

Journal of Graph Theory
Sufficient conditions for a digraph to be Hamiltonian

Journal of Graph Theory
Oriented Hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture

Journal of Combinatorial Theory Series B
Oriented Hamiltonian cycles in tournaments

Journal of Combinatorial Theory Series B
Partitioning vertices of a tournament into independence cycles

Journal of Combinatorial Theory Series B
Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

Combinatorica
Testing subgraphs in directed graphs

Journal of Computer and System Sciences - Special issue: STOC 2003
On packing Hamilton cycles in ε-regular graphs

Journal of Combinatorial Theory Series B
On the Number of Hamiltonian Cycles in a Tournament

Combinatorics, Probability and Computing
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs

Combinatorica
Hamiltonian Cycles in Regular Tournaments

Combinatorics, Probability and Computing
On k-ordered Hamiltonian graphs

Journal of Graph Theory
Sparse pseudo-random graphs are Hamiltonian

Journal of Graph Theory
Degree conditions for k-ordered hamiltonian graphs

Journal of Graph Theory
k-Ordered Hamilton cycles in digraphs

Journal of Combinatorial Theory Series B
A dirac-type result on hamilton cycles in oriented graphs

Combinatorics, Probability and Computing
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Triangle packings and 1-factors in oriented graphs

Journal of Combinatorial Theory Series B
Cycles of given length in oriented graphs

Journal of Combinatorial Theory Series B
Hamiltonian degree sequences in digraphs

Journal of Combinatorial Theory Series B
A Semiexact Degree Condition for Hamilton Cycles in Digraphs

SIAM Journal on Discrete Mathematics
An approximate version of Sumner's universal tournament conjecture

Journal of Combinatorial Theory Series B
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

Computer Science Review
A note on some embedding problems for oriented graphs

Journal of Graph Theory

Embedding cycles of given length in oriented graphs

European Journal of Combinatorics
Hamilton decompositions of regular expanders: Applications

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered by a set of Hamilton cycles which are 'almost' edge-disjoint. We also highlight the role that the notion of 'robust expansion' plays in several of the proofs. New and old open problems are discussed.