Table Of Content

DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 188 (1998) 299-300 Author index to volume 188 (1998) Ahlswede, R. and Z. Zhang, Code pairs with specified parity of the Hamming distances (i-3) 1- 11 Alsardary, S.Y. and J. Wojciechowski, The basis number of the powers of the complete graph (1-3) 13-— 25 Assaf, A.M., Directed covering with block size 5 and index even (1-3) 27-— 40 Bagchi, B. and B. Datta, A structure theorem for pseudomanifolds (1-3) 41-— 60 Balaji, K., see M.R. Sridharan (1-3) 279-283 Bang-Jensen, J. and G. Gutin, Alternating cycles and trails in 2-edge-coloured complete multigraphs (1-3) 61— 72 Bluskov, I., Some t-designs are minimal (t + 1)-coverings (Note) (1-3) 245-251 Borodin, O.V., A.V. Kostochka, J. Nesetril, A. Raspaud and E. Sopena, On universal graphs for planar oriented graphs of a given girth (1-3) 73— 85 Cairnie, N. and K. Edwards, The achromatic number of bounded degree trees (1-3) 87— 97 Chen, B. and S. Lawrencenko, Structural characterization of projective flexibility (Communication) (1-3) 233-238 Cockayne, E.J., S.M. Hedetniemi, S.T. Hedetniemi and C.M. Mynhardt, Irredundant and perfect neighbourhood sets in trees (Note) (1—3) 253-260 Datta, B., see B. Bagchi (1-3) 41— 60 Davis, J.A., New semiregular divisible difference sets (1-3) 99-109 Edwards, K., see N. Cairnie (1-3) 87- 97 Gerards, A.M.H. and F.B. Shepherd, Strong orientations without even directed circuits (1-3) 111-125 Glebov, N.I. and A.V. Kostochka, On the independent domination number of graphs with given minimum degree (Note) (1—3) 261-266 Gulliver, T.A., see M. Harada (1—3) 127-136 Gutin, G., see J. Bang-Jensen (1-3) 61-— 72 Harada, M., T.A. Gulliver and H. Kaneta, Classification of extremal double-circulant self-dual codes of length up to 62 (1—3) 127-136 Harant, J., A lower bound on the independence number of a graph (Communication) (1—3) 239-243 Heden, O., Another Bruen chain (Note) (1—3) 267 Hedetniemi, S.M., see E.J. Cockayne (1-3) 253-260 Hedetniemi, S.T., see E.J. Cockayne (1-3) 253-260 Kaneta, H., see M. Harada (1—3) 127-136 Kostochka, A.V., see N.I. Glebov (1-3) 261-266 Kostochka, A.V., see O.V. Borodin (1-3) 73-— 85 Lawrencenko, S., see B. Chen (1-3) 233-238 Lepovic, M., On formal products and spectra of graphs (1—3) 137-149 Li, M., Vertex pancyclism in claw-free graphs (1-3) 151-173 Li, X., Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem (1—3) 175-182 Liu, G., see L. Xie (1-3) 285-291 Liu, X. and D.B. West, Line digraphs and coreflexive vertex sets (Note) (1-3) 269-277 Mynhardt, C.M., see E.J. Cockayne (1-3) 253-260 Nenov, N.D., On the small graphs with chromatic number 5 without 4-cliques (Letter to the editor) (1—3) 297-298 0012-365X/98/$19.00 Copyright © 1998 Elsevier Science B.V. All rights reserved PIT $0012-365X(98)00177-0 300 Author index NeSettfil, J., see O.V. Borodin (1-3) 73-— 85 Raspaud, A., see O.V. Borodin (1-3) 73-— 85 Shepherd, F.B., see A.M.H. Gerards (1-3) 111-125 Sopena, E., see O.V. Borodin (1-3) 73- 85 Sridharan, M.R. and K. Balaji, Characterisation of self-complementary chordal graphs (Note) (1-3) 279-283 Steffen, E., Classifications and characterizations of snarks (1-3) 183-203 Todorcevic, S., Countable chain condition in partition calculus (1-3) 205-223 West, D.B., see X. Liu (1-3) 269-277 Wojciechowski, J., see S.Y. Alsardary (1-3) 13- 25 Xie, L., G. Liu and B. Xu, On endo-homology of complexes of graphs (Note) (1-3) 285-291 Xiong, L., Edge degree conditions for subpancyclicity in line graphs (1-3) 225-232 Xu, B., see L. Xie (1-3) 285-291 Zhang, Z., see R. Ahlswede (1-3) 1-11 Zhao, L., The kissing number of the regular polygon (Note) (1—3) 293-296