|
|
 |
| Результат поиска |
Поиск книг, содержащих: Disjoint paths
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 143, 159, 536 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 143, 159, 536 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 217—218. | | Papadimitriou C.H. — Computational Complexity | 214, 215 | | Holz M., Podewski K.-P., Steffens K. — Injective Choice Functions | 79 | | Harary F. — Graph Theory | 47 | | Aigner M. — Graph theory | 54 | | V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 80 |
|
|