Papers in honour of Stephen T. Hedetniemi
Slater, Peter (ed.)
J. Comb. Math. Comb. Comput. 31, 253 p. (1999).
Dedication: Professor Stephen T. Hedetniemi. (Born: February 7, 1939)
Slater, Peter J.
J. Comb. Math. Comb. Comput. 31, 3-14 (1999).
Generalized irredundance in graphs: Hereditary properties and Ramsey numbers
Cockayne, E. J.
J. Comb. Math. Comb. Comput. 31, 15-31 (1999).
Strong distance in strong digraphs
Chartrand, Gary; Erwin, David; Raines, Michael; Zhang, Ping
J. Comb. Math. Comb. Comput. 31, 33-44 (1999).
A characterisation of graphs with minimum degree 2 and domination number exceeding a third their size
Henning, Michael A.
J. Comb. Math. Comb. Comput. 31, 45-64 (1999).
MAD partitioning for grid graphs
Meiers, Debra L.; Slater, Peter J.
J. Comb. Math. Comb. Comput. 31, 65-83 (1999).
A reduction principle concerning minumum dominating sets in graphs
Volkmann, Lutz
J. Comb. Math. Comb. Comput. 31, 85-90 (1999).
Well-spread sequences
Phillips, N. C. K.; Wallis, W. D.
J. Comb. Math. Comb. Comput. 31, 91-96 (1999).
Queens on hexagonal boards
Burger, A. P.; Mynhardt, C. M.
J. Comb. Math. Comb. Comput. 31, 97-111 (1999).
Extremal domination insensitive graphs
Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 31, 113-127 (1999).
On tournaments with domination number exactly k
Duncan, Jack R.; Jacobson, Michael S.
J. Comb. Math. Comb. Comput. 31, 129-136 (1999).
Path kernles and partitions
Dunbar, Jean E.; Frick, Marietjie
J. Comb. Math. Comb. Comput. 31, 137-149 (1999).
The ratio of three domination parameters in some classes of claw-free graphs
Favaron, Odile; Kabanov, Vladislav; Puech, Joël
J. Comb. Math. Comb. Comput. 31, 151-159 (1999).
A note on relations between a graph and its line graph which involve domination concepts
Dutton, Ronald D.
J. Comb. Math. Comb. Comput. 31, 161-168 (1999).
Connected domination graphs of tournaments
Fisher, David C.; Lundgren, J. Richard; Merz, Sarah K.; Reid, K. B.
J. Comb. Math. Comb. Comput. 31, 169-176 (1999).
Disjoint cycles in planar and triangle-free graphs
Markus, L. R.
J. Comb. Math. Comb. Comput. 31, 177-182 (1999).
Linear algorithms for w-medians of graphs
Lee, Hai-Yen; Chang, Gerard J.
J. Comb. Math. Comb. Comput. 31, 183-192 (1999).
A modification of the Schreier-Sims algorithm utilising the transitivity of the stabiliser subgroups
Kocay, William
J. Comb. Math. Comb. Comput. 31, 193-206 (1999).
Consecutive labelings for graphs
Jacobson, Michael S.; Kubicka, Ewa; Kubicki, Grzegorz
J. Comb. Math. Comb. Comput. 31, 207-217 (1999).
Lower bounds for dominating Cartesian products
Hartnell, Bert L.; Rall, Douglas F.
J. Comb. Math. Comb. Comput. 31, 219-226 (1999).
On the upper line-distinguishing and upper harmonious chromatic numbers of a graph
Chen, Guantao; Domke, Gayla S.; Hattingh, Johannes H.; Laskar, Renu C.
J. Comb. Math. Comb. Comput. 31, 227-239 (1999).
On a conjecture concerning irredundant and perfect neighbourhood sets in graphs
Cockayne, E. J.; Mynhardt, C. M.
J. Comb. Math. Comb. Comput. 31, 241-253 (1999).
