Graph Classes Defined by Combinatorial Representations Loughborough University in United Kingdom

This PhD project at Loughborough University focuses on the study of graph classes defined by combinatorial representations. Graphs are fundamental tools for modelling complex systems, including communication networks, biological interactions, and data analysis. The research will explore the mathematical and computational properties of various graph classes, aiming to develop new theoretical insights and practical algorithms for their analysis.

The project is based in the Department of Computer Science and is supervised by Dr M Whitehead. It is suitable for students with a strong background in applied mathematics, computational mathematics, graph theory, or related fields. The research will involve both theoretical and computational approaches, with opportunities to collaborate across disciplines and apply findings to real-world systems.

Applicants should hold a first or upper second class undergraduate degree (or equivalent) in mathematics, computer science, or a closely related subject. Experience in graph theory, combinatorics, or algorithm design is highly desirable. English language proficiency may be required for international applicants.

Funding information is not specified in the position description. Interested candidates are encouraged to check the project link for updates or contact the supervisor for further details.

The application deadline is 19 April 2026. To apply, follow the instructions on the FindAPhD project page and prepare the necessary documents, including your CV, academic transcripts, and a personal statement.