Bipartite graphs are perhaps the most basic of objects in graph theory,
both from a theoretical and 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
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.
1. Basic concepts; 2. Introduction to bipartite graphs; 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
Click here for Table of Contents and
- Discrete mathematics
A. Asratian, A. Börn and B.O. Turesson
Linköping University, 2006, 235 pp. (in Swedish)
- Problems and Exercises of Graph
A. Asratian, G. Akopian
Yerevan University Press, 1985, 70 pp. (in
Last modified 2006-10-24 by asratian