Table Of Content

DISCRETE MATHEMATICS VOLUME 149, NUMBERS 1-3, 22 FEBRUARY 1996 CONTENTS P. Adams, E.J. Billington and D.E. Bryant Partitionable perfect cycle systems with cycle lengths 6 and 8 P. Berrizbeitia and R.E. Giudici Counting pure k-cycles in sequences of Cayley graphs J. Chen, D. Archdeacon and J.L. Gross Maximum genus and connectivity T. Denley The Ramsey numbers for disjoint unions of cycles G. Ding and B. Oporowski On tree-partitions of graphs K. Ding and P. Terwilliger On Garsia-Remmel problem of rook equivalence M. Goldstern, R. Grossberg and M. Kojman Infinite homogeneous bipartite graphs with unequal sides T.A. Gulliver Two new optimal ternary two-weight codes and strongly regular graphs S.L. Hakimi, J. Mitchem and E. Schmeichel Star arboricity of graphs X. Hou GL(m, 2) Acting on R(r,m)/R(r—1,m) G. Hurlbert and G. Isaak Equivalence class universal cycles for permutations K.M. Koh and B.P. Tan The diameter of an orientation of a complete multipartite graph B. Mohar, N. Robertson and R.P. Vitray Planar graphs on the projective plane H. Miller On edge perfectness and classes of bipartite graphs C. Padro and P. Morillo Diameter vulnerability of iterated line digraphs F. Rodier Estimation asymptotique de la distance minimale du dual des codes BCH et polynémes de Dickson DISCRETE MATHEMATICS VOLUME 149, NUMBERS 1-3, 22 FEBRUARY 1996 CONTENTS P. Adams, E.J. Billington and D.E. Bryant Partitionable perfect cycle systems with cycle lengths 6 and 8 P. Berrizbeitia and R.E. Giudici Counting pure k-cycles in sequences of Cayley graphs J. Chen, D. Archdeacon and J.L. Gross Maximum genus and connectivity T. Denley The Ramsey numbers for disjoint unions of cycles G. Ding and B. Oporowski On tree-partitions of graphs K. Ding and P. Terwilliger On Garsia-Remmel problem of rook equivalence M. Goldstern, R. Grossberg and M. Kojman Infinite homogeneous bipartite graphs with unequal sides T.A. Gulliver Two new optimal ternary two-weight codes and strongly regular graphs S.L. Hakimi, J. Mitchem and E. Schmeichel Star arboricity of graphs X. Hou GL(m, 2) Acting on R(r,m)/R(r—1,m) G. Hurlbert and G. Isaak Equivalence class universal cycles for permutations K.M. Koh and B.P. Tan The diameter of an orientation of a complete multipartite graph B. Mohar, N. Robertson and R.P. Vitray Planar graphs on the projective plane H. Miller On edge perfectness and classes of bipartite graphs C. Padro and P. Morillo Diameter vulnerability of iterated line digraphs F. Rodier Estimation asymptotique de la distance minimale du dual des codes BCH et polynémes de Dickson B. Servatius and H. Servatius Self-dual graphs G. Whittle Inequivalent representations of ternary matroids R. Willard Essential arities of term operations in finite algebras X. Zha On minimum-genus embeddings Communications C.A. Christen, G. Coray and S.M. Selkow A characterization of n-component graphs V.D. Tonchev The uniformly packed binary [27,21,3] and [35, 29,3] codes Notes R. Ahlswede and L.H. Khachatrian A counterexample to Aharoni’s strongly maximal matching conjecture T. Andreae On independent cycles and edges in graphs T. Andreae and C. Flotow On covering all cliques of a chordal graph R. Cimikowski and D. Coppersmith The sizes of maximal planar, outerplanar, and bipartite planar subgraphs J. Dunbar, S. Hedetniemi, M.A. Henning and A.A. McRae Minus domination in regular graphs B.G. Eke Coprimes in blocks of successive integers F. Hurtado and M. Noy Ears of triangulations and Catalan numbers J.J. Quinn Cycle packings in graphs and digraphs Author index to volume 149