Description:   The goal of the course is to present the basic concepts and techniques of graph theory as well as some of their applications to the structure of networks, design of algorithms, combinatorial optimization. Topics to include: fundamentals, matchings, connectivity, vertex and edge coloring, extremal graph and Ramsey theory, planar graphs, algebraic techniques.

Textbook:     R. Diestel, Graph Theory, Graduate Texts in Math., Springer Verlag.

Syllabus, lecture notes, and homework:     Please login into sakai at URI

Accommodations: Any student with a documented disability is welcome to contact me as early in the semester as possible so that we may arrange reasonable accommodations. As part of this process, please be in touch with Disability Services for Students Office at 330 Memorial Union, 401-874-2098.