Table Of Content

DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 207 (1999) 299-300 www.elsevier.com/locate/disc Author index to volume 207 (1999) Abderrezzak, M.E.K., E. Flandrin and Z. Ryjacek, Induced S(K, 3) and hamiltonian cycles in the square of a graph (Note) 3) 263-269 Asratian, A.S. and N.N. Kuzjurin, On the number of nearly perfect matchings in almost regular uniform hypergraphs 3 i- 8 Cai, J. and Y. Liu, The enumeration of rooted nonseparable nearly cubic maps -3 9- 24 Cairns, G. and D.M. King, The answer to Woodall’s musquash problem a) 2552 Craft, D. and E.H. Tesar, On a question by Erdés about edge-magic graphs (Note) 271-276 Flandrin, E., see M.E.K. Abderrezzak 263-269 Fon-Der-Flaass, D.G., A.V. Kostochka and D.R. Woodall, Transversals in uniform hypergraphs with property (7,2 ) (Note) Fujii, H. and A. Katsuda, Isospectral graphs and isoperimetric constants Hagedorn, T.R., On the existence of magic n-dimensional rectangles Hagedorn, T.R., Magic rectangles revisited Helm, M., On the Beck-Fiala theorem Katsuda, A., see H. Fujii Kearnes, K.A. and E.W. Kiss, Finite algebras of finite complexity King, D.M., see G. Cairns Kiss, E.W., see K.A. Kearnes Kostochka, A.V., see D.G. Fon-Der-Flaass Kuzjurin, N.N., see A.S. Asratian Landman, B.M., On some generalizations of the van der Waerden number w(3) Le, D. and A.J. Macula, On the probability that subset sequences are minimal (Note) 3) 285-289 Liu, Y., see J. Cai 9- 24 Macula, A.J., see D. Le 3) 285-289 Mahadev, N.V.R. and T.-M. Wang, On uniquely intersectable graphs 3) 149-159 Manoussakis, Y. and I. Milis, A sufficient condition for maximum cycles in bipartite digraphs 3) 161-171 Milis, I., see Y. Manoussakis 3) 161-171 Mills, A.D. and J.G. Oxley, A class of non-binary matroids with many binary minors -3) 173-187 Oxley, J.G., see A.D. Mills 3) 173-187 Peisert, W., Direct product and uniqueness of automorphism groups of graphs 3) 189-197 Polat, N., Invariant subgraph properties in pseudo-modular graphs 3) 199-217 Pulapaka, H., Nonrevisiting cycles on surfaces 3) 219-231 Ryjacek, Z., see M.E.K. Abderrezzak 3) 263-269 Steffen, E., Counterexamples to a conjecture about Petersen-minors in supersnarks (Note) 3) 291-292 Tesar, E.H., see D. Craft 3) 271-276 Tokuda, T., Connected [a, b]-factors in K,,,-free graphs containing an [a, b]-factor (Note) 3) 293-298 Wang, H., Bipartite graphs containing every possible pair of cycles 3) 233-242 0012-365X/99/$-see front matter © 1999 Elsevier Science B.V. All rights reserved PII: S0012-365X(99)00317-9 300 Author index Wang, T.-M., see N.V.R. Mahadev 149-159 Welker, V., Constructions preserving evasiveness and collapsibility Woodall, D.R., see D.G. Fon-Der-Flaass Zverovich , 1.E., Near-complete multipartite graphs and forbidden induced subgraphs