Hamilton cycles in dense regular digraphs and oriented graphs
From MaRDI portal
Publication:6144396
DOI10.1016/j.jctb.2023.09.004arXiv2203.10112OpenAlexW4387352348MaRDI QIDQ6144396
Viresh Patel, Allan Lo, Mehmet Akif Yıldız
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.10112
Cites Work
- Unnamed Item
- Unnamed Item
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- A survey on Hamilton cycles in directed graphs
- Hamiltonian degree sequences in digraphs
- Dominating cycles in regular 3-connected graphs
- Hamilton cycles in regular 2-connected graphs
- Hamilton cycles in sparse robustly expanding digraphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- The robust component structure of dense regular graphs and applications
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs
- Probability and Computing
- Some Theorems on Abstract Graphs
This page was built for publication: Hamilton cycles in dense regular digraphs and oriented graphs
