|
Courses with significant overlap with this course: Semester of last offering: Date of approval: dd-mmm-yyyy |
|||||
Prerequisites: Course Contents Basic definitions. Blocks. Ramsey Numbers. Degree sequences. Connectivity. Eulerian and Hamiltonian Graphs. Planar graphs and 5colour theorem. Chromatic numbers. Enumeration. Max Flow Min Cut Theorem. Groups and graphs. Matrices and graphs. Matching and Halls Marriage Theorem. Eigen values of graphs. Topic
Instructor(s):
Number of sections: Tutors for each section: Schedule for Lectures: Schedule for Tutorial: Schedule for Labs:
|