Dr Kerri Morgan

Tackling the maximum happy vertices problem in large networks

D Thiruvady, R Lewis, K Morgan

(2020), pp. 1-21, 4OR, Berlin, Germany, C1

Further results on an abstract model for branching and its application to mixed integer programming

D Anderson, P Le Bodic, K Morgan

(2020), Mathematical Programming, C1

Finding happiness: an analysis of the maximum happy vertices problem

R Lewis, D Thiruvady, K Morgan

(2019), Vol. 103, pp. 265-276, Computers and operations research, Amsterdam, The Netherlands, C1

An algorithm which outputs a graph with a specified chromatic factor

D Delbourgo, K Morgan

(2019), Vol. 257, pp. 128-150, Discrete applied mathematics, Amsterdam, The Netherlands, C1

Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing

D Thiruvady, K Morgan, A Amir, A Ernst

(2019), International journal of production research, Abingdon, Eng., C1

Short certificates for chromatic equivalence

Zoe Bukovac, Graham Farr, Kerri Morgan

(2019), Vol. 23, pp. 227-269, Journal of graph algorithms and applications, Providence, R.I., C1

"Power to the people!": Social media discourse on regional energy issues in Australia

K Morgan, M Cheong, S Bedingfield

(2018), Vol. 22, Australasian journal of information systems, Bruce, A.C.T., C1

An infinite family of 2-connected graphs that have reliability factorisations

K Morgan, R Chen

(2017), Vol. 218, pp. 123-127, Discrete applied mathematics, Amsterdam, The Netherlands, C1-1

Algebraic properties of chromatic roots

P Cameron, K Morgan

(2017), Vol. 24, pp. 1-14, Electronic journal of combinatorics, [Atlanata, Ga.], C1-1

Algebraic invariants arising from the chromatic polynomials of theta graphs

D Delbourgo, K Morgan

(2014), Vol. 59, pp. 293-310, Australasian journal of combinatorics, St. Lucia, Qld., C1-1

Certificates for properties of stability polynomials of graphs

R Mo, G Farr, K Morgan

(2014), Vol. 21, pp. 1-25, Electronic journal of combinatorics, [Atlanata, Ga.], C1-1

Galois groups of chromatic polynomials

K Morgan

(2012), Vol. 15, pp. 281-307, LMS journal of computation and mathematics, Cambridge, Eng., C1-1

Non-bipartite chromatic factors

K Morgan, G Farr

(2012), Vol. 312, pp. 1166-1170, Discrete mathematics, Amsterdam, The Netherlands, C1-1

Pairs of chromatically equivalent graphs

K Morgan

(2011), Vol. 27, pp. 547-556, Graphs and combinatorics, Tokyo, Japan, C1-1

Certificates of factorisation for a class of triangle-free graphs

K Morgan, G Farr

(2009), Vol. 16, pp. 1-14, Electronic Journal of Combinatorics, Atlanta, Ga., C1-1

Certificates of factorisation for chromatic polynomials

K Morgan, G Farr

(2009), Vol. 16, pp. 1-29, Electronic Journal of Combinatorics, Atlanta, Ga., C1-1

Approximation algorithms for the maximum induced planar and outerplanar subgraph problems

K Morgan, G Farr

(2007), Vol. 11, pp. 165-193, Journal of Graph Algorithms and Applications, Providence, R.I., C1-1