Integral mixed unit interval graphs

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a linear-time algorithm that decides if a given interval graph admits such an intersection representation.