Hamilton decompositions of regular expanders: applications
From MaRDI portal
Publication:2434714
DOI10.1016/j.jctb.2013.10.006zbMath1282.05084arXiv1203.0659OpenAlexW2087014485WikidataQ105583654 ScholiaQ105583654MaRDI QIDQ2434714
Publication date: 6 February 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.0659
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Packing spanning graphs from separable families ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The robust component structure of dense regular graphs and applications ⋮ The number of Hamiltonian decompositions of regular graphs ⋮ Path decompositions of tournaments ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Packing arborescences in random digraphs ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Decomposing tournaments into paths ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ Properties, proved and conjectured, of Keller, Mycielski, and queen graphs ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Packing and counting arbitrary Hamilton cycles in random digraphs ⋮ Packing Arborescences in Random Digraphs ⋮ Optimal covers with Hamilton cycles in random graphs ⋮ A blow-up lemma for approximate decompositions ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Optimal packings of bounded degree trees ⋮ Path and cycle decompositions of dense graphs ⋮ An approximate version of Jackson’s conjecture ⋮ Note on matching preclusion number of random graphs ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- A survey on Hamilton cycles in directed graphs
- Paley graphs have Hamilton decompositions
- Edge-disjoint Hamilton cycles in graphs
- On two Hamilton cycle problems in random graphs
- Hamiltonian degree sequences in digraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Edge coloring regular graphs of high degree
- Hamiltonian decomposition of complete regular multipartite digraphs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Random regular graphs of high degree
- Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
- Approximate Hamilton decompositions of random graphs
- Finding Hamilton cycles in robustly expanding digraphs
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
- 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
- Embedding large subgraphs into dense graphs
- Long paths and cycles in oriented graphs
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- The Algorithmic Aspects of the Regularity Lemma
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Algorithms with large domination ratio
- Optimal Packings of Hamilton Cycles in Sparse Random Graphs
- Embedding Spanning Bipartite Graphs of Small Bandwidth
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
- Proof of the $1$-factorization and Hamilton Decomposition Conjectures
- Testing subgraphs in directed graphs
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
This page was built for publication: Hamilton decompositions of regular expanders: applications
