Author index volume 43 (1983)

Discrete Mathematics 43 (1983) 331-332 North-H&and Publishing Company

AUTHOR

331

INDEX

vahmae 43 (1983) Berghammer, R. and G. Schmidt, Discrete ordering relations Blecher, P.M., On a logical problem (Note) Bry, F., On the factorization of graphs with exactly one vertex of infinite degree (Note) Cong, T.T., see M. Sato Cordovil, R., The directions determined by n points in the plane: A matroidal generalization Cuhk, K., II and J. Karhumii’ki, Systems of equations over a free monoid and E?nenfeucht’s conjecture Das, P znd S B. Rao, Alternating eulerian trails with prescribed degrees in two edge- 7#!t~& complete graphs Dehon, M., Gn Lhe existence of 2-designs S,(2,3, u) without repeated blocks Duchet, P. and H. Meyniel, Une g&&ralisation du th&o&me de Richardson sur I’existence de noyaux dans les graphes orient& Farber, M., Characterizations of strongly chordal graphs Foumier, J.-C., Hypergraphes de chaines d’ar&es d’un arbre Frankl. P., A probabilistic proof for the LYM-inequality (Communication) Galhan, J.A., see D. Witte Golumbic, M.C., D. Rotem and J. Urrutia, Comparability graphs and intersection graphs Hartfiel, D.J., Stochastic eigenvectors for qualitative stochastic matrices Horton, J-D., The construction of Kotzig factor&ions Jeurissen, R.H., Disconnected graphs with magic labelings Jeurissen, R.H., Pseudo-magic graphs Karhumlki, J., see K. Culik II Komhjs, J. and E. Szemeredi, Limit distribution for the existence of hamiltonian cycles in a random graph Lam, C.W.H., Non-skew symmetric orthogonal matrices with constant diagonals Lauri, J., Roof of Harary’s conjecture on the reconstruction of trees Letzter, G., see D. Witte Lindsttim, B., Undecided Ramsey-numbers for paths (Note) Ma&%, D. and T.D. Parsons, Hamiltonian paths in vertex-symmetric graphs of order 4P McKee, T.A., Duality principles for binary matroids and graphs Meyniel, H., see P. Duchet Nowakowski, R. and I. Rival, The smallest graph variety containing all paths Nowakowski, R. and P. Winkler, Vertex-to-vertex pursuit in a graph Parsons, T-.-C., c sn,e D. Mart&t Prodinger, H., Non-repetitive sequences and Gray code (Note) Rao, S-B., see P. Das Rival, I., see R. Nowakowski Rotem, D., see MC. Golumbic Rudeanu, S., Linear Boolean equations and generalized minterms Ruskey, F., A simple proof of a formula of Dershowitz and Zaks (Note) Sato, M. and T.T. Cong, The number of minimal lattice paths restricted by two parallel lines Schiifer, D. and K.E. Wolff, Polya enumeration of expansions of resolvable incidence structures

0012-365X/83/0000-0000/$03.00

@ 1983 North-Holland

(1) l-7 (1) 107-110 (2,3) 317-320 (2,3) 249-261 (2,3) 231-137 (23) 139-153 (1) 9-20 (2,3) 155-171 (1) 21-27 (2,3) 173-189 (1) 29-36 (2,3) 325 (2,3) 297-307 (1) 37-46 (2,3) 191-197 (2,3) 199-206 (1) 47-53 (2,3) 207-214 (2,J) 139-153 (1) 55-63 (1) 65-78 (1) 79-90 (2,3) 297-307 (1) 111-112 (1) 91-96 (2,3) 215-222 (1) 21-27 (2,3) 223-234 (2,3) 235-239 (1) 41-96 (1) 113-116 (1) 9-20 (2,3) 223-234 (1) 37-46 (2,3) 241-248 (1) 117-118 (2,3) 249-26 1 (2,3) 263-271

332

Author

index

Schmidt, G., see R. Berghammer Stein, P., On Chvhtal’s conjecture related to a hereditary system Stein, P., Chv&tal’s conjecture and point-intersections (Note) Strauhing, H., A combinatorial proof of the C’ayley-Hamilton theorem Szemeredi, E.. see J. Koml& Wrrutia, I., see M-C. Golumbic Veldman, H.J., Existence of dominating cycles and paths Winkler, P., see R. Nowakowski Witte, D., G. Letzter and J.A. Gallian, On hamiltonian circuits in Cartesian products of Cayley digraphs Wolff, M.E., see D. Scfifer Wong, P.K.. On the smallest graphs of girth 10 ajild valency 3 (Note) Zaks, J.. Extending two theorems of A. Kotzig

(1) l-7 (1) 97-105 (2.3) 321- 323 (2,3) 273-279 (1) 55-63 (1) 37-46 (2,3) 28 l-296 (2,3) 235-239 (2.3) (2,3) (1) (2,3)

297-307 263-271 119-124 509-3 15