Bipartite Graphs and their Applications
Part of Cambridge Tracts in Mathematics
- Authors:
- Armen S. Asratian, Luleå Tekniska Universitet, Sweden
- Tristan M. J. Denley, University of Mississippi
- Roland Häggkvist, Umeå Universitet, Sweden
- Date Published: June 2008
- availability: Available
- format: Paperback
- isbn: 9780521065122
Paperback
Other available formats:
Hardback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite graphs. Together with traditional material, the reader will also find many unusual results. Essentially all proofs are given in full; many of these have been streamlined specifically for this text. Numerous exercises of all standards have also been included. The theory is illustrated with many applications especially to problems in timetabling, chemistry, communication networks and computer science. For the most part the material is accessible to any reader with a graduate understanding of mathematics. However, the book contains advanced sections requiring much more specialized knowledge, which will be of interest to specialists in combinatorics and graph theory.
Read more- No competing titles
- Authors well known in this area
- Comprehensive coverage of subject
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: June 2008
- format: Paperback
- isbn: 9780521065122
- length: 272 pages
- dimensions: 229 x 150 x 15 mm
- weight: 0.402kg
- availability: Available
Table of Contents
1. Basic concepts
2. Biparticity
3. Metric properties
4. Connectivity
5. Maximum matchings
6. Expanding properties
7. Subgraphs with restricted degrees
8. Edge colourings
9. Doubly stochastic matrices and bipartite graphs
10. Coverings
11. Some combinatorial applications
12. Bipartite subgraphs of arbitrary graphs.
Related Books
related journals
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.
×