... to another. Thismeans that we are forced to start with +3 and continue until we obtain the whole 0-class.After which we may either continue with 2, −3, . . . or with +2, −3, . . In the firstcase ... to describe the remaining class, using ±2. If we choose−1 then the smallest element in the next class is 2, and again we find it impossible todescribe the remaining class. In f act, if we add ... Hamiltonian Paths with Prescribed edge lengths in the Complete Graph, Bull. Inst. Combin. Appl., to appear. the electronic journal of combinatorics 17 (2010), #R44 13 Lemma 4.6 We have (imperfect) linear...