Some results about the interval number of a graph (Q788005)

A family \((I_ i)^ n_{i=1}\) of sets with every \(I_ i\) being the union of at most m intervals of the real line is called an m-interval model of the graph G if G is the intersection graph of \((I_ i)\). The smallest integer m for which G has an m-interval model is called the interval number i(G) of G. The present paper gives a lower bound for i(G) and further an idea for algorithmical determination of i(G) for a class of graphs G. The considerations can be applied in scheduling problems.