01:640:428 - Graph Theory

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.


Textbook:  For current textbook please refer to our Master Textbook List page


Syllabus may vary.

Schedule of Sections

Previous semesters:

  • 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


Disclaimer: Posted for informational purposes only

This material is posted by the faculty of the Mathematics Department at Rutgers New Brunswick for informational purposes. While we try to maintain it, information may not be current or may not apply to individual sections. The authority for content, textbook, syllabus, and grading policy lies with the current instructor.

Information posted prior to the beginning of the semester is frequently tentative, or based on previous semesters. Textbooks should not be purchased until confirmed with the instructor. For generally reliable textbook information—with the exception of sections with an alphabetic code like H1 or T1, and topics courses (197,395,495)—see the textbook list.