  We discuss the existence of Hamilton cycles in the random graph $G_{n,p}$
where there are restrictions caused by (i) coloring sequences, (ii) a subset of
vertices must occur in a specific order and (iii) there is a bound on the
number of inversions in the associated permutation.
