We present a collection of algorithms which are used to construct Hamiltonian paths
and cycles in hypercube networks with faulty nodes. In graph theoretical terms, the
hypercube is a connected, undirected graph composed of edges and nodes, or...
In this paper Euclidean and hyperbolic discontinuous isometries* are discussed and compared. The graphic artist M.C. Escher (1898-1972) produced works which have for the structure points, lines, and angles, which repeat in the plane (Euclidean and...
