|
|
Электронная библиотека
механико-математического факультета
Московского государственного университета
|
|
|
|
|
| Результат поиска |
Поиск книг, содержащих: Induced subgraph
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. - Алгоритмы: построение и анализ | 90 | | Graham R.L., Grotschel M., Lovasz L. - Handbook of combinatorics (vol. 1) | 8 | | Grimaldi R.P. - Discrete and combinatorial mathematics. An introduction | 539 | | Diestel R. - Graph Theory | 3, 111, 116-117, 290 | | Cameron P.J. - Combinatorics : Topics, Techniques, Algorithms | 160, 323 | | Haynes T.W., Hedetniemi S.T., Slater P.J. - Fundamentals of domination in graphs | 6 | | Matousek J. - Lectures on Discrete Geometry (some chapters) | 274 | | Graham R.L., Grotschel M., Lovasz L. - Handbook of combinatorics (vol. 2) | 8 | | Diestel R. - Graph theory | 3-4, 68, 126, 128, 132, 376 | | Merris R. - Combinatorics | 348 | | Godsil C., Royle G. - Algebraic Graph Theory | 3 | | Leamer M.J. - Groebner finite path algebras | 12 | | Brouwer A.E., Cohen A.M., Neumaier A. - Distance-Regular Graphs | 433 | | Bondy J.A., Murty U.S.R. - Graph theory with applications | 9 | | Golumbic M.C., Trenk A. - Tolerance Graphs | 5 | | Garey M.R., Johnson D.S. - Computers and intractability. A guide to the theory of NP-completeness | 195-197. | | Du D. (ed.), Pardalos P. (ed.) - Handbook of combinatorial optimization: supplement volume A | 310 | | Ionin Y.J., Shrikhande M.S. - Combinatorics of Symmetric Designs | 19 | | Chung F.R.K. - Spectral Graph Theory | 123 | | Bóna M. - A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 196 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. - Combinatorial optimization | 10 | | Kreher D.L., Stinson D.R. - Combinatorial Algorithms: Generation, Enumeration and Search | 135 | | Ding-Zhu D., Ker-I K. - Problem solving in automata, languages, and complexity | 360 | | Harary F. - Graph Theory | 11 | | Aigner M. - Graph theory | 79 | | Villareal R.H. - Monomial algebras | 195 | | Liu B., Lai H.-J. - Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) | 279 | | van Lint J.H., Wilson R.M. - Course in Combinatorics | 4, 62 | | Diestel R. - Graph Theory | 3, 111, 116-117, 290 | | Yap H.P. - Total Colourings of Graphs | 1 | | Stinson D.R. - Cryptography: Theory and practice | 508 | | Villarreal R.H. - Monomial Algebras | 195 | | Grimaldi R.P., Rothman D.J. - Discrete and Combinatorial Mathematics | 522, 619 | | Di Battista G. - Graph Drawing: Algorithms for the Visualization of Graphs | 5 | | Scheinerman E.A. - Mathematics: A Discrete Introduction | 401, 547 |
|
|
|
|
|
|
|
О проекте