Skip to content
Register Sign in Wishlist

Bipartite Graphs and their Applications

£50.99

Part of Cambridge Tracts in Mathematics

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

£ 50.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • No competing titles
    • Authors well known in this area
    • Comprehensive coverage of subject
    Read more

    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

Related Books

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

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.

Cancel

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