| Description |
1 online resource (xii, 265 pages) : illustrations |
| Series |
Cambridge studies in advanced mathematics ; 89 |
|
Cambridge studies in advanced mathematics ; 89.
|
| 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 |
| Summary |
The first rigorous treatment of tolerance graphs in book form. This book will act as a springboard for researchers, especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory |
| Bibliography |
Includes bibliographical references (pages 253-259) and indexes |
| Notes |
English |
|
Print version record |
| Subject |
Graph theory.
|
|
Combinatorial analysis.
|
|
MATHEMATICS -- Graphic Methods.
|
|
Combinatorial analysis
|
|
Graph theory
|
| Form |
Electronic book
|
| Author |
Trenk, Ann N
|
| ISBN |
0511184808 |
|
9780511184802 |
|
9780511187452 |
|
0511187459 |
|
0511186525 |
|
9780511186523 |
|
0511185634 |
|
9780511185632 |
|
9780521827584 |
|
0521827582 |
|
9780511542985 |
|
0511542984 |
|
9786610449507 |
|
6610449503 |
|
1280449500 |
|
9781280449505 |
|
