Dr Kerri Morgan

STAFF PROFILE

Position

Lecturer In Computer Science

Faculty

Faculty of Sci Eng & Built Env

Department

School of Info Technology

Campus

Melbourne Burwood Campus

Contact

kerri.morgan@deakin.edu.au
+61 3 924 46427

Publications

Filter by

2017

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

journal

Algebraic properties of chromatic roots

P Cameron, K Morgan

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

journal

Practical adaptive search trees with performance bounds

K Morgan, K Fray, A Wirth, J Zobel

(2017), Vol. 23, pp. 1-8, ACSC 2017 : Proceedings of the Australasian Computer Science Week, Geelong, Victoria, E1-1

conference
2014

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

journal

Improved optimal and approximate power graph compression for clearer visualisation of dense graphs

T Dwyer, C Mears, K Morgan, T Niven, K Marriott, M Wallace

(2014), pp. 105-112, PacificVic 2014 : Proceedings of the 2014 IEEE Pacific Visualization Symposium, Yokohama, Japan, E1-1

conference

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

journal
2012

Galois groups of chromatic polynomials

K Morgan

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

journal

Non-bipartite chromatic factors

K Morgan, G Farr

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

journal
2011

Pairs of chromatically equivalent graphs

K Morgan

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

journal
2009

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

journal

Certificates of factorisation for chromatic polynomials

K Morgan, G Farr

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

journal
2007

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

journal

Funded Projects at Deakin

No Funded Projects at Deakin found

Supervisions

No completed student supervisions to report