Table Of Content

DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 196 (1999) 299 Author index to volume 196 (1999) Alladi, K., A variation on a theme of Sylvester — a smoother road to Gdllnitz’s (Big) theorem 1— 11 Bang-Jensen, J., Linkages in locally semicomplete digraphs and quasi-transitive digraphs 13- 27 Brousek, J., Z. Ryjacek and O. Favaron, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs 29— 50 Byer, O.D., Two path extremal graphs and an application to a Ramsey-type problem S1— 64 Caughman IV, J.S., The Terwilliger algebras of bipartite P- and Q-polynomial schemes 65— 95 Chang, G.J., see S.-C. Liaw 219-227 Cheng, C.T. and L.J. Cowen, On the local distinguishing numbers of cycles 97-108 Cowen, L.J., see C.T. Cheng 97-108 Dinski, T. and X. Zhu, A bound for the game chromatic number of graphs 109-115 Dougherty, S.T., T.A. Gulliver and M. Harada, Optimal ternary formally self-dual codes 117-135 FavarOo.,n s,ee J.B rousek 29-— 50 Fu, T.-S., Erdés-Ko—Rado-type results over J,(n, d), H,(n, d) and their designs 137-151 Graf, A., Distance graphs and the T-coloring problem 153-166 Gulliver, T.A., see $.T. Dougherty 117-135 Harada, M., see S.T. Dougherty 117-135 Hu, Z., A generalization of Fan’s condition and forbidden subgraph conditions for hamiltonicity 167-175 Jendrol, S., Triangles with restricted degrees of their boundary vertices in plane triangulations 177-196 Jiang, Z., see V. Linek 229-238 Kashiwagi, Y. and I. Kikumasa, Indecomposability of cyclic codes (Note) 277-280 Kikumasa, I., see Y. Kashiwagi 277-280 Knopfmacher, A., On the degrees of irreducible factors of polynomials over a finite field 197-206 Kordecki, W. and T. Luczak, On the connectivity of random subsets of projective spaces 207-217 Liaw, S.-C. and G.J. Chang, Rabin numbers of Butterfly networks 219-227 Linek, V. and Z. Jiang, Hooked k-extended Skolem sequences 229-238 Luczak, T., see W. Kordecki 207-217 Panda, B.S., The forbidden subgraph characterization of directed vertex graphs 239-256 Pavcevic, M.-O. and E. Spence, Some new symmetric designs with A = 10 having an automorphism of order 5 Rodriguez, J.A. and J.L.A. Yebra, Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods 267-275 Ryjacek, Z., see J. Brousek 29-— 50 Spence, E., see M.-O. Pavéevic 257-266 Yang, Z., On F-Hamiltonian graphs (Note) 281-286 Yebra, J.L.A., see J.A. Rodriguez 267-275 Zhang, Z., A kind of bionomial identity (Note) 291-298 Zhang, Z., A binomial identity related to Calkin’s (Note) 287-289 Zhu, X., see T. Dinski 109-115 0012-365X/99/$ — see front matter © 1999 Elsevier Science B.V. All rights reserved PII: $0012-365X(98)00388-4