Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
Discrete Applied Mathematics
A note on tolerance graph recognition
Discrete Applied Mathematics
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics
First-Fit coloring of bounded tolerance graphs
Discrete Applied Mathematics
A New Intersection Model and Improved Algorithms for Tolerance Graphs
SIAM Journal on Discrete Mathematics
The Recognition of Tolerance and Bounded Tolerance Graphs
SIAM Journal on Computing
Revisiting t. uno and m. yagiura's algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An intersection model for multitolerance graphs: efficient algorithms and hierarchy
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We show that, if a tolerance graph is the complement of a comparability graph, it is a trapezoid graph, i.e., the complement of an order of interval dimension at most 2. As consequences we are able to give obstructions for the class of bounded tolerance graphs and to give an example of a graph that is alternatingly orientable but not a tolerance graph. We also characterize the tolerance graphs among complements of trees. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 129–140, 1998