Compatible powers of Hamilton cycles in dense graphs
From MaRDI portal
Publication:6657592
DOI10.1002/JGT.23178MaRDI QIDQ6657592
Jie Hu, Donglei Yang, Xiaohan Cheng
Publication date: 6 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Compatible Hamilton cycles in Dirac graphs
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Hamiltonian cycles in Dirac graphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Graphs with Hamiltonian cycles having adjacent lines different colours
- On the number of Hamiltonian cycles in Dirac graphs
- On extremal problems of graphs and generalized graphs
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Compatible Hamilton cycles in random graphs
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
- Robustness of graph properties
- Rainbow matchings in Dirac bipartite graphs
- Robust Hamiltonicity of Dirac graphs
- Some Theorems on Abstract Graphs
- Proof of the Alon-Yuster conjecture
- Graph Tilings in Incompatibility Systems
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
This page was built for publication: Compatible powers of Hamilton cycles in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657592)
