Publications
- D. Delbourgo and K. Morgan. Algebraic invariants arising from the chromatic polynomials of theta graphs. Australasian Journal of Combinatorics, 59:293-310, 2014.
- R. Mo, G. Farr and K. Morgan. Certificates for properties of stability polynomials of graphs. The Electronic Journal Of Combinatorics, 21:Research Paper P1.66 (25 pages), 2014.
- T. Dwyer, C. Mears, K. Morgan, T. Niven, K. Marriott, and M. Wallace. Improved optimal and approximate power graph compression for clearer visualisation of dense graphs. Proceedings of the 2014 IEEE Pacific Visualization Symposium (PacificVis 2014), pp. 105-112, 2014.
- K. Morgan. Galois groups of chromatic polynomials. London Mathematical Society Journal of Computation and Mathematics, 15:281-307, 2012.
- K. Morgan and G. Farr. Non-bipartite chromatic factors. Discrete Mathematics, 312:1166-1170, 2012.
-
K. Morgan. Pairs of chromatically equivalent graphs. Graphs and Combinatorics, 27:547-556, 2010.
- K. Morgan and G. Farr. Certificates of factorisation for chromatic polynomials. Electronic Journal of Combinatorics, 16: Research Paper R74 (29 pages), 2009.
-
K. Morgan and G. Farr. Certificates of factorisation for a class of triangle-free graphs. Electronic Journal of Combinatorics, 16: Research Paper R75 (14 pages), 2009.
- K. Morgan and G. Farr. Approximation algorithms for the maximum induced planar and outerplanar subgraph problem. Journal of Graph Algorithms and Applications, 11:165-193, 2007.