On packing designs with block size 5 and index 7≤λ≤21
Assaf, Ahmed M.
J. Comb. Math. Comb. Comput. 26, 3-71 (1998).
On strong domination in graphs
Hattingh, Johannes H.; Henning, Michael A.
J. Comb. Math. Comb. Comput. 26, 73-82 (1998).
Efficient and excess domination in graphs
Harary, Frank; Haynes, Teresa W.; Slater, Peter J.
J. Comb. Math. Comb. Comput. 26, 83-95 (1998).
Undecidable generalized colouring problems
Dukes, P.; Emerson, H.; MacGillivray, G.
J. Comb. Math. Comb. Comput. 26, 97-112 (1998).
Generalized hooked, extended, and near-Skolem sequences
Shalaby, N.; Al-Gwaiz, M. A.
J. Comb. Math. Comb. Comput. 26, 113-128 (1998).
A note on 1-tough hamiltonian graphs
Li, Rao
J. Comb. Math. Comb. Comput. 26, 129-130 (1998).
On three conjectures of GRAFFITI
Dankelmann, Peter; Swart, Henda C.; Oellermann, Ortrud R.
J. Comb. Math. Comb. Comput. 26, 131-137 (1998).
On circuit polynomials and determinants of matrices
Farrell, E. J.; Grell, J. C.
J. Comb. Math. Comb. Comput. 26, 139-146 (1998).
Real domination in graphs
Henning, Michael A.; Kubicki, Grzegorz
J. Comb. Math. Comb. Comput. 26, 147-160 (1998).
Baer *-rings with finitely many elements
Thakare, N. K.; Waphare, B. N.
J. Comb. Math. Comb. Comput. 26, 161-164 (1998).
A lower bound for the parallel complexity of periodicity on multi-dimensional arrays
Galley, Clive N.
J. Comb. Math. Comb. Comput. 26, 165-176 (1998).
On surjective semispan of abstract graphs
West, Thelma
J. Comb. Math. Comb. Comput. 26, 177-192 (1998).
Independence, domination, irredundance, and forbidden pairs
Faudree, Ralph; Favaron, Odile; Li, Hao
J. Comb. Math. Comb. Comput. 26, 193-212 (1998).
Quasi-orthogonal latin squares and related designs
Bedford, David
J. Comb. Math. Comb. Comput. 26, 213-224 (1998).
Characterization of polychrome paths and cycles
Valentin, Katja
J. Comb. Math. Comb. Comput. 26, 225-226 (1998).
The covers of a circular Fibonacci string
Iliopoulos, Costas S.; Moore, Dennis; Smyth, W. F.
J. Comb. Math. Comb. Comput. 26, 227-236 (1998).
On the independence number of triangle free graphs with maximum degree three
Bajnok, Béla; Brinkmann, Gunnar
J. Comb. Math. Comb. Comput. 26, 237-254 (1998).




