Skip header navigation
×

Article

Some relatively sparse graphs with Hamiltonian cycles

Citation
Recaman B, Rowlinson P & Yang Y (1993) Some relatively sparse graphs with Hamiltonian cycles. Publikacije Elektrotehnickog fakulteta – Serija: Matematika, (4), pp. 99-100. http://pefmath2.etf.rs/files/113/807.pdf

Abstract
The graph Gk(n) has vertices 1,2,…,n, and edges the pairs {a, b} for which a + b is a kth power. Computer evidence is presented in support of the conjecture that for each k, Gk(n) is Hamiltonian for large enough n.

Keywords
relatively sparse graphs; Hamiltonian cycles

Journal
Publikacije Elektrotehnickog fakulteta – Serija: Matematika, Issue 4

StatusPublished
Author(s)Recaman, Bernardo; Rowlinson, Peter; Yang, Yuansheng
Publication date31/12/1993
PublisherFaculty of Electrical Engineering, Belgrade
Publisher URLhttp://pefmath2.etf.rs/files/113/807.pdf
ISSN0353-8893
Scroll back to the top