| Книга | Страницы для поиска |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 6 |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 550 |
| Messer R. — Linear Algebra: Gateway to Mathematics | 340 |
| Lueneburg H. — Tools and fundamental constructions of combinatorial mathematics | 228 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 6 |
| Merris R. — Combinatorics | 338, 341 |
| Lando S.K., Zvonkin A.K. — Graphs on Surfaces and Their Applications | 26 |
| Fritsch R., Fritsch G. — The four color theorem | 88, 95 |
| Niedermeier R. — Invitation to Fixed Parameter Algorithms | 18 |
| Purdom R.W., Brown C.A. — The analysis of algorithms | 362 |
| Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 281 |
| Semple Ch., Steel M. — Phylogenetics | 5 |
| Fritsch R., Fritsch G. — The Four-Color Theorem: History, Topological Foundations, and Idea of Proof | 88, 95 |
| Klerk de E. — Aspects of Semidefinite Programming | 185 |
| Ruskey F. — Combinatorial generation | 26 |
| Tucker А. — Applied Combinatorics | 20 |
| Zieschang H. — Surfaces and Planar Discontinuous Groups | 4, 74 |
| Aigner M. — Combinatorial Theory | 2 |
| Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 184 |
| Kreyszig E. — Advanced engineering mathematics | 955 |
| Sachkov V.N. — Probabilistic Methods In Combinatorial Analysis | 174 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 191, 234 |
| Tucker A. — Applied Combinatorics | 20 |
| Villareal R.H. — Monomial algebras | 162 |
| Liu C.L. — Introduction to combinatorial mathematics | 174 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 4 |
| Yap H.P. — Total Colourings of Graphs | 1 |
| Averbach B., Chein O. — Problem solving through recreational mathematics | 180, 186, 199 |
| Gries D. — A Logical Approach to Discrete Math | 425 |
| Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 333, 439 |
| Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 333, 439 |
| Soardi P.M — Potential Theory On Infinite Networks | 4 |
| Villarreal R.H. — Monomial Algebras | 162 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 191, 234 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 530, 533 |
| Gossett E. — Discrete Math with Proof | 593 |
| Ivanov O.A. — Easy as Pi?: An Introduction to Higher Mathematics | 87 |
| Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 198 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 530, 533 |
| Keith Devlin — Mathematics: The New Golden Age | 172 |
| A. Slomson — An Introduction to Combinatorics | 153 |
| V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 3 |
|
|
О проекте