Bipartite Graphs and their Applications
Bipartite Graphs and their Applications
Tristan M. J. Denley , University of Mississippi
Roland Häggkvist , Umeå Universitet, Sweden
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. Until now, they have been considered only as a special class in some wider context. This work deals solely with bipartite graphs, providing traditional material as well as many new and unusual results. The authors illustrate the theory with many applications, especially to problems in timetabling, chemistry, communication networks and computer science. The material is accessible to any reader with a graduate understanding of mathematics and will be of interest to specialists in combinatorics and graph theory.
- No competing titles
- Authors well known in this area
- Comprehensive coverage of subject
Reviews & endorsements
"...excellent monograph...This is an invaluable book and an indispensable resource for any serious student of graph theory." Mathematics of Computing
"...the treatment of topics is clear and self-contained and shows considerable design, work, and thought...as a volume in the series Cambridge Tracts in Mathematics, this book has the mandate to 'take up a single thread in a wide subject and follow its ramifications, thus throwing light on its various aspects.' This book does that, beautifully." Siam Review
Product details
August 1998Hardback
9780521593458
272 pages
236 × 162 × 23 mm
0.57kg
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.
