We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function. Our approach is based on a new characterization of interval graphs containing hamilton paths, related to the clique decomposition of the graph.