Table Of Content

DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 149 (1996) 329-330 Author index to volume 149 (1996) Adams, P., E.J. Billington and D.E. Bryant, Partitionable perfect cycle systems with cycle Se oe lengths 6 and 8 Ahlswede, R. and L.H. Khachatrian, A counterexample to Aharoni’s strongly maximal (1-3) 289 matching conjecture (Note) (1-3) 291-297 Andreae, T., On independent cycles and edges in graphs (Note) (1-3) 299-302 Andreae, T. and C. Flotow, On covering all cliques of a chordal graph (Note) (1-3) 19- 29 Archdeacon, D., see J. Chen (1-3) 11— 18 Berrizbeitia, P. and R.E. Giudici, Counting pure k-cycles in sequences of Cayley graphs iy i 5 Billington, E.J., see P. Adams is 4 9 Bryant, D.E., see P. Adams Chen, J., D. Archdeacon and J.L. Gross, Maximum genus and connectivity (1-3) 19— 29 Christen, C.A., G. Coray and S.M. Selkow, A characterization of n-component graphs (Communication) (1-3) 279-281 Cimikowski, R. and D. Coppersmith, The sizes of maximal planar, outerplanar, and (1-3) 303-309 bipartite planar subgraphs (Note) (1-3) 303-309 Coppersmith, D., see R. Cimikowski (1-3) 279-281 Coray, G., see C.A. Christen (1--3) 31- 44 Denley, T., The Ramsey numbers for disjoint unions of cycles (1-3) 45— 58 Ding, G. and B. Oporowski, On tree-partitions of graphs (1-3) 59- 68 Ding, K. and P. Terwilliger, On Garsia~-Remmel problem of rook equivalence Dunbar, J.,S. Hedetniemi, M.A. Henning and A.A. McRae, Minus domination in regular (1-3) 311-312 graphs (Note) (1-3) 313-317 Eke, B.G., Coprimes in blocks of successive integers (Note) (1-3) 299-302 Flotow, C., see T. Andreae -H 18-248 Giudici, R.E., see P. Berrizbeitia Goldstern, M., R. Grossberg and M. Kojman, Infinite homogeneous bipartite graphs with unequal sides (1-3) 69— 82 Gross, J.L., see J. Chen (1-3) 19- 29 Grossberg, R., see M. Goldstern (1-3) 69— 82 (1-3) 83- 92 Gulliver, T.A., Two new optimal ternary two-weight codes and strongly regular graphs (1-3) 93- 98 Hakimi, S.L., J. Mitchem and E. Schmeichel, Star arboricity of graphs (1-3) 311-312 Hedetniemi, S., see J. Dunbar (1-3) 311-312 Henning, M.A., see J. Dunbar (1-3) 99-122 Hou, X., GL(m, 2) Acting on R(r,m)/R(r — 1,m) (1-3) 123-129 Hurlbert, G. and G. Isaak, Equivalence class universal cycles for permutations (1-3) 319-324 Hurtado, F. and M. Noy, Ears of triangulations and Catalan numbers (Note) (1-3) 123-129 Isaak, G., see G. Hurlbert (1-3) 289 Khachatrian, L.H., see R. Ahlswede Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite (1-3) 131-139 graph (1-3) 69- 82 Kojman, M., see M. Goldstern (1-3) 311-312 McRae, A.A., see J. Dunbar (1-3) 93- 98 Mitchem, J., see S.L. Hakimi (1-3) 141-157 Mohar, B., N. Robertson and R.P. Vitray, Planar graphs on the projective plane (1-3) 189-204 Morillo, P., see C. Padro 330 Author index Miiller, H., On edge perfectness and classes of bipartite graphs (1—3) 159-187 Noy, M., see F. Hurtado (1-3) 319-324 Oporowski, B., see G. Ding (1-3) 45- 58 Padro, C. and P. Morillo, Diameter vulnerability of iterated line digraphs (1—3) 189-204 Quinn, J.J., Cycle packings in graphs and digraphs (Note) (1-3) 325-328 Robertson, N., see B. Mohar (1-3) 141-157 Rodier, F., Estimation asymptotique de la distance minimale du dual des codes BCH et polynémes de Dickson (1-3) 205-221 Schmeichel, E., see S.L. Hakimi (I-3} “‘93— 96 Selkow, S.M., see C.A. Christen (1-3) 279-281 Servatius, B. and H. Servatius, Self-dual graphs (1-3) 223-232 Servatius, H., see B. Servatius (1-3) 223-232 Tan, B.P., see K.M. Koh (1-3) 131-139 Terwilliger, P., see K. Ding (1-3) 59-— 68 Tonchev, V.D., The uniformly packed binary [27, 21,3] and [35, 29,3] codes (1-3) 283-288 (Communication) (1-3) 141-157 Vitray, R.P., see B. Mohar (1-3) 233-238 Whittle, G., Inequivalent representations of ternary matroids Willard, R., Essential arities of term operations in finite algebras (1-3) 239-259 (1-3) 261-278 Zha, X., On minimum-genus embeddings