|
|
 |
| Результат поиска |
Поиск книг, содержащих: Cycle, Hamiltonian
| Книга | Страницы для поиска | | Ghosh S.K. — Visibility Algorithms in the Plane | 172, 174, 184, 188, 198, 208, 214, 216 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 171 | | Berge C. — The Theory of Graphs | p. 187 | | Bóna M. — Introduction to Enumerative Combinatorics | 395 | | Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 195 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 567 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 567 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 63, 97 | | Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 195 | | Scheinerman E.A. — Mathematics: A Discrete Introduction | 421, 547 |
|
|
|
|
О проекте