MTH4170 Network mathematics
Faculty of Science
MTH4170 Network mathematics is a level 4, 6-credit-point, undergraduate and postgraduate unit from the Faculty of Science, offered in 2026 in Semester 2 at Clayton. It has no prerequisites.
- Credit points
- 6
- Offered in 2026
- Semester 2
- Clayton
- Assessment
- Exam 50%
- and 1 other task
This is the 2026 handbook entry. See the 2027 entry.
Reviews
No reviews yetNo reviews yet. Be the first to review MTH4170.
Requisites
Before MTH4170
No prerequisites or corequisites besides the enrolment rules below.
After MTH4170
No unit lists MTH4170 as a prerequisite in the 2026 handbook.
Enrolment rules
PROHIBITION: MTH3170, MTH3175
COREQUISITE: You must be enrolled in the Graduate Certificate in Mathematics or the Master of Mathematics.
Overview
This unit provides an introduction to graph theory, which is the mathematics of networks. Topics covered include trees, Eulerian tours, Hamiltonian cycles, shortest path problem, bipartite graphs, matchings, graph colouring, max-flow problem, graph connectivity, independent sets, planarity, random graphs. Applications to a variety of the sciences will be presented. You will learn how to write proofs and analyse algorithms.
Offerings in 2026
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On campus |
Assessment
- Continuous assessmentDemonstration50%
- Final assessment - Exam (3 hours and 10 minutes)Examination50%
Assessment details may change. Please refer to the assessment information in Moodle closer to the start of the teaching period.
Learning outcomes
When you finish this unit, you should be able to:
- 1
Critically analyse and synthesise concepts in graph theory.
- 2
Evaluate and illustrate the extensive applications and significance of graph theory across diverse fields, particularly in mathematics and computer science
- 3
Apply some of the most famous theorems in graph theory, such as the max-flow-min-cut theorem, the marriage theorem, and the 4-colour theorem, to solve complex problems.
- 4
Construct mathematical proofs of theorems about graphs, demonstrating creativity and depth of understanding
- 5
Design, implement, and critically evaluate algorithms for solving various graph optimisation problems.
- 6
Exhibit mastery in advanced problem-solving techniques, working both independently and collaboratively with staff and fellow students.
- 7
Communicate complex mathematical arguments and concepts related to graph theory with clarity and precision, both in written and oral forms, suitable for academic and professional contexts
Workload and teaching
- Seminars36 hours
- Applied sessions22 hours
- Teaching approachActive learning
- Three 1-hour seminars;
- One 2-hour applied class (in weeks 2-12) and
- 7 hours of independent study per week.
Contacts
- Unit Coordinators
- Professor David Wood
- Chief Examiners
- Professor David Wood
Common questions
What are the prerequisites for MTH4170?
MTH4170 has no prerequisites, but enrolment rules apply.
When is MTH4170 offered?
In 2026, MTH4170 runs in Semester 2 at Clayton.
Does MTH4170 have an exam?
Yes. The exam is worth 50% of the final mark, alongside 1 other task.