Morgan, K.J., 2012, Galois groups of chromatic polynomials, London Mathematical Society. Journal of Computation and Mathematics [E], vol 15, Cambridge University Press, New York NY USA, pp. 281-307.
Morgan, K.J., Farr, G.E., 2012, Non-bipartite chromatic factors, Discrete Mathematics [P], vol 312, issue 6, Elsevier Science, Amsterdam Netherlands, pp. 1166-1170.
Morgan, K., 2011, Pairs of chromatically equivalent graphs, Graphs and Combinatorics [P], vol 27, issue 4, Springer Tokyo, Tokyo Japan, pp. 547-556.
Morgan, K.J., Farr, G.E., 2009, Certificates of factorisation for a class of triangle-free graphs, The Electronic Journal Of Combinatorics [E], vol 16, issue 1, Electronic Journal of Combinatorics, Newark DE USA, pp. 1-14.
Morgan, K.J., Farr, G.E., 2009, Certificates of factorisation for chromatic polynomials, The Electronic Journal Of Combinatorics [E], vol 16, issue 1, Electronic Journal of Combinatorics, Newark DE USA, pp. 1-29.
Morgan, K.J., Farr, G.E., 2007, Approximation algorithms for the maximum induced planar and outerplanar subgraph problems, Journal of Graph Algorithms and Applications, vol 11, issue 1, Brown University Department of Computer Science, United States, pp. 165-193.
Authorised by: Director, Office of Marketing and Communications.
Maintained by: eSolutions ServiceDesk.
Last updated: 18 February 2013.
Copyright © 2013 Monash University. ABN 12 377 614 012 -
Accessibility -
Caution -
Privacy
CRICOS Provider Number: 00008C
We acknowledge and pay respects to the Elders and Traditional Owners of the land on which our six Australian campuses stand. Information for Indigenous Australians
