Tolerance Graphs
£111.00
Part of Cambridge Studies in Advanced Mathematics
- Authors:
- Martin Charles Golumbic, University of Haifa, Israel
- Ann N. Trenk, Wellesley College, Massachusetts
- Date Published: February 2004
- availability: Available
- format: Hardback
- isbn: 9780521827584
£
111.00
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and 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.
Read more- Topic is active area of research with many exciting applications
- Book collects major results that were previously scattered through literature
- Numerous examples and exercises make this book ideal for a graduate course
Reviews & endorsements
' … 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.' Zentralblatt MATH
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: February 2004
- format: Hardback
- isbn: 9780521827584
- length: 278 pages
- dimensions: 236 x 158 x 19 mm
- weight: 0.54kg
- contains: 75 b/w illus.
- availability: Available
Table of Contents
1. Introduction
2. Early work on tolerance graphs
3. Trees, cotrees and bipartite graphs
4. Interval probe graphs
5. Bitolerance graphs and ordered sets
6. Unit and 50% tolerance graphs
7. Comparability and invariance results
8. Bounded bitolerance recognition
9. Algorithms on tolerance graphs
10. The hierarchy of bitolerance orders
11. Tolerance models on trees
12. Phi-tolerance models
13. Directed tolerance graphs
14. Open questions and further directions.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×