Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Cockayne, E.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of
y, i)
-trees
E.J. Cockayne
,
O. Favaron
,
C.M. Mynhardt
,
J. Puech
Journal of Graph Theory
34
(4), 2000, pp. 277-292
CO
-irredundant Ramsey numbers for graphs
E.J. Cockayne
,
G. MacGillivray
,
J. Simmons
Journal of Graph Theory
34
(4), 2000, pp. 258-268
Domination critical graphs with higher independent domination numbers
S. Ao
,
E.J. Cockayne
,
G. MacGillivray
,
C.M. Mynhardt
Journal of Graph Theory
22
(1), 1996, pp. 9-14
Total dominating functions in trees: Minimality and convexity
E.J. Cockayne
,
C.M. Mynhardt
,
Bo Yu
Journal of Graph Theory
19
(1), 1995, pp. 83-92
Universal minimal total dominating functions in graphs
E.J. Cockayne
,
C.M. Mynhardt
,
Bo Yu
Networks
24
(2), 1994, pp. 83-90
The irredundant Ramsey number
s(3,3,3) = 13
E.J. Cockayne
,
C.M. Mynhardt
Journal of Graph Theory
18
(6), 1994, pp. 595-604
Improved computation of plane Steiner minimal trees
E.J. Cockayne
,
D.E. Hewgill
Algorithmica
7
, 1992, pp. 219-229
Irredundant Ramsey numbers for graphs
R.C. Brewster
,
E.J. Cockayne
,
C.M. Mynhardt
Journal of Graph Theory
13
(3), 1989, pp. 283-290
On the independent queens covering problem
E.J. Cockayne
,
P.H. Spencer
Graphs and Combinatorics
4
, 1988, pp. 101-110
On the diagonal queens domination problem
E.J. Cockayne
,
S.T. Hedetniemi
Journal of Combinatorial Theory Series A
42
, 1986, pp. 137-139
Exact computation of Steiner Minimal Trees in the plane
E.J. Cockayne
,
D.E. Hewgill
Information Processing Letters
22
(3), 1986, March, pp. 151-156
An upper bound for the
k
-domination number of a graph
E.J. Cockayne
,
B. Gamble
,
B. Shepherd
Journal of Graph Theory
9
(4), 1985, pp. 533-534
Rotation numbers for unions of circuits
Béla Bollobás
,
E.J. Cockayne
,
Fang Zu Yao
Journal of Graph Theory
8
(1), 1984, pp. 69-81
More rotation numbers for complete bipartite graphs
Béla Bollobás
,
E.J. Cockayne
Journal of Graph Theory
6
(4), 1982, pp. 403-411
Ordered colourings of graphs
E.J. Cockayne
,
A.G. Thomason
Journal of Combinatorial Theory Series B
32
, 1982, pp. 286-292
Information dissemination in trees
P.J. Slater
,
E.J. Cockayne
,
S.T. Hedetniemi
SIAM Journal on Computing
10
(4), 1981, November, pp. 692-701
Graph-theoretic parameters concerning domination, independence, and irredundance
B. Bollobás
,
E.J. Cockayne
Journal of Graph Theory
3
(3), 1979, pp. 241-249
Matchings and transversals in hypergraphs, domination and independence in trees
E.J. Cockayne
,
S.T. Hedetniemi
,
P.J. Slater
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 78-80
An algorithm for the most economic link addition in a tree communications network
E.J. Cockayne
,
F. Ruskey
,
A.G. Thomason
Information Processing Letters
9
(4), 1979, November, pp. 171-175
Linear algorithms on recursive representations of trees
S.L. Mitchell
,
E.J. Cockayne
,
S.T. Hedetniemi
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 76-85
Disjoint cliques in regular graphs of degree seven and eight
E.J. Cockayne
,
S.T. Hedetniemi
Journal of Combinatorial Theory Series B
24
(2), 1978, April, pp. 233-237
Edge partitions of complete multipartite graphs into equal length circuits
E.J. Cockayne
,
B.L. Hartnell
Journal of Combinatorial Theory Series B
23
(2-3), 1977, October, pp. 174-183
Disjoint independent dominating sets in graphs
E.J. Cockayne
,
S.T. Hedetniemi
Discrete Mathematics
15
(3), 1976, pp. 213-222
Some tree-star Ramsey numbers
E.J. Cockayne
Journal of Combinatorial Theory Series B
17
, 1974, pp. 183-187
Balancing equal weights on the integer line
R.E. Odeh
,
E.J. Cockayne
Journal of Combinatorial Theory
7
, 1969, pp. 130-135