Prerequisite: BINF 301 Graphs, sub graphs, isomerisms, trees, connectivity, Euler and Hamiltonian properties, matching, vertex, and edge colorings and planarity.