Skip to content
Register Sign in Wishlist

Bipartite Graphs and their Applications

$60.99 (C)

Part of Cambridge Tracts in Mathematics

  • Date Published: June 2008
  • availability: Available
  • format: Paperback
  • isbn: 9780521065122

$ 60.99 (C)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

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 providing details of the course you are teaching.

Product filter button
About the Authors
  • 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
    Read more

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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    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.

  • Authors

    Armen S. Asratian, Luleå Tekniska Universitet, Sweden

    Tristan M. J. Denley, University of Mississippi

    Roland Häggkvist, Umeå Universitet, Sweden

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

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.

Please fill in the required fields in your feedback submission.