|Instructor: Lubos Thoma|
|Office: Lippitt Hall 101F Tel: 874.4451|
|Class schedule: TuTh 12:30 - 1:45pm, Lippitt Hall 201|
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.
R. Diestel, Graph Theory,
Grad. Texts in Math., Springer Verlag, ISBN 978-3-642-14278-9.
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.