2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/65238This paper improves algorithms given in math.CO/0012036. Although the graph (digraph) becomes non-random as the algorithm proceeds, the probability for success stays the same. We also give examples.PDF file. 110 pagesCombinatorics05Obtaining hamilton cicuits in graphs and digraphstext