Hamiltonicity in prime sum graphs

DOI10.1007/s00373-020-02241-1zbMath1459.05149OpenAlexW3094019824MaRDI QIDQ2657078

Jun-Yi Guo, Hong-Bin Chen, Hung-Lin Fu

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02241-1

zbMATH Keywords

Hamilton cycleFilz's conjectureprime sum graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New equidistribution estimates of Zhang type
• Hamiltonian circuits in random graphs
• On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
• Hamilton cycles in random subgraphs of pseudo-random graphs
• Bounded gaps between primes
• On Hamiltonian bipartite graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Some Theorems on Abstract Graphs
• Small gaps between primes
• Quasi-random graphs
• Unsolved problems in number theory

This page was built for publication: Hamiltonicity in prime sum graphs