On the non-unit count of interval graphs

We introduce the non-unit count of an interval graph as the minimum number of intervals in an interval representation whose lengths deviate from one. We characterize a variant of the non-unit count (where all interval lengths are required to be at least one) and graphs with non-unit count 1.