Discrete Mathematics 59 (1986) 321-322 North-Holland
321
AUTHOR INDEX Volume 59 (1986)
Berman, K.A., Parity results on connected f-factors (1,2) 1-8 Beutelspacher, A. and I. Schestag, Finite linear spaces in which any n-gon is (3) 207-220 Euclidean Bialostocki, A. and N. Sauer, On Ramsey-Tur~in type problems in tournaments (3) 221-228 (1,2) 199-201 Brigham, R.C., see A.P. Sbelton (3) 315-317 Brouwer, A.E., An inequality in binary vector spaces (Note) (1,2) 191-198 Cerasoli, M., Enumeration with the lattice of periods (Communication) (3) 229-234 Clay, J.R., More balanced incomplete block designs from Frobenius groups (1,2) 199-201 Dutton, R., see A.P. Shelton (1,2) 9-20 Dymacek, W.M., Bipartite Steinhaus graphs (3) 235-242 Erdrs, P. and M. Emr, Clique numbers of graphs Erdrs, P., Z. Fiiredi, A. Hajnal, P. Komjfith, V. Rrdl and A. Seress, Coloring (1,2) 21-34 graphs with locally few colors (3) 235-242 Emr, M., see P. Erdrs (3) 243-256 Frieze, A.M., On large matchings and cycles in sparse random graphs (1,2) 21-34 Fiiredi, Z., see P. Erdrs Galeana-Sfinchez, H., A theorem about a conjecture of H. Meyniel on kernel-perfect (1,2) 35-41 graphs (3) 257-265 Galeana-Sfmchez, H. and V. Neumann-Lara, On Kernel-perfect critical digraphs (1,2) 43-51 Glynn, D.G., The non-classical 10-arc of PG(4,9) Gregory, D.A., S. McGuinness and W. Wallis, Clique partitions of the cocktail party (3) 267-273 graph (1,2) 53-59 Hager, M., Path-connectivity in graphs Hajnal, A. and N. Sauer, Complete subgraphs of infinite multipartite graphs and (1,2) 61-67 antichains in partially ordered sets (1,2) 21-34 Hajnal, A., see P. Erdrs (3) 275-281 Hartman, A., On small packing and covering designs with block size 4 Heinrich, K. and L. Zhu, Existence of orthogonal latin squares with aligned (1,2) 69-78 suhsquares (1,2) 79-89 Hertz, A., Quelques utilisations de la struction Huffman, W.C., On automorphism groups of certain 2-(v,3,2) designs induced by (3) 283-296 group actions (1,2) 91-97 Jha, V. and N.L. Johnson, Regular parallelisms from translation planes (1,2) 91-97 Johnson, N.L., see V. Jha (1,2) 21-34 Komjfith, P., see P. Erd6s (3) 297-314 Korte, B. and L. LovMz, Non-interval greedoids and the transposition property (3) 319-320 Lindstrrm, B., A non-linear algebraic matroid with infinite characteristic set (Note) (3) 297-314 LOV~LSZ,L., see B. Korte (3) 267-273 McGuinness, S., see D.A. Gregory Nederpelt, R.P., Bijections between formulae and trees which are compatible with (1,2) 99-105 equivalences of the type ((f*g)oh)~ ((foh)*g) (3) 257-265 Neumann-Lara, V., see H. Galeana-Slincbez
322
Author index
Owens, P.J., Simple 3-polytopal graphs with edges of only two types and shortness coefficients Piollet, D., Solutions d'une ~quation quadratique dans le groupe libre R6dl, V., On universality of graphs with uniformly distributed edges Rtdl, V., see P. Erdts Saks, M., Some sequences associated with combinatorial structures Sauer, N., see A. Bialostocki Sauer, N., see A. Hajnal Seress, A., see P. Erd/Ss Shelton, A.P., R.D. Dutton and R.C. Brigham, Extension of a clique cover result to uniform hypergraphs (Note) Schestag, I., see A. Beutelspacher Shi, Y., Some theorems of uniquely pancyclic graphs Simpson, R.J., Exact coverings of the integers by arithmetic progressions Wallis, W., see D.A. Gregory Zhu, L., see K. Heinrich
(1,2) 107-114 (1,2) 115-123 (1,2) 125-134 (1,2) 21-34 (1,2) 135-166 (3) 221-228 (1,2) 61-67 (1,2) 21-34 (1,2) 199-201 (3) 207-220 (1,2) 167-180 (1,2) 181-190 (3) 267-273 (1,2) 69-78