Highly Influenced

# The interval number of a complete multipartite graph

@article{Hopkins1984TheIN, title={The interval number of a complete multipartite graph}, author={Laurie B. Hopkins and William T. Trotter and Douglas B. West}, journal={Discrete Applied Mathematics}, year={1984}, volume={8}, pages={163-187} }

- Published in Discrete Applied Mathematics 1984
DOI:10.1016/0166-218X(84)90099-4

The interval number of a graph G, denoted i(G), is the least positive integer t for which G is the intersection graph of a family of sets each of which is the union of at most t cIosed intervals of the real line IR. Trotter and Harary showed that the interval number of the complete bipartite graph K(m, n) is [(mn + I)/(m + n)]. Matthews showed that the interval number of the complete multipartite graph K(n,,n2, . . ..np) was the same as the interval number of K(n,,Q when n, = n2 = ... =np… CONTINUE READING