(3 credits)Prerequisites: MATH 4347/MATH 5347 or consent of instructor. Topics include special classes of graphs, graphical invariants, connectivity and networks, extremal graph theory and heuristic graph algorithms. Proof techniques and algorithms for solving practical computing problems using graph theory will be investigated. (fall)