Continues the covering of fundamental topics chosen from enumerative combinatorics and graph theory which started in MATH-M 353. Possible topics include Eulerian trails, Hamiltonian cycles, spanning trees, coloring and matching, planar graphs, Ramsey theory, the probabilistic method, partially ordered sets, enumeration under group action, and combinatorial algorithms.