Ernest J. Cockayne

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