Discrete Mathematics 89 (1991) 329-330 North-Holland Author index to volume 89 (1991) Ainouche, A., Four sufficient conditions for hamiltonian graphs (Communication) (2) 195-200 Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree (Note) (1) 97-100 Amar, D., E. Flandrin, I. Fournier and A. Germa, Pancyclism in hamiltonian graphs (2) 111-131 Behrendt, G., The lattice of antichain cutsets of a partially ordered set (Note) (2) 201-202 Berman, D.M., see Albertson, M.O. (1) 97-100 Bryant, R.D. and H. Fredricksen, Covering the de Bruijn graph (2) 133-148 Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs (1) 1- 6 Chernyak, Z.A., see Chernyak, A.A. (1) 1- 6 Colbourn, C.J., K.T. Phelps, M.J. de Resmini and A. Rosa, Partitioning Steiner triple systems into complete arcs (2) 149-160 Constantine, G.M., see Farrell, E.J (2) 203-210 Cordovil, R., K. Fukuda and M.L. Moreira, Clutters and matroids (2) 161-171 Courteau, B. and A. Montpetit, Dual distances of completely regular codes (1) 7- 15 Damaschke, P., Irredundance number versus domination number (Note) (1) 101-104 de Resmini, M.J., see Colbourn, C.J. (2) 149-160 Exoo, G., Three color Ramsey number of K, — e (Note) (3) 301-305 Farrell, E.J., J.M. Guo and G.M. Constantine, On matching coefficients (Note) (2) 203-210 Flandrin, E., see Amar, D (2) 111-131 Fournier, I., see Amar, D (2) 111-131 Fredricksen, H., see Bryant, R.D. (2) 133-148 Fukuda, K., see Cordovil, R (2) 161-171 Germa, A., see Amar, D. (2) 111-131 Guo, J.M., see Farrell, E.J. (2) 203-210 Harzheim, E., Weakly arithmetic progressions in sets of natural numbers (Note) (1) 105-107 Hoffman, D.G., C.C. Lindner and K.T. Phelps, Blocking sets in designs with block size four Il (3) 221-229 Jacobson, M.S., M. Truszczyfiski and Z. Tuza, Decompositions of regular bipartite graphs (1) 17- 27 Kharaghani, H., An infinite class of Hadamard matrices of maximal excess (Note) (3) 307-312 Koolen, J.H., see van den Akker, J.M. (3) 325 Lamken, E.R., The existence of 3 orthogonal partitioned incomplete Latin squares of type 7” (3) 231-251 Lefmann H., Non t-intersecting families of linear spaces over GF(q) (2) 173-183 Lindner, C.C., see Hoffman, D.G. (3) 221-229 Marcu, D., The powers of two and three (Note) (2) 211-212 McKee, T.A., Intersection properties of graphs (3) 253-260 Mollard, M., Cycle-regular graphs (1) 29- 41 Montpetit, A., see Courteau, B. (1) 7- 15 Moreira, M.L., see Cordovil, R. (2) 161-171 Phelps, K.T., see Colbourn, C.J. (2) 149-160 Phelps, K.T., see Hoffman, D.G. (3) 221-229 Richter, R.B., Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces (3) 261-268 Rosa, A., see Colbourn, C.J (2) 149-160 Seifter, N., Groups acting on graphs with polynomial growth (3) 269-280 Sharir, M. and S.S. Skiena, Tight bounds on a problem of lines and intersections (Note) (3) 313-314 330 Author index Sifiajov4, E., A note on vector representation of graphs (Note) (3) 315-317 Skiena, S.S., see Sharir, M (3) 313-314 Solé, P., On the parameters of codes for the Lee and modular distance (2) 185-194 Spera, A.G., (s, k, A)-Partitions of a vector space (Note) (2) 213-217 Stahl, S., Region distributions of some small diameter graphs (3) 281-299 Stéhr, E., The pagewidth of trivalent planar graphs (1) 43- 49 Tian, F. and W. Zang, The maximum number of diagonals of a cycle in a block and its extremal graphs (1) 5i- Truszczyfiski, M., see Jacobson, M.S (1) 17- Tuza, Z., see Jacobson, M.S (1) 17- Vaessens, R.J.M., see van den Akker, J.M (3) van den Akker, J.M., J.H. Koolen and R.J.M. Vaessens, Perfect codes with distinct protective radii (Addendum) (3) 325 Xu, C., A necessary and sufficient condition for a graph G with diameter 5 to be 2-diameter-stable (Note) (3) 319-324 Xu, S., Relations between parameters of a graph (1) 65— 88 Zang, W., see Tian, F (1) S5l- 63 Zhan, S., On hamiltonian line graphs and connectivity (1) 89— 95