Bipartite Graphs and their Applications

Author:   Armen S. Asratian (Luleå Tekniska Universitet, Sweden) ,  Tristan M. J. Denley (University of Mississippi) ,  Roland Häggkvist (Umeå Universitet, Sweden)
Publisher:   Cambridge University Press
Volume:   131
ISBN:  

9780511984068


Publication Date:   05 November 2011
Format:   Undefined
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $435.60 Quantity:  
Add to Cart

Share |

Bipartite Graphs and their Applications


Add your own review!

Overview

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.

Full Product Details

Author:   Armen S. Asratian (Luleå Tekniska Universitet, Sweden) ,  Tristan M. J. Denley (University of Mississippi) ,  Roland Häggkvist (Umeå Universitet, Sweden)
Publisher:   Cambridge University Press
Imprint:   Cambridge University Press (Virtual Publishing)
Volume:   131
ISBN:  

9780511984068


ISBN 10:   0511984065
Publication Date:   05 November 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Undefined
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

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.

Reviews

...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


...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


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List