Book contents
- Frontmatter
- Contents
- Chapter Dependencies
- Preface
- 1 Introduction
- 2 Early work on tolerance graphs
- 3 Trees, cotrees and bipartite graphs
- 4 Interval probe graphs and sandwich problems
- 5 Bitolerance and the ordered sets perspective
- 6 Unit and 50% tolerance orders
- 7 Comparability invariance results
- 8 Recognition of bounded bitolerance orders and trapezoid graphs
- 9 Algorithms on tolerance graphs
- 10 The hierarchy of classes of bounded bitolerance orders
- 11 Tolerance models of paths and subtrees of a tree
- 12 φ-tolerance graphs
- 13 Directed tolerance graphs
- 14 Open questions and further directions of research
- References
- Index of Symbols
- Index
10 - The hierarchy of classes of bounded bitolerance orders
Published online by Cambridge University Press: 11 August 2009
- Frontmatter
- Contents
- Chapter Dependencies
- Preface
- 1 Introduction
- 2 Early work on tolerance graphs
- 3 Trees, cotrees and bipartite graphs
- 4 Interval probe graphs and sandwich problems
- 5 Bitolerance and the ordered sets perspective
- 6 Unit and 50% tolerance orders
- 7 Comparability invariance results
- 8 Recognition of bounded bitolerance orders and trapezoid graphs
- 9 Algorithms on tolerance graphs
- 10 The hierarchy of classes of bounded bitolerance orders
- 11 Tolerance models of paths and subtrees of a tree
- 12 φ-tolerance graphs
- 13 Directed tolerance graphs
- 14 Open questions and further directions of research
- References
- Index of Symbols
- Index
Summary
In this chapter we consider the classes of bounded bitolerance orders arranged in a hierarchy in Figure 10.1. We begin by describing the notation and conventions used in Figure 10.1 and justifying the inclusions and equivalences in the hierarchy. In Section 10.3, we restrict attention to bipartite orders. In that setting, the hierarchy collapses and most of the classes are equivalent. Section 10.4 provides the details to show that any example that appears along an edge between two classes provides a separating example between those two classes.
Introduction
In Section 5.2, we defined subclasses of bounded bitolerance orders by adding restrictions on interval lengths, tolerant points p(ν) and q(ν), and left and right tolerances. These restrictions are summarized in Table 10.1. The restrictions are listed so that the top entry of each column is the most restrictive, and they are less restrictive as you travel down the column.
Each of the three categories of restrictions is independent. Thus, the restrictions can be combined, by taking one from each column, to give 18 classes of bitolerance orders, some of which turn out to be equivalent. In this chapter we often refer to a class by its abbreviation, for example, (1aii) is the class of unit point-core bitolerance orders, and (3ci) is the class of (bounded) tolerance orders.
- Type
- Chapter
- Information
- Tolerance Graphs , pp. 146 - 163Publisher: Cambridge University PressPrint publication year: 2004