A localization method in Hamiltonian graph theory
From MaRDI portal
Publication:1998767
DOI10.1016/j.jctb.2020.04.005zbMath1459.05148arXiv1810.10430OpenAlexW3100054338MaRDI QIDQ1998767
Jonas B. Granholm, Nikolay K. Khachatryan, Armen S. Asratian
Publication date: 8 March 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.10430
Related Items (2)
On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ Local Dirac's condition on the existence of 2-factor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Extending cycles locally to Hamilton cycles
- A sufficient condition for Hamiltonicity in locally finite graphs
- On infinite cycles. I, II
- Locally finite graphs with ends: A topological approach. II: Applications
- Some localization theorems on Hamiltonian circuits
- A generalization of a result of Häggkvist and Nicoghossian
- A remark on Hamiltonian cycles
- A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
- Advances on the Hamiltonian problem -- a survey
- Cycles through all finite vertex sets in infinite graphs
- Recent advances on the Hamiltonian problem: survey III
- New local conditions for a graph to be Hamiltonian
- Infinite Hamilton cycles in squares of locally finite graphs
- A note on Hamiltonian circuits
- The square of every two-connected graph is Hamiltonian
- On Hamiltonian bipartite graphs
- Note on Hamilton Circuits
- Hamilton Cycles in Planar Locally Finite Graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition
- Some Theorems on Abstract Graphs
This page was built for publication: A localization method in Hamiltonian graph theory
