Professor Robert AldredOffice: 211A
** Head of Department **
Prof Aldred's current research interests involve paths, cycles, matchings and colourings in graphs. Recently he has worked on bounding the number of cycles in a 3-connected cubic graph, determining the smallest 3-connected cubic planar non-Hamiltonian graphs of cyclic connectivity 4 and 5, factoring (colouring) regular graphs into linear forests of minimum length and classes of graphs which admit 1-factors with prescribed and proscribed edges.
Prof Aldred is happy to supervise candidates in fourth year honours, M.A., M.Sc. and Ph.D research in Graph Theory, and would welcome enquiries from students wishing to consider problems in the areas mentioned above, and related areas, for possible research topics. He is also willing to act as a co-supervisor to any students whose main area of research may benefit from treatments involving combinatorial techniques. Such areas may, of course, arise from studying problems in disciplines outside of mathematics.
Some recent papers
- Aldred, R. E. L., and Thomassen, C., On the number of cycles in 3-connected cubic graphs.
- Aldred, R. E. L., and Wormald, N. C., More on the Linear k-arboricity of Regular Graphs, in Australasian Journal of Combinatorics, 18, p97 - 104, 1998
- Aldred, R. E. L., Bau, S., Holton, D. A., and McKay, B., Cycles through 23 vertices in 3-connected cubic planar graphs
- Aldred, R. E. L., and Plummer, M. D., On Matching Extensions with Prescribed and Proscribed Edge Sets II
- Aldred, R. E. L., & Plummer, M. D. (2017). Matching extension in prism graphs. Discrete Applied Mathematics, 221, 25-32. doi: 10.1016/j.dam.2016.12.017
- AlBdaiwi, B., Hussain, Z., Cerny, A., & Aldred, R. (2016). Edge-disjoint node-independent spanning trees in dense Gaussian networks. Journal of Supercomputing, 72(12), 4718-4736. doi: 10.1007/s11227-016-1768-x
- AlBdaiwi, B., Hussain, Z., Cerny, A., & Aldred, R. (2016). Edge-disjoint node-independent spanning trees in dense Gaussian networks. arXiv. 15p. Retrieved from http://arxiv.org/abs/1601.06915
- Alahmadi, A., Aldred, R. E. L., de la Cruz, R., Ok, S., Solé, P., & Thomassen, C. (2015). The minimum number of minimal codewords in an n, k-code and in graphic codes. Discrete Applied Mathematics, 184, 32-39. doi: 10.1016/j.dam.2014.11.015
- Alahmadi, A., Aldred, R. E. L., Alkenani, A., Hijazi, R., Solé, P., & Thomassen, C. (2015). Extending a perfect matching to a Hamiltonian cycle. Discrete Mathematics & Theoretical Computer Science, 17(1), 241-254.