عنوان
پدید آورنده
موضوع
رده
QA166.14 .A85 1998
QA166
.
14
.
A85
1998
کتابخانه
محل استقرار
0521065127
052159345X
9780521065122
9780521593458
b741703
Bipartite graphs and their applications /
[Book]
Armen S. Asratian, Tristan M.J. Denley, Roland Häggkvist.
New York :
Cambridge University Press,
1998.
xi, 259 pages :
illustrations ;
24 cm.
Cambridge tracts in mathematics ;
131
Includes bibliographical references (pages 237-255) and index.
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.
0
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.
Graduiertenakademie Pädagogische Hochschulen, Karlsruhe
Bipartite graphs.
Bipartite graphs.
Bipartite graphs.
Bipartiter Graph
Grafentheorie.
Graphenklasse
Graphentheorie
Toepassingen.
511/
.
5
21
QA166
.
14
.
A85
1998
31
.
12
PB
18
SK
890
bcl
blsrissc
rvk
Asratian, Armen S.,1957-
Denley, Tristan M. J.,1967-
Häggkvist, Roland,1950-
20201204023209.0
مطالعه متن کتاب [Book]
Y
