| Description |
xi, 259 pages : illustrations ; 24 cm |
| Series |
Cambridge tracts in mathematics ; 131 |
|
Cambridge tracts in mathematics ; 131
|
| Contents |
Ch. 1. Basic concepts -- Ch. 2. Introduction to bipartite graphs -- Ch. 3. Metric properties -- Ch. 4. Connectivity -- Ch. 5. Maximum matchings -- Ch. 6. Expanding properties -- Ch. 7. Subgraphs with restricted degrees -- Ch. 8. Edge colourings -- Ch. 9. Doubly stochastic matrices and bipartite graphs -- Ch. 10. Coverings -- Ch. 11. Some combinatorial applications -- Ch. 12. Bipartite subgraphs of arbitrary graphs |
| Summary |
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 |
| Notes |
Originally published: 1998 |
| Bibliography |
Includes bibliographical references (pages 237-255) and index |
| Subject |
Bipartite graphs.
|
| Author |
Denley, Tristan M. J., 1967-
|
|
Häggkvist, Roland, 1950-
|
| LC no. |
97005251 |
| ISBN |
052159345X (hardback) |
|
