Sciweavers

ARSCOM
2005
64views more  ARSCOM 2005»
13 years 5 months ago
Hamilton Paths in Certain Arithmetic Graphs
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
Paul A. Russell