Hamiltonicity in prime sum graphs

DOI10.1007/S00373-020-02241-1MaRDI QIDQ2657078zbMATH OpenOpenAlexFDO

Authors Hongbin Chen, Hung-Lin Fu, Junyi Guo

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

Filz's conjectureHamilton cycleprime sum graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 672355
• scientific article; zbMATH DE number 1156646
• Hamiltonicity of a coprime graph
• On Hamiltonian paths with prescribed edge lengths in the complete graph
• scientific article; zbMATH DE number 434920

Cites work

• Bounded gaps between primes
• Hamilton cycles in random subgraphs of pseudo-random graphs
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3499888 (Why is no real title available?)
• scientific article; zbMATH DE number 1196083 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• New equidistribution estimates of Zhang type
• On Hamiltonian bipartite graphs
• On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs
• Quasi-random graphs
• Small gaps between primes
• Some Theorems on Abstract Graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Unsolved problems in number theory

Cited in

(4)

• Vertex-primitive digraphs of prime-power order are hamiltonian
• Hamiltonicity of a coprime graph
• Prime sum graphs and the induced trees they contain
• An infinite version of prime circles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657078)