The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ernest J. Cockayne: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ernest J. Cockayne, Denton E. Hewgill
    Improved Computation of Plane Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:219-229 [Journal]
  2. Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
    Generalised Ramsey Numbers with respect to Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  3. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    Total domination in Kr-covered graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  4. Ernest J. Cockayne, Christina M. Mynhardt
    On a generalization of signed dominating functions of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  5. Ernest J. Cockayne
    Irredundance in the Queen's Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  6. Ernest J. Cockayne, Christina M. Mynhardt
    Irredundance and Maximum Degree in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:153-157 [Journal]
  7. Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
    Roman domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:11-22 [Journal]
  8. Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
    Changing upper irredundance by edge addition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:185-193 [Journal]
  9. Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
    Ramsey properties of generalised irredundant sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:123-134 [Journal]
  10. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    On i--ER-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:111-125 [Journal]
  11. Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt
    Vertices contained in all or in no minimum total dominating set of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:37-44 [Journal]
  12. Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt
    Nordhaus-Gaddum results for CO-irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:209-215 [Journal]
  13. Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao
    Extremal graphs for inequalities involving domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:1-10 [Journal]
  14. Ernest J. Cockayne
    Irredundance, secure domination and maximum degree in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:1, pp:12-17 [Journal]
  15. Ernest J. Cockayne, S. E. Goodman, Stephen T. Hedetniemi
    A Linear Algorithm for the Domination Number of a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:2, pp:41-44 [Journal]
  16. Ernest J. Cockayne, Denton E. Hewgill
    Exact Computation of Steiner Minimal Trees in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:3, pp:151-156 [Journal]
  17. Ernest J. Cockayne, Frank Ruskey, A. G. Thomason
    An Algorithm for the Most Economic Link Addition in a Tree Communication Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:4, pp:171-175 [Journal]
  18. Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi
    Linear Algorithms on Recursive Representations of Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:1, pp:76-85 [Journal]
  19. Ernest J. Cockayne, Stephen T. Hedetniemi
    On the diagonal queens domination problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:137-139 [Journal]
  20. Ernest J. Cockayne, A. G. Thomason
    Ordered colourings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:3, pp:286-292 [Journal]
  21. Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
    Matchings and transversals in hypergraphs, domination and independence-in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:78-80 [Journal]
  22. Ernest J. Cockayne, Stephen T. Hedetniemi
    Disjoint cliques in regular graphs of degree seven and eight. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:2, pp:233-237 [Journal]
  23. Ernest J. Cockayne, Bert Hartnell
    Edge partitions of complete multipartite graphs into equal length circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:174-183 [Journal]
  24. Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
    Information Dissemination in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:692-701 [Journal]
  25. Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason
    Contributions to the theory of domination, independence and irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:249-258 [Journal]
  26. Ernest J. Cockayne, B. Gamble, B. Shepherd
    Domination parameters for the bishops graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:221-227 [Journal]
  27. Béla Bollobás, Ernest J. Cockayne
    The irredundance number and maximum degree of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:2, pp:197-199 [Journal]
  28. Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar
    Gallai theorems for graphs, hypergraphs, and set systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:35-47 [Journal]
  29. Ernest J. Cockayne, Christina M. Mynhardt
    On the product of upper irredundance numbers of a graph and its complement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:2, pp:117-121 [Journal]
  30. Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
    Irredundant and perfect neighbourhood sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:253-260 [Journal]
  31. Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
    Using maximality and minimality conditions to construct inequality chains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:43-61 [Journal]
  32. Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt
    Domination and irredundance in the queens' graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:47-66 [Journal]
  33. Ernest J. Cockayne, Christina M. Mynhardt
    Domination and irredundance in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:205-214 [Journal]
  34. Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt
    On generalised minimal domination parameters for paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:89-97 [Journal]
  35. Ernest J. Cockayne
    Chessboard domination problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:13-20 [Journal]
  36. Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray
    The product of the independent domination numbers of a graph and its complement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:3, pp:313-317 [Journal]
  37. Ernest J. Cockayne, Christina M. Mynhardt
    A characterisation of universal minimal total dominating functions in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:75-84 [Journal]
  38. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    Universal maximal packing functions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:57-68 [Journal]
  39. Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt
    On a Nordhaus-Gaddum type problem for independent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:199-205 [Journal]
  40. Ernest J. Cockayne, Christina M. Mynhardt
    The sequence of upper and lower domination, independence and irredundance numbers of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:89-102 [Journal]
  41. Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
    Convexity of minimal dominating functions of trees - II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:137-146 [Journal]

  42. Open irredundance and maximum degree in graphs. [Citation Graph (, )][DBLP]


  43. Claw-free graphs are not universal fixers. [Citation Graph (, )][DBLP]


Search in 0.123secs, Finished in 0.126secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002