A Linear Algorithm for the Domination Number of a Tree. - Ernest J. Cockayne; Seymour E. Goodman; Stephen T. Hedetniemi (Inf. Process. Lett., 1975)

Disjoint independent dominating sets in graphs. - Ernest J. Cockayne; Stephen T. Hedetniemi (Discret. Math., 1976)

Edge partitions of complete multipartite graphs into equal length circuits. - Ernest J. Cockayne; Bert L. Hartnell (J. Comb. Theory B, 1977)

Towards a theory of domination in graphs. - Ernest J. Cockayne; Stephen T. Hedetniemi (Networks, 1977)

A linear algorithm for disjoint matchings in trees. - Ernest J. Cockayne; Bert L. Hartnell; Stephen T. Hedetniemi (Discret. Math., 1978)

Disjoint cliques in regular graphs of degree seven and eight. - Ernest J. Cockayne; Stephen T. Hedetniemi (J. Comb. Theory B, 1978)

On the sum of cardinalities of extremum maximal independent sets. - I. J. Holyer; Ernest J. Cockayne (Discret. Math., 1979)

An Algorithm for the Most Economic Link Addition in a Tree Communication Network. - Ernest J. Cockayne; Frank Ruskey; Andrew G. Thomason (Inf. Process. Lett., 1979)

Linear Algorithms on Recursive Representations of Trees. - Sandra L. Mitchell; Ernest J. Cockayne; Stephen T. Hedetniemi (J. Comput. Syst. Sci., 1979)

Matchings and transversals in hypergraphs, domination and independence-in trees. - Ernest J. Cockayne; Stephen T. Hedetniemi; Peter J. Slater (J. Comb. Theory B, 1979)

Graph-theoretic parameters concerning domination, independence, and irredundance. - Béla Bollobás; Ernest J. Cockayne (J. Graph Theory, 1979)

Total domination in graphs. - Ernest J. Cockayne; R. M. Dawes; Stephen T. Hedetniemi (Networks, 1980)

Contributions to the theory of domination, independence and irredundance in graphs. - Ernest J. Cockayne; Odile Favaron; C. Payan; Andrew G. Thomason (Discret. Math., 1981)

Information Dissemination in Trees. - Peter J. Slater; Ernest J. Cockayne; Stephen T. Hedetniemi (SIAM J. Comput., 1981)

Ordered colourings of graphs. - Ernest J. Cockayne; Andrew G. Thomason (J. Comb. Theory B, 1982)

More rotation numbers for complete bipartite graphs. - Béla Bollobás; Ernest J. Cockayne (J. Graph Theory, 1982)

The irredundance number and maximum degree of a graph. - Béla Bollobás; Ernest J. Cockayne (Discret. Math., 1984)

Rotation numbers for unions of circuits. - Béla Bollobás; Ernest J. Cockayne; Fang Zu Yao (J. Graph Theory, 1984)

An upper bound for the k-domination number of a graph. - Ernest J. Cockayne; B. Gamble; F. Bruce Shepherd (J. Graph Theory, 1985)

Domination parameters for the bishops graph. - Ernest J. Cockayne; B. Gamble; F. Bruce Shepherd (Discret. Math., 1986)

Exact Computation of Steiner Minimal Trees in the Plane. - Ernest J. Cockayne; Denton E. Hewgill (Inf. Process. Lett., 1986)

On the diagonal queens domination problem. - Ernest J. Cockayne; Stephen T. Hedetniemi (J. Comb. Theory A, 1986)

Gallai theorems for graphs, hypergraphs, and set systems. - Ernest J. Cockayne; Stephen T. Hedetniemi; Renu C. Laskar (Discret. Math., 1988)

On the independent queens covering problem. - Ernest J. Cockayne; P. H. Spencer (Graphs Comb., 1988)

On the product of upper irredundance numbers of a graph and its complement. - Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1989)

Irredundant ramsey numbers for graphs. - Richard C. Brewster; Ernest J. Cockayne; Christina M. Mynhardt (J. Graph Theory, 1989)

On generalised minimal domination parameters for paths. - Béla Bollobás; Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1990)

Chessboard domination problems. - Ernest J. Cockayne (Discret. Math., 1990)

The product of the independent domination numbers of a graph and its complement. - Ernest J. Cockayne; Odile Favaron; Hao Li 002; Gary MacGillivray (Discret. Math., 1991)

Improved Computation of Plane Steiner Minimal Trees. - Ernest J. Cockayne; Denton E. Hewgill (Algorithmica, 1992)

The sequence of upper and lower domination, independence and irredundance numbers of a graph. - Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1993)

Convexity of minimal dominating functions of trees - II. - Ernest J. Cockayne; Gary MacGillivray; Christina M. Mynhardt (Discret. Math., 1994)

Universal minimal total dominating functions in graphs. - Ernest J. Cockayne; Christina M. Mynhardt; Bo Yu 001 (Networks, 1994)

Properties of minimal dominating functions of graphs. - Ernest J. Cockayne; Gerd Fricke; Stephen T. Hedetniemi; Christina M. Mynhardt (Ars Comb., 1995)

On a Nordhaus-Gaddum type problem for independent domination. - Ernest J. Cockayne; Gerd Fricke; Christina M. Mynhardt (Discret. Math., 1995)

