Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Bipartite Graphs and their Applications

Bipartite Graphs and their Applications

Bipartite Graphs and their Applications

Armen S. Asratian, Luleå Tekniska Universitet, Sweden
Tristan M. J. Denley, University of Mississippi
Roland Häggkvist, Umeå Universitet, Sweden
June 2008
Paperback
9780521065122

    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

    Product details

    June 2008
    Paperback
    9780521065122
    272 pages
    229 × 150 × 15 mm
    0.402kg
    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.