Papers in honour of Professor Ernest J. Cockayne
Dedication: Professor Ernest J. Cockayne (on the occasion of his 60th birthday)
Mynhardt, Kieka
J. Comb. Math. Comb. Comput. 33, 3-8 (2000).
Path-free domination
Haynes, Teresa W.; Henning, Michael A.
J. Comb. Math. Comb. Comput. 33, 9-21 (2000).
On the number of edges in a graph with given domination-type parameters
Domke, Gayla S.; Hattingh, Johannes H.; Markus, Lisa R.
J. Comb. Math. Comb. Comput. 33, 23-32 (2000).
Small irredundance numbers for queens graphs
Burger, A. P.; Mynhardt, C. M.
J. Comb. Math. Comb. Comput. 33, 33-43 (2000).
Choosability of bipartite graphs
Ferneyhough, Sheila; MacGillivray, Gary
J. Comb. Math. Comb. Comput. 33, 45-63 (2000).
Sensitivity of the upper irredundance number to edge addition
Dunbar, J. E.; Monroe, T. R.; Whitehead, C. A.
J. Comb. Math. Comb. Comput. 33, 65-79 (2000).
Stratified claw domination in prisms
Chartrand, Gary; Haynes, Teresa W.; Henning, Michael A.; Zhang, Ping
J. Comb. Math. Comb. Comput. 33, 81-96 (2000).
On the existence of shortest directed networks
Swanepoel, Konrad J.
J. Comb. Math. Comb. Comput. 33, 97-102 (2000).
Proper edge-colourings of complete graphs
Grannell, M. J.; Griggs, T. S.; Quinn, K. A. S.; Kocay, W. L.; Stanton, R. G.
J. Comb. Math. Comb. Comput. 33, 103-116 (2000).
The lower irredundance and domination parameters are equal for inflated trees
Puech, Joël
J. Comb. Math. Comb. Comput. 33, 117-127 (2000).
Wojcicka’s theorem: Complete, consolidated proof
Moodley, Lohini
J. Comb. Math. Comb. Comput. 33, 129-179 (2000).
On the irregularity cost of a tree
Oellermann, Ortrud R.
J. Comb. Math. Comb. Comput. 33, 181-192 (2000).
Discrepancy of complex sequences via compressibility
Davie, George
J. Comb. Math. Comb. Comput. 33, 193-197 (2000).
Discrepancies of hypergraphs of high Kolmogorov complexity
Fouché, Willem L.
J. Comb. Math. Comb. Comput. 33, 199-207 (2000).
Independent chess pieces on Euclidean boards
Bode, Jens-P.; Harborth, Heiko
J. Comb. Math. Comb. Comput. 33, 209-223 (2000).
Distance-k independent domination sequences
Favaron, Odile; Haynes, Teresa W.; Slater, Peter J.
J. Comb. Math. Comb. Comput. 33, 225-237 (2000).
Upper domination parameters and edge-critical graphs
Grobler, P. J. P.; Mynhardt, C. M.
J. Comb. Math. Comb. Comput. 33, 239-251 (2000).
A note on the proof of Shannon inequality
Wan, Honghui
J. Comb. Math. Comb. Comput. 33, 253-255 (2000).
Fall colorings of graphs
Dunbar, J. E.; Hedetniemi, S. M.; Hedetniemi, S. T.; Jacobs, D. P.; Knisely, J.; Laskar, R. C.; Rall, D. F.
J. Comb. Math. Comb. Comput. 33, 257-273 (2000).
On the minimum influence of a maximal packing
Phillips, James B.; Slater, Peter J.
J. Comb. Math. Comb. Comput. 33, 275-288 (2000).
Partitions of countable posets
Pretorius, L. M.; Swanepoel, C. J.
J. Comb. Math. Comb. Comput. 33, 289-297 (2000).
Sets of mutually quasi-orthogonal Latin squares
Bedford, David; Whitaker, Roger M.
J. Comb. Math. Comb. Comput. 33, 299-310 (2000).
On minimizing the effects of fire or a virus on a network
Finbow, S.; Hartnell, B.; Li, Q.; Schmeisser, K.
J. Comb. Math. Comb. Comput. 33, 311-322 (2000).
Loop-free sequencing of bounded integer compositions
Walsh, Timothy R.
J. Comb. Math. Comb. Comput. 33, 323-345 (2000).
