Connected and disconnected graphs; trees; graph planarity; Hamiltonian circuits and Euler tours; coloring; flow and graph optimization algorithms, fundamentals of combinatorics; generating functions and recurrence relations; inclusion-exclusion principle; applications in telecommunications; mobile computing, parallel processing and multiprocessor architectures.