About MATH 5678 A

Paths and trees, connectivity, Eulerian and Hamiltonian cycles, matchings, edge and vertex colorings, planar graphs, Euler's formula and the Four Color Theorem, networks. Prerequisite: Graduate student or Instructor permission.

Notes

Prereqs: MATH 2055; Graduate student or Instructor permission; Open to Degree and PACE students

Syllabus Unavailable

Please contact the instructor for information about this course.

Important Dates

Last Day to Add
Last Day to Drop
Last Day to Withdraw with 50% Refund
Last Day to Withdraw with 25% Refund
Last Day to Withdraw

Resources