The total interval number of a graph
Thomas M. Kratzke · 1988
An interval representation (or simply representation) R of a graph G is a collection of finite sets $\{R( u): u \in V(G)\}$ of closed bounded intervals so that $u \leftrightarrow u$ if and only if there exist $\theta\sb{u} \in R(u), \theta\sb{ u} \in R( u)$ with $\theta\sb{u} \cap \theta\sb{ u} ot= \emptyset$. The size of a representation is the number of intervals in the entire collection. The total interval number of G is the size of the smallest representation of G and is denoted I(G). This thesis studies I by proving best possible upper bounds for several classes of graphs. For some classes, the bounds are in terms of n, the number of vertices and for some classes, the bounds are in terms of m, the number of edges. The main result is that for planar graphs, $I(G) \leq 2n(G) - 3$.