Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection
From MaRDI portal
Publication:6062872
DOI10.1002/jgt.23001zbMath1526.05083arXiv2204.10738MaRDI QIDQ6062872
Sylwia Antoniuk, Andrzej Ruciński, Andrzej Dudek
Publication date: 6 November 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.10738
Cites Work
- Proof of the Seymour conjecture for large graphs
- How many random edges make a dense graph hamiltonian?
- On the square of a Hamiltonian cycle in dense graphs
- Sprinkling a Few Random Edges Doubles the Power
- Powers of Hamiltonian cycles in randomly augmented graphs
- Some Theorems on Abstract Graphs
- High powers of Hamiltonian cycles in randomly augmented graphs
This page was built for publication: Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection