BIPARTITE GRAPHS AND THEIR APPLICATIONS

Asratian, Armen S.; Denley, Tristan M. J.; Häggkvist, Roland

ISBN 10: 052159345X / ISBN 13: 9780521593458

Published by Cambridge University Press, Cambridge, 1998

About this Item

Octavo, x, 259 pages. In Very Good minus condition with Good plus Dust jacket with mylar covering. Dust jacket has some shelf wear, some closed tears and creasing along the head edge, and minor rubbing. Boards have minor bumping to corners and minor shelf wear. NOTE: Shelved in Netdesk Column R (ND-R). 1377099. FP New Rockville Stock.

Seller Inventory # 1377099

Bibliographic Details

• Title: BIPARTITE GRAPHS AND THEIR APPLICATIONS
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 1998
• Language: English
• ISBN 10: 052159345X
• ISBN 13: 9780521593458
• Binding: Hardcover
• Edition: First Edition.
• Dust Jacket Condition: Dust Jacket Included
• Seller catalogs:
  • Sciences, Math, Medicine, & Natural History

About this title

Synopsis

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.

Book Description

This is the first book which deals solely with bipartite graphs. Together with traditional material, the reader will also find many new and 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.