Area: | Department of Mathematics and Statistics |
Credits: | 25.0 |
Contact Hours: | 3.0 |
Lecture: | 3 x 1 Hours Weekly |
Syllabus: | Planar graphs - Kuratowski's Theorem. Hamiltonian Graphs - the theorems of Chvatal, and Grinberg. Graph colourings. Chromatic polynomials. Chromatic number and Brook's Theorem. Applications to scheduling. Extremal graph theory. Degree sequences. |
| |
Texts and references listed below are for your information only and current as of September 30, 2003. Some units taught offshore are modified at selected locations. Please check with the unit coordinator for up-to-date information and approved offshore variations to unit information before finalising study and textbook purchases. |
Unit References: | Bondy, J.A. and Murty, U.S.R. Graph Theory with Applications Elsevier, 1977 Chartrand, G. and Lesniak, L. Graphs and Digraphs Wadsworth (2nd ed.) 1986 Trotter, W. T. (editor) Planar Graphs American Mathematical Society, 1993 Nelson, R. and Wilson, R.J. (eds) Graph Colourings, Longman, 1990 |
Unit Texts: | No textbook required |
| |
Field of Education: | 10100 Mathematical Sciences (Narrow Grouping) | HECS Band (if applicable): | 2 |
|
Extent to which this unit or thesis utilises online information: | Not Online | Result Type: | Grade/Mark |
|
AvailabilityAvailability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information.
|
