Hamiltonian degree sequences in digraphs
From MaRDI portal
Publication:974465
DOI10.1016/j.jctb.2009.11.004zbMath1209.05138arXiv0807.1827OpenAlexW2018724658MaRDI QIDQ974465
Deryk Osthus, Andrew Treglown, Daniela Kühn
Publication date: 3 June 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.1827
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (24)
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ Cycle partitions of regular graphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The robust component structure of dense regular graphs and applications ⋮ Path decompositions of tournaments ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ A Rainbow Dirac's Theorem ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree ⋮ Unnamed Item ⋮ Optimal packings of bounded degree trees ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ Degree sequences forcing Hamilton cycles in directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles of given length in oriented graphs
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Triangle packings and 1-factors in oriented graphs
- An Ore-type condition implying a digraph to be pancyclic
- On Hamilton's ideals
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Embedding large subgraphs into dense graphs
- Cycles in digraphs– a survey
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
- Hamilton Cycles in Oriented Graphs
- Testing subgraphs in directed graphs
This page was built for publication: Hamiltonian degree sequences in digraphs
