Ernest J. Cockayne

Publication Activity (10 Years)

Years Active: 1975-2011
Publications (10 Years): 0

Publications

Ernest J. Cockayne, Sarada Herke, Christina M. Mynhardt
Broadcasts and domination in trees. Discret. Math. 311 (13) (2011)
Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt
Claw-free graphs are not universal fixers. Discret. Math. 309 (1) (2009)
Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
Open irredundance and maximum degree in graphs. Discret. Math. 308 (23) (2008)
Ernest J. Cockayne
Irredundance, secure domination and maximum degree in trees. Discret. Math. 307 (1) (2007)
Ernest J. Cockayne, Christina M. Mynhardt
A lower bound for the depression of trees. Australas. J Comb. 35 (2006)
Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31 (2005)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Total domination in Kr-covered graphs. Ars Comb. 71 (2004)
Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
Roman domination in graphs. Discret. Math. 278 (1-3) (2004)
Ernest J. Cockayne, Art Stephen Finbow
Generalised irredundance in graphs: Nordhaus-Gaddum bounds. Discuss. Math. Graph Theory 24 (1) (2004)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
-ER-critical graphs. Discret. Math. 276 (1-3) (2004)
Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt
Vertices contained in all or in no minimum total dominating set of a tree. Discret. Math. 260 (1-3) (2003)
Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
Changing upper irredundance by edge addition. Discret. Math. 266 (1-3) (2003)
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
Generalised Ramsey Numbers with respect to Classes of Graphs. Ars Comb. 59 (2001)
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
Ramsey properties of generalised irredundant sets in graphs. Discret. Math. 231 (1-3) (2001)
Ernest J. Cockayne, Christina M. Mynhardt
. Australas. J Comb. 23 (2001)
Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne
Queens graphs for chessboards on the torus. Australas. J Comb. 24 (2001)
Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao
Extremal graphs for inequalities involving domination parameters. Discret. Math. 216 (1-3) (2000)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
)-trees. J. Graph Theory 34 (4) (2000)
Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt
Nordhaus-Gaddum results for CO-irredundance in graphs. Discret. Math. 211 (2000)
Ernest J. Cockayne
Irredundance in the Queen's Graph. Ars Comb. 55 (2000)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5 (2000)
Ernest J. Cockayne, Gary MacGillivray, Jill Simmons
CO-irredundant Ramsey numbers for graphs. J. Graph Theory 34 (4) (2000)
Ernest J. Cockayne, Christina M. Mynhardt
On 1-dependent ramsey numbers for graphs. Discuss. Math. Graph Theory 19 (1) (1999)
Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188 (1-3) (1998)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
An inequality chain of domination parameters for trees. Discuss. Math. Graph Theory 18 (1) (1998)
Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. Australas. J Comb. 18 (1998)
Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in cubic graphs. Discret. Math. (1997)
Ernest J. Cockayne, Christina M. Mynhardt
Irredundance and Maximum Degree in Graphs. Comb. Probab. Comput. 6 (2) (1997)
Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
Domination and irredundance in the queens' graph. Discret. Math. 163 (1-3) (1997)
Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
Using maximality and minimality conditions to construct inequality chains. Discret. Math. 176 (1-3) (1997)
Ernest J. Cockayne, Christina M. Mynhardt
On a generalization of signed dominating functions of graphs. Ars Comb. 43 (1996)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Universal maximal packing functions of graphs. Discret. Math. 159 (1-3) (1996)
S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22 (1) (1996)
Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995)
Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt
On a Nordhaus-Gaddum type problem for independent domination. Discret. Math. 138 (1-3) (1995)
Ernest J. Cockayne, Christina M. Mynhardt
A characterisation of universal minimal total dominating functions in trees. Discret. Math. 141 (1-3) (1995)
Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu
Total dominating functions in trees: Minimality and convexity. J. Graph Theory 19 (1) (1995)
Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu
Universal minimal total dominating functions in graphs. Networks 24 (2) (1994)
Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Convexity of minimal dominating functions of trees - II. Discret. Math. 125 (1-3) (1994)
Ernest J. Cockayne, Christina M. Mynhardt
The sequence of upper and lower domination, independence and irredundance numbers of a graph. Discret. Math. 122 (1-3) (1993)
Ernest J. Cockayne, Denton E. Hewgill
Improved Computation of Plane Steiner Minimal Trees. Algorithmica 7 (2&3) (1992)
Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray
The product of the independent domination numbers of a graph and its complement. Discret. Math. 90 (3) (1991)
Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt
On generalised minimal domination parameters for paths. Discret. Math. 86 (1-3) (1990)
Ernest J. Cockayne
Chessboard domination problems. Discret. Math. 86 (1-3) (1990)
Ernest J. Cockayne, Christina M. Mynhardt
On the product of upper irredundance numbers of a graph and its complement. Discret. Math. 76 (2) (1989)
Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt
Irredundant ramsey numbers for graphs. J. Graph Theory 13 (3) (1989)
Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar
Gallai theorems for graphs, hypergraphs, and set systems. Discret. Math. 72 (1-3) (1988)
Ernest J. Cockayne, P. H. Spencer
On the independent queens covering problem. Graphs Comb. 4 (1) (1988)
Ernest J. Cockayne, Denton E. Hewgill
Exact Computation of Steiner Minimal Trees in the Plane. Inf. Process. Lett. 22 (3) (1986)
Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd
Domination parameters for the bishops graph. Discret. Math. 58 (3) (1986)
Ernest J. Cockayne, Stephen T. Hedetniemi
On the diagonal queens domination problem. J. Comb. Theory, Ser. A 42 (1) (1986)
Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd
-domination number of a graph. J. Graph Theory 9 (4) (1985)
Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao
Rotation numbers for unions of circuits. J. Graph Theory 8 (1) (1984)
Béla Bollobás, Ernest J. Cockayne
The irredundance number and maximum degree of a graph. Discret. Math. 49 (2) (1984)
Ernest J. Cockayne, A. G. Thomason
Ordered colourings of graphs. J. Comb. Theory, Ser. B 32 (3) (1982)
Béla Bollobás, Ernest J. Cockayne
More rotation numbers for complete bipartite graphs. J. Graph Theory 6 (4) (1982)
Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason
Contributions to the theory of domination, independence and irredundance in graphs. Discret. Math. 33 (3) (1981)
Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
Information Dissemination in Trees. SIAM J. Comput. 10 (4) (1981)
Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi
Total domination in graphs. Networks 10 (3) (1980)
I. J. Holyer, Ernest J. Cockayne
On the sum of cardinalities of extremum maximal independent sets. Discret. Math. 26 (3) (1979)
Béla Bollobás, Ernest J. Cockayne
Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3 (3) (1979)
Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory, Ser. B 26 (1) (1979)
Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi
Linear Algorithms on Recursive Representations of Trees. J. Comput. Syst. Sci. 18 (1) (1979)
Ernest J. Cockayne, Frank Ruskey, A. G. Thomason
An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9 (4) (1979)
Ernest J. Cockayne, Stephen T. Hedetniemi
Disjoint cliques in regular graphs of degree seven and eight. J. Comb. Theory, Ser. B 24 (2) (1978)
Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi
A linear algorithm for disjoint matchings in trees. Discret. Math. 21 (2) (1978)
Ernest J. Cockayne, Stephen T. Hedetniemi
Towards a theory of domination in graphs. Networks 7 (3) (1977)
Ernest J. Cockayne, Bert L. Hartnell
Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory, Ser. B 23 (2-3) (1977)
Ernest J. Cockayne, Stephen T. Hedetniemi
Disjoint independent dominating sets in graphs. Discret. Math. 15 (3) (1976)
Ernest J. Cockayne, Seymour E. Goodman, Stephen T. Hedetniemi
A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4 (2) (1975)