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}
}
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
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

A bound on the interval number of a complete multipartite graph ,

  • ISI W. T. Trotter, L. B. Hopkins
  • The Theory of Applications of Graphs
  • 1981

Interval number of the complete multipartite graph

  • W. T. Trotter

Similar Papers

Loading similar papers…