On counting interval lengths of interval graphs Original Research Article

Given an interval graph image, the interval count problem is that of computing the minimum number image of interval lengths needed to represent image. Although the problem of deciding whether image is equivalent to that of recognizing unit-interval graphs, which is a well-known problem having several efficient recognition approaches, very little is known about deciding efficiently whether image for fixed image. We provide efficient computations of the interval count of generalizations of threshold graphs.