| Êíèãà | Ñòðàíèöû äëÿ ïîèñêà |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 91 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 5, 1268, 2176 |
| Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 186.C |
| Graham R.L., Knuth D.E., Patashnik O. — Concrete mathematics | 354 |
| Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 137, 160 |
| Messer R. — Linear Algebra: Gateway to Mathematics | 340 |
| Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 6 |
| Matousek J. — Lectures on Discrete Geometry (some chapters) | 12 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 5, 1268, 2176 |
| Diestel R. — Graph theory | 3, 150 |
| Merris R. — Combinatorics | 343 |
| Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 18 |
| Lando S.K., Zvonkin A.K. — Graphs on Surfaces and Their Applications | 31 |
| Fritsch R., Fritsch G. — The four color theorem | 100 |
| Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 24 |
| Godsil C., Royle G. — Algebraic Graph Theory | 2 |
| Brouwer A.E., Cohen A.M., Neumaier A. — Distance-Regular Graphs | 434 |
| Burris S., Sankappanavar H.P. — A Course in Universal Algebra | 233 |
| Bondy J.A., Murty U.S.R. — Graph theory with applications | 4 |
| Anderson I. — A first course in discrete mathematics | 45 |
| Ross S. — A First Course in Probability | 95 |
| Finch S.R. — Mathematical constants | 498, 532 |
| Hein J.L. — Discrete Mathematics | 44 |
| Ross Sh.M. — Topics in Finite and Discrete Mathematics | 127 |
| Slade G. — The Lace Expansion and Its Applications | 133 |
| Ito K. — Encyclopedic Dictionary of Mathematics | 186.C |
| Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 3, 312 |
| Ionin Y.J., Shrikhande M.S. — Combinatorics of Symmetric Designs | 19 |
| Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 283 |
| Semple Ch., Steel M. — Phylogenetics | 6 |
| Fritsch R., Fritsch G. — The Four-Color Theorem: History, Topological Foundations, and Idea of Proof | 100 |
| Krantz S.G. — Techniques of Problem Solving | 92, 94 |
| Adams C.C. — The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots | 215 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 42 |
| Beckenbach E.F. (editor), Polya G., Lehmer D.H. and others — Applied combinatorial mathematics | 187 |
| Barthelemy J.-P., Guenoche A. — Trees and proximity representations | 3, 98 |
| Chung F.R.K. — Spectral Graph Theory | 5 |
| Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 23, 26, 39, 318 |
| Tucker À. — Applied Combinatorics | 21, 29, 423 |
| Dong F.M., Teo K.L., Koh K.M. — Chromatic Polynomials And Chromaticity Of Graphs | XIX |
| Veltkamp R.C. — Closed Object Boundaries From Scattered Points | 9, 45 |
| Allaire G. — Numerical Analysis and Optimization: An Introduction to Mathematical Modelling and Numerical Simulation | 384 |
| Barnette D. — Map Coloring Polyhedra and the Four Color Problem | 24 |
| Munkres J. — Topology | 394 |
| Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas | 174 |
| D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 216, 220, 230, 392 |
| Berge C. — Graphs and Hypergraphs | 7 |
| Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 191 |
| Jain A.K., Dubes R.C. — Algorithms for clustering data | 269 |
| Olver P.J., Shakiban C. — Applied linear. algebra | 128 |
| Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 9, 155, 157, 170, 172, 179, 191, 241 |
| Graver J.E. — Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures | 39 |
| Kreyszig E. — Advanced engineering mathematics | 958 |
| Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 4, 214 |
| Ore O., Wilson R.J. — Graphs and Their Uses | 7, 149 |
| Wilkinson L., Wills G., Rope D. — The Grammar aof Graphics | 377 |
| Harary F. — Graph Theory | 16 |
| Thorpe M.F. (ed.), Duxbury P.M. (ed.) — Rigidity theory and applications | 40 |
| Pevzner P.A. — Computational Molecular Biology An Algorithmic Approach | 51 |
| Blom G., Holst L., Sandell D. — Problems and Snapshots from the World of Probability | 149 |
| Gross J.L., Tucker T.W. — Topological Graph Theory (Wiley Series in Discrete Mathematics and Optimization) | 10 |
| Tucker A. — Applied Combinatorics | 21, 29, 423 |
| Villareal R.H. — Monomial algebras | 163 |
| Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) | 280 |
| Liu C.L. — Introduction to combinatorial mathematics | 179, 183, 220 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 3, 11, 20, 22—23, 25, 27, 29ff, 63, 189—190, 390, 436, 441, 444, 450, 476 |
| Roberts F. S. — Graph theory and its applications to problems of society | 20 |
| Gibbons A. — Algorithmic graph theory | 3 |
| Gibbons A. — Algorithmic graph theory | 3 |
| Yap H.P. — Total Colourings of Graphs | 2 |
| Stinson D.R. — Cryptography: Theory and practice | 503 |
| Averbach B., Chein O. — Problem solving through recreational mathematics | 177, 403 |
| Dicks W., Dunwoody M.J. — Groups acting on graphs | 67 |
| Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics | 187 |
| Gries D. — A Logical Approach to Discrete Math | 436 |
| Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 45 |
| Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 452—453, 531 |
| Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 452—453, 531 |
| Villarreal R.H. — Monomial Algebras | 163 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 197 |
| Haley D.K. — Equational Compactness in Rings With Applications to the Theory of Topological Rings | 140 |
| Gossett E. — Discrete Math with Proof | 596 |
| Scheinerman E.A. — Mathematics: A Discrete Introduction | 397, 545 |
| Gill A. — Applied Algebra for the Computer Sciences | 362 |
| Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 200 |
| Honsberger R. — Mathematical diamonds | 6 |
| D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 216, 220, 230, 392 |
| V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 4 |
|
|
Î ïðîåêòå