default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnest J. Cockayne
Person information
- affiliation: University of Victoria, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j70]Ernest J. Cockayne, Sarada Herke
, Christina M. Mynhardt:
Broadcasts and domination in trees. Discret. Math. 311(13): 1235-1246 (2011)
2000 – 2009
- 2009
- [j69]Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt:
Claw-free graphs are not universal fixers. Discret. Math. 309(1): 128-133 (2009) - 2008
- [j68]Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt:
Open irredundance and maximum degree in graphs. Discret. Math. 308(23): 5358-5375 (2008) - 2007
- [j67]Ernest J. Cockayne:
Irredundance, secure domination and maximum degree in trees. Discret. Math. 307(1): 12-17 (2007) - 2006
- [j66]Ernest J. Cockayne, Christina M. Mynhardt:
A lower bound for the depression of trees. Australas. J Comb. 35: 319-328 (2006) - 2005
- [j65]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31: 167-178 (2005) - 2004
- [j64]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Total domination in Kr-covered graphs. Ars Comb. 71 (2004) - [j63]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i--ER-critical graphs. Discret. Math. 276(1-3): 111-125 (2004) - [j62]Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Roman domination in graphs. Discret. Math. 278(1-3): 11-22 (2004) - [j61]Ernest J. Cockayne, Art Stephen Finbow:
Generalised irredundance in graphs: Nordhaus-Gaddum bounds. Discuss. Math. Graph Theory 24(1): 147-160 (2004) - 2003
- [j60]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): 37-44 (2003) - [j59]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): 185-193 (2003) - 2001
- [j58]Ernest J. Cockayne, Christina M. Mynhardt:
Properties of Queens graphs and the irredundance number of Q7. Australas. J Comb. 23: 285-300 (2001) - [j57]Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne:
Queens graphs for chessboards on the torus. Australas. J Comb. 24: 231-246 (2001) - [j56]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) - [j55]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): 123-134 (2001) - 2000
- [j54]Ernest J. Cockayne:
Irredundance in the Queen's Graph. Ars Comb. 55 (2000) - [j53]Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt:
Nordhaus-Gaddum results for CO-irredundance in graphs. Discret. Math. 211: 209-215 (2000) - [j52]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): 1-10 (2000) - [j51]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5: 64-66 (2000) - [j50]Ernest J. Cockayne, Gary MacGillivray, Jill Simmons:
CO-irredundant Ramsey numbers for graphs. J. Graph Theory 34(4): 258-268 (2000) - [j49]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. J. Graph Theory 34(4): 277-292 (2000)
1990 – 1999
- 1999
- [j48]Ernest J. Cockayne, Christina M. Mynhardt:
On 1-dependent ramsey numbers for graphs. Discuss. Math. Graph Theory 19(1): 93-110 (1999) - 1998
- [j47]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: 253-262 (1998) - [j46]Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt:
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188(1-3): 253-260 (1998) - [j45]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): 127-142 (1998) - 1997
- [j44]Ernest J. Cockayne, Christina M. Mynhardt:
Irredundance and Maximum Degree in Graphs. Comb. Probab. Comput. 6(2): 153-157 (1997) - [j43]Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Domination and irredundance in the queens' graph. Discret. Math. 163(1-3): 47-66 (1997) - [j42]Ernest J. Cockayne, Christina M. Mynhardt:
Domination and irredundance in cubic graphs. Discret. Math. 167-168: 205-214 (1997) - [j41]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): 43-61 (1997) - 1996
- [j40]Ernest J. Cockayne, Christina M. Mynhardt:
On a generalization of signed dominating functions of graphs. Ars Comb. 43 (1996) - [j39]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Universal maximal packing functions of graphs. Discret. Math. 159(1-3): 57-68 (1996) - [j38]S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Domination critical graphs with higher independent domination numbers. J. Graph Theory 22(1): 9-14 (1996) - 1995
- [j37]Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt:
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995) - [j36]Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt:
On a Nordhaus-Gaddum type problem for independent domination. Discret. Math. 138(1-3): 199-205 (1995) - [j35]Ernest J. Cockayne, Christina M. Mynhardt:
A characterisation of universal minimal total dominating functions in trees. Discret. Math. 141(1-3): 75-84 (1995) - [j34]Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu:
Total dominating functions in trees: Minimality and convexity. J. Graph Theory 19(1): 83-92 (1995) - 1994
- [j33]Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Convexity of minimal dominating functions of trees - II. Discret. Math. 125(1-3): 137-146 (1994) - [j32]Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu:
Universal minimal total dominating functions in graphs. Networks 24(2): 83-90 (1994) - 1993
- [j31]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): 89-102 (1993) - 1992
- [j30]Ernest J. Cockayne, Denton E. Hewgill:
Improved Computation of Plane Steiner Minimal Trees. Algorithmica 7(2&3): 219-229 (1992) - 1991
- [j29]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): 313-317 (1991) - 1990
- [j28]Ernest J. Cockayne:
Chessboard domination problems. Discret. Math. 86(1-3): 13-20 (1990) - [j27]Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt:
On generalised minimal domination parameters for paths. Discret. Math. 86(1-3): 89-97 (1990)
1980 – 1989
- 1989
- [j26]Ernest J. Cockayne, Christina M. Mynhardt:
On the product of upper irredundance numbers of a graph and its complement. Discret. Math. 76(2): 117-121 (1989) - [j25]Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt:
Irredundant ramsey numbers for graphs. J. Graph Theory 13(3): 283-290 (1989) - 1988
- [j24]Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar:
Gallai theorems for graphs, hypergraphs, and set systems. Discret. Math. 72(1-3): 35-47 (1988) - [j23]Ernest J. Cockayne, P. H. Spencer:
On the independent queens covering problem. Graphs Comb. 4(1): 101-110 (1988) - 1986
- [j22]Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
Domination parameters for the bishops graph. Discret. Math. 58(3): 221-227 (1986) - [j21]Ernest J. Cockayne, Denton E. Hewgill:
Exact Computation of Steiner Minimal Trees in the Plane. Inf. Process. Lett. 22(3): 151-156 (1986) - [j20]Ernest J. Cockayne, Stephen T. Hedetniemi:
On the diagonal queens domination problem. J. Comb. Theory A 42(1): 137-139 (1986) - 1985
- [j19]Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
An upper bound for the k-domination number of a graph. J. Graph Theory 9(4): 533-534 (1985) - 1984
- [j18]Béla Bollobás, Ernest J. Cockayne:
The irredundance number and maximum degree of a graph. Discret. Math. 49(2): 197-199 (1984) - [j17]Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao:
Rotation numbers for unions of circuits. J. Graph Theory 8(1): 69-81 (1984) - 1982
- [j16]Ernest J. Cockayne, Andrew G. Thomason:
Ordered colourings of graphs. J. Comb. Theory B 32(3): 286-292 (1982) - [j15]Béla Bollobás, Ernest J. Cockayne:
More rotation numbers for complete bipartite graphs. J. Graph Theory 6(4): 403-411 (1982) - 1981
- [j14]Ernest J. Cockayne, Odile Favaron, C. Payan, Andrew G. Thomason:
Contributions to the theory of domination, independence and irredundance in graphs. Discret. Math. 33(3): 249-258 (1981) - [j13]Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi:
Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981) - 1980
- [j12]Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi:
Total domination in graphs. Networks 10(3): 211-219 (1980)
1970 – 1979
- 1979
- [j11]I. J. Holyer, Ernest J. Cockayne:
On the sum of cardinalities of extremum maximal independent sets. Discret. Math. 26(3): 243-246 (1979) - [j10]Ernest J. Cockayne, Frank Ruskey, Andrew G. Thomason:
An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9(4): 171-175 (1979) - [j9]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) - [j8]Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater:
Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory B 26(1): 78-80 (1979) - [j7]Béla Bollobás, Ernest J. Cockayne:
Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3): 241-249 (1979) - 1978
- [j6]Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi:
A linear algorithm for disjoint matchings in trees. Discret. Math. 21(2): 129-136 (1978) - [j5]Ernest J. Cockayne, Stephen T. Hedetniemi:
Disjoint cliques in regular graphs of degree seven and eight. J. Comb. Theory B 24(2): 233-237 (1978) - 1977
- [j4]Ernest J. Cockayne, Bert L. Hartnell:
Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory B 23(2-3): 174-183 (1977) - [j3]Ernest J. Cockayne, Stephen T. Hedetniemi:
Towards a theory of domination in graphs. Networks 7(3): 247-261 (1977) - 1976
- [j2]Ernest J. Cockayne, Stephen T. Hedetniemi:
Disjoint independent dominating sets in graphs. Discret. Math. 15(3): 213-222 (1976) - 1975
- [j1]Ernest J. Cockayne, Seymour E. Goodman, Stephen T. Hedetniemi:
A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4(2): 41-44 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
