| Книга | Страницы для поиска |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 1217 |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 91 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 5 |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 363, 534, 542, 657 |
| Diestel R. — Graph Theory | 25—26 |
| Cvetkovic D., Doob M., Sachs H. — Spectra of graphs. Theory and application | 11* |
| Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 160 |
| Matousek J. — Lectures on Discrete Geometry (some chapters) | 11 |
| Diestel R. — Graph theory | 28—30 |
| Merris R. — Combinatorics | 347, 357, 378, 406 |
| Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 25 |
| Scheinerman E.R., Ullman D.H. — Fractional graph theory: a rational approach to the theory of graphs | 184 |
| Bollobas B. — Modern Graph Theory | 7 |
| Williamson S. — Combinatorics for computer science | 225 |
| Hein J.L. — Discrete Mathematics | 44 |
| Motwani R., Raghavan P. — Randomized algorithms | 7 |
| Purdom R.W., Brown C.A. — The analysis of algorithms | 363 |
| Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 310 |
| Molloy M.S., Reed B. — Graph Colouring and the Probabilistic Method | 7 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 43 |
| Beckenbach E.F. (editor), Polya G., Lehmer D.H. and others — Applied combinatorial mathematics | 186 |
| Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 23 |
| Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 20 |
| Tucker А. — Applied Combinatorics | 57, 425 |
| Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 3, 113, 118, 119 |
| Dong F.M., Teo K.L., Koh K.M. — Chromatic Polynomials And Chromaticity Of Graphs | XV |
| Berge C. — Graphs and Hypergraphs | 5 |
| Hein J.L. — Theory of Computation: An Introduction | 19 |
| Peterson J.L. — Petri net theory and the modeling of systems | 11 |
| Harary F. — Graph Theory | 10 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 191 |
| Tucker A. — Applied Combinatorics | 57, 425 |
| Liu C.L. — Introduction to combinatorial mathematics | 171 |
| Berge C. — Hypergraphs. Volume 45 | ch.1, §1 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 2 |
| Diestel R. — Graph Theory | 25, 26 |
| Roberts F. S. — Graph theory and its applications to problems of society | 65 |
| Gibbons A. — Algorithmic graph theory | 3 |
| Gibbons A. — Algorithmic graph theory | 3 |
| Sachkov V.N., Tarakanov V.E. — Combinatorics of Nonnegative Matrices | 6 |
| Yap H.P. — Total Colourings of Graphs | 3 |
| Averbach B., Chein O. — Problem solving through recreational mathematics | 176n. |
| Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics | 186 |
| Gries D. — A Logical Approach to Discrete Math | 425 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 191 |
| Salmhofer M. — Renormalization: an introduction | 42 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 349, 516, 518, 533, 631 |
| Kaufmann A. — Graphs, dynamic programming, and finite games | 57, 248 |
| Gossett E. — Discrete Math with Proof | 593 |
| Jablan S., Sazdanovic R. — LinKnot: knot theory by computer | 1 |
| Foulds L.R. — Combinatorial optimization for undergraduates | 211 |
| Sachkov V.N. — Combinatorial methods in discrete mathematics | 167 |
| Peleg D. — Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications) | 15 |
| Scheinerman E.A. — Mathematics: A Discrete Introduction | 394 |
| Gill A. — Applied Algebra for the Computer Sciences | 364 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 349, 516, 518, 533, 631 |
|
|
О проекте