If you made any changes in Pure these will be visible here soon.

Research Output 2007 2018

2018
Open Access
File
2017

Algebraic properties of chromatic roots

Cameron, P. J. & Morgan, K., 3 Feb 2017, In : Electronic Journal of Combinatorics. 24, 1, 14 p., #P1.21.

Research output: Contribution to journalArticleResearchpeer-review

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

Morgan, K. & Chen, R., 19 Feb 2017, In : Discrete Applied Mathematics. 218, p. 123-127 5 p.

Research output: Contribution to journalArticleResearchpeer-review

Practical adaptive search trees with performance bounds

Fray, K., Morgan, K., Wirth, A. & Zobel, J., 2017, ACSW '17 Proceedings of the Australasian Computer Science Week Multiconference: January 31 – February 3, 2017. Deakin University Waterfront Campus. Strazdins, P. & Hobbs, M. (eds.). New York NY USA: Association for Computing Machinery (ACM), 8 p. a23

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

2014

Algebraic invariants arising from the chromatic polynomials of theta graphs

Delbourgo, D. & Morgan, K. J-A., 2014, In : Australasian Journal of Combinatorics. 59, 2, p. 293 - 310 18 p.

Research output: Contribution to journalArticleResearchpeer-review

Certificates for properties of stability polynomials of graphs

Mo, R., Farr, G. E. & Morgan, K. J-A., 2014, In : The Electronic Journal of Combinatorics. 21, 1, p. 1 - 25 25 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access

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

Dwyer, T. G., Mears, C. D., Morgan, K. J-A., Niven, T. M., Marriott, K. G. & Wallace, M., 2014, Proceedings of the 2014 IEEE Pacific Visualization Symposium (PacificVis 2014). Brandes, U., Hagen, H. & Takahashi, S. (eds.). Los Alamitos CA USA: IEEE Computer Society, p. 105 - 112 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2012

Galois groups of chromatic polynomials

Morgan, K. J-A., 2012, In : LMS Journal of Computation and Mathematics. 15, p. 281 - 307 27 p.

Research output: Contribution to journalArticleResearchpeer-review

Non-bipartite chromatic factors

Morgan, K. J-A. & Farr, G. E., 2012, In : Discrete Mathematics. 312, 6, p. 1166 - 1170 5 p.

Research output: Contribution to journalArticleResearchpeer-review

2011

Pairs of chromatically equivalent graphs

Morgan, K., 2011, In : Graphs and Combinatorics. 27, 4, p. 547 - 556 10 p.

Research output: Contribution to journalArticleResearchpeer-review

2009

Certificates of factorisation for a class of triangle-free graphs

Morgan, K. J-A. & Farr, G. E., 2009, In : The Electronic Journal of Combinatorics. 16, 1, p. 1 - 14 14 p.

Research output: Contribution to journalArticleResearchpeer-review

Certificates of factorisation for chromatic polynomials

Morgan, K. J-A. & Farr, G. E., 2009, In : The Electronic Journal of Combinatorics. 16, 1, p. 1 - 29 29 p.

Research output: Contribution to journalArticleResearchpeer-review

2007

Approximation algorithms for the maximum induced planar and outerplanar subgraph problems

Morgan, K. J-A. & Farr, G. E., 2007, In : Journal of Graph Algorithms and Applications. 11, 1, p. 165 - 193 29 p.

Research output: Contribution to journalArticleResearchpeer-review