Read our cookies policy and privacy statement for more information.
×Fullerton, California
Analyze discrete structures, including existence, enumeration, and optimization. Permutations and combinations, combinatorial identities, the inclusion-exclusion principle, recurrence relations, Polya counting. Basic definitions and properties of graphs, Eulerian and Hamiltonian graphs, trees, graph colorings and chromatic number, planar graphs
Units: 3.0