Ernest J. Cockayne

Ernest J. Cockayne, S. Herke, Christina M. Mynhardt: Broadcasts and domination in trees. Discrete Mathematics 311(13): 1235-1246 (2011)

Ernest J. Cockayne, R. G. Gibson, Christina M. Mynhardt: Claw-free graphs are not universal fixers. Discrete Mathematics 309(1): 128-133 (2009)

Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt: Open irredundance and maximum degree in graphs. Discrete Mathematics 308(23): 5358-5375 (2008)

Ernest J. Cockayne: Irredundance, secure domination and maximum degree in trees. Discrete Mathematics 307(1): 12-17 (2007)

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

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: On i^--ER-critical graphs. Discrete Mathematics 276(1-3): 111-125 (2004)

Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Roman domination in graphs. Discrete Mathematics 278(1-3): 11-22 (2004)

Ernest J. Cockayne, Art Stephen Finbow: Generalised irredundance in graphs: Nordhaus-Gaddum bounds. Discussiones Mathematicae Graph Theory 24(1): 147-160 (2004)

Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt: Vertices contained in all or in no minimum total dominating set of a tree. Discrete Mathematics 260(1-3): 37-44 (2003)

Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt: Changing upper irredundance by edge addition. Discrete Mathematics 266(1-3): 185-193 (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. Discrete Mathematics 231(1-3): 123-134 (2001)

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

Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt: Nordhaus-Gaddum results for CO-irredundance in graphs. Discrete Mathematics 211: 209-215 (2000)

Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao: Extremal graphs for inequalities involving domination parameters. Discrete Mathematics 216(1-3): 1-10 (2000)

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: On i-minus-Edge-Removal-critical graphs. Electronic Notes in Discrete Mathematics 5: 64-66 (2000)

Ernest J. Cockayne, Gary MacGillivray, Jill Simmons: CO-irredundant Ramsey numbers for graphs. Journal of Graph Theory 34(4): 258-268 (2000)

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech: A characterization of (γ, i)-trees. Journal of Graph Theory 34(4): 277-292 (2000)

Ernest J. Cockayne, Christina M. Mynhardt: On 1-dependent ramsey numbers for graphs. Discussiones Mathematicae Graph Theory 19(1): 93-110 (1999)

Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt: Irredundant and perfect neighbourhood sets in trees. Discrete Mathematics 188(1-3): 253-260 (1998)

Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech: An inequality chain of domination parameters for trees. Discussiones Mathematicae Graph Theory 18(1): 127-142 (1998)

Ernest J. Cockayne, Christina M. Mynhardt: Irredundance and Maximum Degree in Graphs. Combinatorics, Probability & Computing 6(2): 153-157 (1997)

Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt: Domination and irredundance in the queens' graph. Discrete Mathematics 163(1-3): 47-66 (1997)

Ernest J. Cockayne, Christina M. Mynhardt: Domination and irredundance in cubic graphs. Discrete Mathematics 167-168: 205-214 (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. Discrete Mathematics 176(1-3): 43-61 (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. Discrete Mathematics 159(1-3): 57-68 (1996)

S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt: Domination critical graphs with higher independent domination numbers. Journal of Graph Theory 22(1): 9-14 (1996)

Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt: On a Nordhaus-Gaddum type problem for independent domination. Discrete Mathematics 138(1-3): 199-205 (1995)

Ernest J. Cockayne, Christina M. Mynhardt: A characterisation of universal minimal total dominating functions in trees. Discrete Mathematics 141(1-3): 75-84 (1995)

Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu: Total dominating functions in trees: Minimality and convexity. Journal of Graph Theory 19(1): 83-92 (1995)

Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt: Convexity of minimal dominating functions of trees - II. Discrete Mathematics 125(1-3): 137-146 (1994)

Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu: Universal minimal total dominating functions in graphs. Networks 24(2): 83-90 (1994)

Ernest J. Cockayne, Christina M. Mynhardt: The sequence of upper and lower domination, independence and irredundance numbers of a graph. Discrete Mathematics 122(1-3): 89-102 (1993)

Ernest J. Cockayne, Denton E. Hewgill: Improved Computation of Plane Steiner Minimal Trees. Algorithmica 7(2&3): 219-229 (1992)

Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray: The product of the independent domination numbers of a graph and its complement. Discrete Mathematics 90(3): 313-317 (1991)

Ernest J. Cockayne: Chessboard domination problems. Discrete Mathematics 86(1-3): 13-20 (1990)

Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt: On generalised minimal domination parameters for paths. Discrete Mathematics 86(1-3): 89-97 (1990)

Ernest J. Cockayne, Christina M. Mynhardt: On the product of upper irredundance numbers of a graph and its complement. Discrete Mathematics 76(2): 117-121 (1989)

R. C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt: Irredundant ramsey numbers for graphs. Journal of Graph Theory 13(3): 283-290 (1989)

Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar: Gallai theorems for graphs, hypergraphs, and set systems. Discrete Mathematics 72(1-3): 35-47 (1988)

Ernest J. Cockayne, P. H. Spencer: On the independent queens covering problem. Graphs and Combinatorics 4(1): 101-110 (1988)

Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd: Domination parameters for the bishops graph. Discrete Mathematics 58(3): 221-227 (1986)

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

Ernest J. Cockayne, Stephen T. Hedetniemi: On the diagonal queens domination problem. J. Comb. Theory, Ser. A 42(1): 137-139 (1986)

Béla Bollobás, Ernest J. Cockayne: The irredundance number and maximum degree of a graph. Discrete Mathematics 49(2): 197-199 (1984)

Ernest J. Cockayne, A. G. Thomason: Ordered colourings of graphs. J. Comb. Theory, Ser. B 32(3): 286-292 (1982)

Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason: Contributions to the theory of domination, independence and irredundance in graphs. Discrete Mathematics 33(3): 249-258 (1981)

Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi: Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981)

Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi: Total domination in graphs. Networks 10(3): 211-219 (1980)

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): 171-175 (1979)

Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi: Linear Algorithms on Recursive Representations of Trees. J. Comput. Syst. Sci. 18(1): 76-85 (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): 78-80 (1979)

Ernest J. Cockayne, Stephen T. Hedetniemi: Disjoint cliques in regular graphs of degree seven and eight. J. Comb. Theory, Ser. B 24(2): 233-237 (1978)

Ernest J. Cockayne, Bert Hartnell: Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory, Ser. B 23(2-3): 174-183 (1977)

Ernest J. Cockayne, Stephen T. Hedetniemi: Towards a theory of domination in graphs. Networks 7(3): 247-261 (1977)

Ernest J. Cockayne, S. E. Goodman, Stephen T. Hedetniemi: A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4(2): 41-44 (1975)