Search : Index : Faculty of Science : Mathematics and Statistics
Prev 620-351 Number Theory
Next 620-361 Operations Res. Techniques & Algorithms
620-352 Graph Theory | |
Credit Points | 12.5 |
HECS Band | 2 |
Coordinator | Associate Professor N C Wormald |
Prerequisites | One of 620-112, 620-122, [99]620-142, [99]620-200, 620-211. |
Semester | 2 (view timetable) |
Contact | 36 lectures (three per week) |
Subject Description | This subject introduces the basic concepts of graph theory including paths and cycles, trees and counting, automorphism groups, planar graphs, colouring properties, chromatic polynomials, matching theory. Students should develop the ability to implement algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows; and to implement approximation algorithms. This subject demonstrates the variety of applications of graph theory both within and outside mathematics. Introduction to Graph Theory: Basic concepts, paths and cycles, trees and counting, automorphism groups; planar graphs, colouring properties, chromatic polynomials, matching theory, probabilistic method. Algorithms: Minimum spanning trees, maximum matchings, flows, approximation algorithm. |
Assessment | Up to 24 pages of written assignments and a 3-hour end-of-semester written examination. |
Search : Index : Faculty of Science : Mathematics and Statistics
Prev 620-351 Number Theory
Next 620-361 Operations Res. Techniques & Algorithms
Status: Official 2000 Last Modified: Thursday November 25 15:11 SGML to HTML Conversion: Information Technology Services Authorised by: Academic Registrar Email Enquiries: Course_Information@registrar.unimelb.edu.au