A characterisation of universal minimal total dominating functions in trees. - Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1995)

Total dominating functions in trees: Minimality and convexity. - Ernest J. Cockayne; Christina M. Mynhardt; Bo Yu 001 (J. Graph Theory, 1995)

On a generalization of signed dominating functions of graphs. - Ernest J. Cockayne; Christina M. Mynhardt (Ars Comb., 1996)

Universal maximal packing functions of graphs. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt (Discret. Math., 1996)

Domination critical graphs with higher independent domination numbers. - S. Ao; Ernest J. Cockayne; Gary MacGillivray; Christina M. Mynhardt (J. Graph Theory, 1996)

Irredundance and Maximum Degree in Graphs. - Ernest J. Cockayne; Christina M. Mynhardt (Comb. Probab. Comput., 1997)

Domination and irredundance in the queens' graph. - Alewyn P. Burger; Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1997)

Using maximality and minimality conditions to construct inequality chains. - Ernest J. Cockayne; Johannes H. Hattingh; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Alice A. McRae (Discret. Math., 1997)

Domination and irredundance in cubic graphs. - Ernest J. Cockayne; Christina M. Mynhardt (Discret. Math., 1997)

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. - Ernest J. Cockayne; Odile Favaron; Joël Puech; Christina M. Mynhardt (Australas. J Comb., 1998)

Irredundant and perfect neighbourhood sets in trees. - Ernest J. Cockayne; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Christina M. Mynhardt (Discret. Math., 1998)

An inequality chain of domination parameters for trees. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt; Joël Puech (Discuss. Math. Graph Theory, 1998)

On 1-dependent ramsey numbers for graphs. - Ernest J. Cockayne; Christina M. Mynhardt (Discuss. Math. Graph Theory, 1999)

Irredundance in the Queen's Graph. - Ernest J. Cockayne (Ars Comb., 2000)

Nordhaus-Gaddum results for CO-irredundance in graphs. - Ernest J. Cockayne; Devon McCrea; Christina M. Mynhardt (Discret. Math., 2000)

Extremal graphs for inequalities involving domination parameters. - Baogen Xu; Ernest J. Cockayne; Teresa W. Haynes; Stephen T. Hedetniemi; Zhou Shangchao (Discret. Math., 2000)

On i-minus-Edge-Removal-critical graphs. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt (Electron. Notes Discret. Math., 2000)

A characterization of (γ, i)-trees. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt; Joël Puech (J. Graph Theory, 2000)

CO-irredundant Ramsey numbers for graphs. - Ernest J. Cockayne; Gary MacGillivray; Jill Simmons (J. Graph Theory, 2000)

Queens graphs for chessboards on the torus. - Alewyn P. Burger; Christina M. Mynhardt; Ernest J. Cockayne (Australas. J Comb., 2001)

Properties of Queens graphs and the irredundance number of Q7. - Ernest J. Cockayne; Christina M. Mynhardt (Australas. J Comb., 2001)

Generalised Ramsey Numbers with respect to Classes of Graphs. - Ernest J. Cockayne; Odile Favaron; Paul J. P. Grobler; Christina M. Mynhardt; Joël Puech (Ars Comb., 2001)

Ramsey properties of generalised irredundant sets in graphs. - Ernest J. Cockayne; Odile Favaron; Paul J. P. Grobler; Christina M. Mynhardt; Joël Puech (Discret. Math., 2001)

Changing upper irredundance by edge addition. - Ernest J. Cockayne; Odile Favaron; Wayne Goddard; Paul J. P. Grobler; Christina M. Mynhardt (Discret. Math., 2003)

Vertices contained in all or in no minimum total dominating set of a tree. - Ernest J. Cockayne; Michael A. Henning; Christina M. Mynhardt (Discret. Math., 2003)

Total domination in Kr-covered graphs. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt (Ars Comb., 2004)

Roman domination in graphs. - Ernest J. Cockayne; Paul A. Dreyer Jr.; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi (Discret. Math., 2004)

On i--ER-critical graphs. - Ernest J. Cockayne; Odile Favaron; Christina M. Mynhardt (Discret. Math., 2004)

Generalised irredundance in graphs: Nordhaus-Gaddum bounds. - Ernest J. Cockayne; Art Stephen Finbow (Discuss. Math. Graph Theory, 2004)

Altitude of small complete and complete bipartite graphs. - Alewyn P. Burger; Ernest J. Cockayne; Christina M. Mynhardt (Australas. J Comb., 2005)

A lower bound for the depression of trees. - Ernest J. Cockayne; Christina M. Mynhardt (Australas. J Comb., 2006)

Irredundance, secure domination and maximum degree in trees. - Ernest J. Cockayne (Discret. Math., 2007)

Open irredundance and maximum degree in graphs. - Ernest J. Cockayne; Odile Favaron; Art S. Finbow; Christina M. Mynhardt (Discret. Math., 2008)

Claw-free graphs are not universal fixers. - Ernest J. Cockayne; Richard G. Gibson; Christina M. Mynhardt (Discret. Math., 2009)

Broadcasts and domination in trees. - Ernest J. Cockayne; Sarada Herke; Christina M. Mynhardt (Discret. Math., 2011)