Bipartite Graphs and their Applications

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $55.58
Usually ships in 1-2 business days
(Save 14%)
Other sellers (Paperback)
  • All (6) from $55.58   
  • New (4) from $60.24   
  • Used (2) from $55.58   

More About This Textbook

Overview

Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and from a practical point of view. However, until now they have been considered only as a special class in some wider context. This is the first book which deals solely with bipartite graphs. 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 specialised knowledge, which will be of interest to specialists in combinatorics and graph theory.
Read More Show Less

Editorial Reviews

From the Publisher
"...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

Read More Show Less

Product Details

  • ISBN-13: 9780521065122
  • Publisher: Cambridge University Press
  • Publication date: 6/12/2008
  • Series: Cambridge Tracts in Mathematics Series , #131
  • Edition description: Reissue
  • Pages: 272
  • Product dimensions: 6.00 (w) x 9.00 (h) x 0.80 (d)

Table of Contents

Preface
Notation
Ch. 1 Basic concepts 1
Ch. 2 Introduction to bipartite graphs 7
Ch. 3 Metric properties 23
Ch. 4 Connectivity 45
Ch. 5 Maximum matchings 56
Ch. 6 Expanding properties 75
Ch. 7 Subgraphs with restricted degrees 97
Ch. 8 Edge colourings 125
Ch. 9 Doubly stochastic matrices and bipartite graphs 163
Ch. 10 Coverings 174
Ch. 11 Some combinatorial applications 192
Ch. 12 Bipartite subgraphs of arbitrary graphs 214
Appendix 232
References 237
Index 256
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)