No label defined (Q4828541)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2117210
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2117210

      Statements

      0 references
      22 November 2004
      0 references
      An idea of the scope of this work can be obtained by listing the chapter headings: Early work on tolerance graphs; Trees, cotrees, and bipartite graphs; Interval probe graphs and sandwich problems; Bitolerance and the ordered sets perspective; Unit and 50\% tolerance orders; Comparability invariance results; Bounded bitolerance orders and trapezoid graphs; Algorithms on tolerance graphs; Hierarchy of classes of bounded bitolerance orders; Tolerance models of paths and subtrees of a tree; Phi-tolerance graphs; Directed tolerance graphs; Open questions and further directions of research. Tolerance graphs were introduced in 1982 by \textit{M. C. Golumbic} and \textit{C. L. Monma} [Congr. Numerantium 35, 321--331 (1982; Zbl 0537.05062)] in order to solve scheduling problems associated with interval graphs. Since that time, the two authors of this book have been among the most active researchers in the area, and they have produced a thorough survey of major known properties of tolerance graphs. The book will be of great value to researchers in the field, and it can also be used as a graduate text in graph theory, since many examples and exercises have been included.
      0 references

      Identifiers