| Description |
xii, 265 p. : ill. |
| Series |
Cambridge studies in advanced mathematics ; 89 |
|
Cambridge studies in advanced mathematics ; 89.
|
| Bibliography |
Includes bibliographical references (p. 253-259) and indexes. |
| Contents |
Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions. |
| Reproduction |
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. |
| Subject |
Graph theory.
|
|
Combinatorial analysis.
|
| Genre/Form |
Electronic books.
|
| Added Author |
Trenk, Ann N.
|
|
ProQuest (Firm)
|
| ISBN |
0511187459 |
|
0521827582 |
|
