Bibliografia

O programa será desenvolvido com base no livro texto:

• Townsend, M. Discrete Mathematics: Applied Combinatorics and Graph Theory, Benjamin/Cummings, 1987.

As transparências a serem utilizadas, assim como qualquer outro material relativo ao curso, podem ser obtidas em

http://www.dcc.ufmg.br/ nvieira

na entrada Cursos de graduação/Matemática Discreta/[2002/2].

A bibliografia contém outras abordagens para os mesmos assuntos, e exercícios adicionais. Grande parte dos livros pode ser consultada na biblioteca do ICEx, sala 4222.

• Balakrishnan, V.K. Introductory Discrete Mathematics, Dover, 1991.
• Dean, N. The Essence of Discrete Mathematics, Prentice Hall, 1997.
• Graham, R.L., Knuth, D.E., Patashniko, A.A. Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1989.
• Grassmann, W.K., Tremblay, J.-P. Logic and Discrete Mathematics: A Computer Science Perspective, Prentice Hall, 1996.
• Grimaldi, R.P. Discrete and Combinatorial Mathematics, Addison-Wesley, 1988.
• Johnsonbaugh, R. Essential Discrete Mathematics, MacMillan, 1987.
• Lipschutz, S., Lipson, M. Discrete Mathematics, Schaum's Outlines, 2nd edition, McGraw-Hill, 1997.
• Liu, C.L. Elements of Combinatorial Mathematics, 2nd edition, McGraw-Hill, 1985.
• Mattson Jr., H.F. Discrete Mathematics with Applications, John Wiley & Sons, 1993.
• Mott, J.L., Kandel, A., Baker, T.P. Discrete Mathematics for Computer Scientists, Reston, 1983.
• Rosen, K.H. Discrete Mathematics and its Applications, 2nd edition, McGraw-Hill, 1991.
• Santos, J.P.O., Mello, M.P., Murari, I.T.C. Introdução à Análise Combinatória, Editora UNICAMP, 2002.
• Tucker, A. Applied Combinatorics, 3rd edition, John Wiley & Sons, 1995.
• Velleman, D.J. How To Prove It: A Structured Approach, Cambridge University Press, 1994.
• Zeitz, P. The Art and Craft of Problem Solving, John Wiley & Sons, 1999.