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.

This book treats the fundamental mathematical properties that hold for a family of Gaussian random variables.
Reviews
"...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



Book Information
ISBN 9780521593458
Author Armen S. Asratian
Format Hardback
Page Count 272
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 570g
Dimensions(mm) 236mm * 162mm * 23mm