A survey on Hamilton cycles in directed graphs
From MaRDI portal
Publication:412269
DOI10.1016/j.ejc.2011.09.030zbMath1239.05114arXiv1006.0590OpenAlexW2036286064MaRDI QIDQ412269
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0590
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Hamiltonian problems in directed graphs with simple row patterns ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Unnamed Item ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The robust component structure of dense regular graphs and applications ⋮ Arbitrary Orientations of Hamilton Cycles in Digraphs ⋮ Oriented discrepancy of Hamilton cycles ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Hamilton decompositions of regular expanders: applications ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ A random walk approach to linear statistics in random tournament ensembles ⋮ Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial and computational aspects of graph packing and graph decomposition
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Hamilton cycles in highly connected and expanding graphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- An approximate version of Sumner's universal tournament conjecture
- Edge-disjoint Hamilton cycles in graphs
- Complementary cycles of all lengths in tournaments
- A note on the number of Hamiltonian paths in strong tournaments
- Powers of Hamilton cycles in tournaments
- \(k\)-Ordered Hamilton cycles in digraphs
- Cycles of given length in oriented graphs
- Hamiltonian degree sequences in digraphs
- Triangle packings and 1-factors in oriented graphs
- A Chvátal-Erdős condition for Hamilton cycles in digraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- An Ore-type condition implying a digraph to be pancyclic
- Hamilton cycles in regular 2-connected graphs
- Proof of the Seymour conjecture for large graphs
- A new sufficient condition for a digraph to be Hamiltonian
- Advances on the Hamiltonian problem -- a survey
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Oriented Hamiltonian cycles in tournaments
- Partitioning vertices of a tournament into independent cycles
- The maximum number of Hamiltonian paths in tournaments
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
- On Hamilton's ideals
- A note on Hamiltonian circuits
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- A note on some embedding problems for oriented graphs
- A Semiexact Degree Condition for Hamilton Cycles in Digraphs
- Finding Hamilton cycles in robustly expanding digraphs
- A proof of Sumner's universal tournament conjecture for large tournaments
- Note on Hamilton Circuits
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- Hamilton decompositions of regular tournaments
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Paths and Cycles in Tournaments
- Cycles in digraphs– a survey
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
- Onk-ordered Hamiltonian graphs
- Hamilton Cycles in Oriented Graphs
- Pancyclic oriented graphs
- Sparse pseudo‐random graphs are Hamiltonian
- Degree conditions for k‐ordered hamiltonian graphs
- Oriented hamilton cycles in digraphs
- Hamiltonian Cycles in Regular Tournaments
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- Sufficient Conditions for Circuits in Graphs†
- On the Number of Hamiltonian Cycles in a Tournament
- Some Theorems on Abstract Graphs
- Counting flags in triangle-free digraphs
- Testing subgraphs in directed graphs
This page was built for publication: A survey on Hamilton cycles in directed graphs
