\n \n \n
\n
\n \n #1 [Ros12]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n K. H. Rosen.\n\n\n \n \n \n \n Discrete mathematics and its applications.\n \n \n \n\n\n \n\n\n\n WCB/McGraw-Hill, 7th edition, 2012.\n
#1 [Ros12]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{rosen-discrete,\n note={#1 [Ros12]},\n author = {K. H. Rosen},\n language = {english},\n title = {Discrete mathematics and its applications},\n edition = {7th},\n publisher = {WCB/McGraw-Hill},\n year = 2012\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #2 [GPK94]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n R. Graham; O. Patashnik; and D. E. Knuth.\n\n\n \n \n \n \n Concrete Mathematics: A Foundation for Computer Science.\n \n \n \n\n\n \n\n\n\n Addison-Wesley, 2nd edition, 1994.\n
#2 [GPK94]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{knuth-concrete,\n note={#2 [GPK94]},\n author = {R. Graham and O. Patashnik and D. E. Knuth},\n language = {english},\n title = {Concrete Mathematics: A Foundation for Computer Science},\n edition = {2nd},\n publisher = {Addison-Wesley},\n year = 1994\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #3 [Ger14]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n J. L. Gersting.\n\n\n \n \n \n \n Mathematical Structures for Computer Science: Discrete Mathematics and its Applications.\n \n \n \n\n\n \n\n\n\n W. H. Freeman, 7th edition, 2014.\n
#3 [Ger14]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{gersting,\n note={#3 [Ger14]},\n author = {J. L. Gersting},\n language = {english},\n title = {Mathematical Structures for Computer Science: Discrete Mathematics and its Applications},\n edition = {7th},\n publisher = {W. H. Freeman},\n year = 2014\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #4 [Vel06]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n D. J. Velleman.\n\n\n \n \n \n \n How to Prove It: A Structured Approach.\n \n \n \n\n\n \n\n\n\n Cambridge University Press, 2nd edition, 2006.\n
#4 [Vel06]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{howtoproveit,\n note={#4 [Vel06]},\n author = {D. J. Velleman},\n language = {english},\n title = {How to Prove It: A Structured Approach},\n edition = {2nd},\n publisher = {Cambridge University Press},\n year = 2006\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #5 [BoMu76]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n J. A. Bondy; and U. S. R. Murty.\n\n\n \n \n \n \n Graph Theory with Applications.\n \n \n \n\n\n \n\n\n\n Elsevier Science Ltd/North-Holland, 1976.\n
#5 [BoMu76]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{bondymurty76,\n note={#5 [BoMu76]},\n title = {Graph Theory with Applications},\n author = {J. A. Bondy and U. S. R. Murty},\n year = 1976,\n language = {english},\n publisher = {Elsevier Science Ltd/North-Holland},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #6 [Die17]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n R. Diestel.\n\n\n \n \n \n \n Graph Theory.\n \n \n \n\n\n \n\n\n\n Springer, 5th edition, 2017.\n
#6 [Die17]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{diestel17,\n note={#6 [Die17]},\n title = {Graph Theory},\n language = {english},\n edition = {5th},\n publisher = {Springer},\n year = 2017,\n author = {R. Diestel}\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #7 [CLRS09]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n T. H. Cormen; C. E. Leiserson; R. L. Rivest; and C. Stein.\n\n\n \n \n \n \n Introduction to Algorithms.\n \n \n \n\n\n \n\n\n\n MIT Press, 3rd edition, 2009.\n
#7 [CLRS09]\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@book{cormen,\n note={#7 [CLRS09]},\n title = {Introduction to Algorithms},\n language = {english},\n edition = {3rd},\n publisher = {MIT Press},\n year = 2009,\n author = {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n #8 [GoSt11]\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n A. Gomide; and J. Stolfi.\n\n\n \n \n \n \n \n Elementos de Matemática Discreta para Computação (apostila).\n \n \n \n \n\n\n \n\n\n\n 2011.\n
#8 [GoSt11]\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@misc{stolfi-discreta,\n note={#8 [GoSt11]},\n title = {Elementos de Matemática Discreta para Computação (apostila)},\n author = {A. Gomide and J. Stolfi},\n url = {https://www.ic.unicamp.br/~stolfi/cursos/MC358-2012-1-A/docs/apostila.pdf},\n year = 2011,\n publisher = UNICAMP\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n