General Information (Catalog listing)
01:640:428 Graph Theory (3)
Colorability, connectedness, tournaments, eulerian and hamiltonian paths, orientability, and other topics from the theory of finite linear graphs, with an emphasis on applications chosen from social, biological, computer science, and physical problems.
Prerequisites: CALC3 and 01:640:250.
G. Chartrand, P. Zhang
A First Course in Graph Theory
Dover Publications (Reprint, 2012),
Adopted Spring 2015
Syllabus may vary.
Taught in the Summer and Fall semesters.
For more information on instructors and sections for this course, please see our Teaching Schedule Page
- Fall 2010 Prof. Weibel
- Summer 2010: Wesley Pegden
- Summer 2009: Prof. Beck
- Fall 2008: Prof. Butler
- Summer '08. A. Thanatipanonda
- Fall 2007. Prof. Ocone
- Summer 2007. Liviu Ilinca
- Fall 2006. Prof. Beck. (Used a different text: Brualdi)
- Fall 2005 (Schleimer)
- Fall 2004 (Maclagan)
- Fall 2003 (Zeilberger)
- Fall 1997 (Weibel