Intervals and orders: What comes after interval orders?

  • Kenneth P. Bogart
Invited Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 831)


In this paper we survey two kinds of generalizations of the ideas of interval graphs and interval orders. For the first generalization we use intervals in ordered sets more general than the real numbers. For the second generalization, we restrict ourselves to intervals chosen in the real numbers, but we define two vertices to be adjacent (in the graphs) or incomparable (in the orders) only when the intervals overlap by more than a specified amount. Each of these generalizations suggests new avenues for research.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.P. Bogart. Threshold Representations of Ordered Sets Dartmouth College Technical report PMA-TR91-170, submitted for publication.Google Scholar
  2. 2.
    K.P. Bogart. A Discrete Proof of the Scott-Suppes Representation Theorem for Semiorders, Dartmouth College Technical Report PMA-TR91-173, to appear, Discrete Applied Mathematics.Google Scholar
  3. 3.
    K.P. Bogart. An Obvious Proof of Fishburn's Interval Order Theorem, Dartmouth College Technical Report PMA-TR91-172, Revised 1/3/92, to appear, Discrete Mathematics.Google Scholar
  4. 4.
    K.P. Bogart, Joseph Bonin, and Jutta Mitas. Interval Orders Based on Weak Orders, Dartmouth College Technical Report PMA-TR91-175, Revised 5/92, to apppear, Discrete Applied Mathematics.Google Scholar
  5. 5.
    K.P. Bogart, Peter Fishburn, Garth Isaak, and Larry J. Langley. Proper and Unit Tolerance Graphs, DIMACS Technical Report 91-74, to appear, Discrete Applied Mathematics.Google Scholar
  6. 6.
    K.P. Bogart and Garth Isaak. Proper and Unit Bitolerance Graphs and Orders SIAM Conference on Discrete Mathematics, Albuquerque, June, 1994.Google Scholar
  7. 7.
    K.P. Bogart, M.S. Jacobson, L.J. Langley, and F.R. McMorris. Bipartite Unit Tolerance Graphs and Width two Orders, Dartmouth College Technical Report PMA-TR93-107, submitted for publication.Google Scholar
  8. 8.
    K.P. Bogart and Ann Trenk. Bipartite Tolerance Orders Dartmouth College Technical Remport PMA-TR92-101, Revised 6/92, to appear, Discrete Mathematics.Google Scholar
  9. 9.
    A. Bouchet. Etude combinatoire des ordonnés finis, Doctoral Thesis, Scientific and Medical University of Grenobel (1971)Google Scholar
  10. 10.
    O. Cogis. Dimension Ferrers des graphes orientés Doctoral Thesis, University of Pieree and Marie Curie, Paris (1980)Google Scholar
  11. 11.
    Sougata Datta. The Recognition and Representation of Interval Orders and Weak Interval Orders Senior Thesis, Dartmouth College, Hanover, NH, 1992.Google Scholar
  12. 12.
    D. Duffus and I. Rival. Separable Subsets of a Finite Lattice, Journal of Combinatorial Theory A 25 (1978) pp188–192.Google Scholar
  13. 13.
    Stefan Felsner. Tolerance Graphs and Orders, Dissertation, Technische Universität Berlin, 1992.Google Scholar
  14. 14.
    Stefan Felsner, Michel Habib, and Rolf Möhring. The Interplay Between Ordinary Dimension and Interval Dimension, to appear, SIAM Journal on Discrete Mathematics.Google Scholar
  15. 15.
    Peter C. Fishburn. Interval Orders and Interval Graphs, John Wiley (New York), 1985.Google Scholar
  16. 16.
    Martin C. Golumbic. Algorithmic Graph Theory and Perfect Graphs, Academic Press (New York), 1980.Google Scholar
  17. 17.
    Martin C. Golumbic and Clyde Monma. A generalization of Interval graphs with tolerances, Proc. 13th SE Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium 35 (Utilitas Math., Winnipeg 1982), 321–331.Google Scholar
  18. 18.
    Martin C. Golumbic, Clyde Monma, and William T. Trotter, Jr., Tolerance Graphs, Discrete Applied Mathematics 9 (1984) 155–170.Google Scholar
  19. 19.
    A. Ghoula-Houri. Caracterisation des graphes non orientes dont on peut orienter les aretes de maniere a obtenir le graphe d'une relation d'order C.R. Acad. Sci. Paris 254 (1962) 1370–1371.Google Scholar
  20. 20.
    P.C. Gilmore and A.J. Hoffman. A Characterization of Comparability Graphs and of Interval Grpahs, Canad. J. Math 16 (1964) 539–548.Google Scholar
  21. 21.
    Peter Hammer, Personal Communication, 1991.Google Scholar
  22. 22.
    M. Jacobson, F.R. McMorris and H. Mulder. An introduction to tolerance intersection graphs, in Graph Theory, Combinatorics, and Applications, Y Alavi et. al. ed., Vol. 2 John Wiley and Sons (1991) 705–723.Google Scholar
  23. 23.
    Larry Langley, personal communication, 1992.Google Scholar
  24. 24.
    Larry Langley, A Recognition Algorithm for Orders of Interval Dimension 2, to appear, Discrete Applied Mathematics.Google Scholar
  25. 25.
    Larry Langley. Orders of width 2 are Tolerance Orders Twenty-Fifth Southeastern International Conference on Combinatorics, Graph Theory, and Computing. March, 1994.Google Scholar
  26. 26.
    C.G. Lekkerkerker and J.Ch. Boland, Representation of a Finite Graph by a Set of Intervals on the Real Line, Fundamenta Mathematica 51 (1962) 45–64Google Scholar
  27. 27.
    T. Ma and J. Spinrad. An O(n 2) algorithm for the 2-chain cover problem and related problems., Proceedings of the Second Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1991.Google Scholar
  28. 28.
    Jutta Mitas. The Structure of Interval Orders Thesis, Technischen Hochschule Darmstadt, 1992.Google Scholar
  29. 29.
    Fred Roberts. Indifference Graphs, in Proof Techniques in Graph Theory, F. Harary, ed. Academic Press, New York (1969).Google Scholar
  30. 30.
    Dana Scott and Patrick Suppes. Foundational Aspects of Theories of Measurement, J. Symbolic Logic 23 (1958), 113–128.Google Scholar
  31. 31.
    William T. Trotter. Combinatorics and Partially Ordered Sets, Dimension Theory, Johns Hopkins University Press, Baltimore (1992)Google Scholar
  32. 32.
    Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts in Ordered Sets, edited by I. Rival, D. Reidel, Dordrecht (1982) 445–470.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Kenneth P. Bogart
    • 1
  1. 1.Dartmouth CollegeHanoverUSA

Personalised recommendations