Tim Hetherington

Tim Hetherington

Principal Lecturer

School of Science & Technology

Staff Group(s)
Physics and Mathematics


Principal Lecturer – Mathematics Course Manager

Dr Hetherington is the Mathematics Course Manager, overseeing the running of BSc Mathematics, BSc Financial Mathematics, BSc Computer Science and Mathematics, and BSc Sport Science and Mathematics. He teaches Algebra 2 (year 2), and Graph Theory (year 3) which is half of a module on Advanced Topics in Pure Mathematics and supervises final year projects on coding theory, cryptography, combinatorics and graph theory.

Dr Hetherington is the University Coordinator for the British Combinatorical Committee. He is also a member of the Programme Development and Review Subcommittee and sits on School Academic Irregularity Panels.

Research areas

Dr Hetherington is a member of the Intelligent Simulation, Modelling and Networking Research Group (ISMN).

Research interests include graph theory and combinatorics, in particular colourings and list-colourings.

Opportunities to carry out postgraduate research towards an MPhil/PhD exist and further information may be obtained from the NTU Graduate School.

External activity

  • Associate Fellow of the Institute of Combinatorics and its Applications
  • Reviewer for Applied Mathematics Letters, Discrete Mathematics, Discrete Applied Mathematics, Australian Journal of Combinatorics, and Mathematical Reviews
  • Reviewer for Pearson Education

Sponsors and collaborators

University collaborations include The University of Nottingham, The University of East Anglia, and The University of Durham.

Recent research funding has included:

  • Mapping University – Mathematics Assessment Practices (MUMAP project) (2012)


List total arboricity of 2-degenerate graphs. Hetherington TJ, Applied Mathematics Letters, 2012, 25, 2018-2022

Assessing proofs in pure mathematics. Hetherington TJ in Iannone P and Simpson A (eds.), Mapping University Mathematics Assessment Practices, Norwich, University of East Anglia, 2012, 83-94

Entire choosability of near-outerplane graphs. Hetherington TJ, Discrete Mathematics, 2009, 309, 2153-2165

List-colouring the square of a K4-minor-free graph. Hetherington TJ and Woodall DR, Discrete Mathematics, 2007, 308 (18), 4037-4043

List-colourings of near-outerplanar graphs. Hetherington TJ, 2007, PhD thesis, University of Nottingham

See all of Timothy Hetherington's publications...