Table Of Content

DISCRETE MATHEMATICS ELSEVIER Discrete Mathematics 240 (2001) 299-300 www.elsevier.com/locate/disc Author index to volume 240 (2001) Arumugam, §S., I. Rajasingh and P.R.L. Pushpam, Graphs whose acyclic graphoidal covering number is one less than its maximum degree (Note) (1-3) 231-237 Bierbrauer, J., An infinite family of 7-designs (1-3) 1-11 Bogdanova, G.T. and P.R.J. Ostergard, Bounds on codes over an alphabet of five elements (1-3) 13- 19 Brualdi, R.A. and S. Hollingsworth, Multicolored forests in complete bipartite graphs (Note) (1-3) 239-245 Caines, I., see S.L. Fitzpatrick (1-3) 253-260 Chang, A., see Q. Huang (1-3) 261-270 Chang, C.-H., Y.-C. Chuang and L.-H. Hsu, Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs (1-3) 21- 43 Chuang, Y.-C., see C.-H. Chang (1-3) 21- 43 Fischermann, M., Block graphs with unique minimum dominating sets (Note) (1-3) 247-251 Fitzpatrick, S.L., R.J. Nowakowski, D. Holton and I. Caines, Covering hypercubes by isometric paths (Note) (1-3) 253-260 Hindman, N. and R. McCutcheon, VIP systems in partial semigroups (1-3) 45- 70 Hollingsworth, S., see R.A. Brualdi (1-3) 239-245 Holton, D., see S.L. Fitzpatrick (1-3) 253-260 Hsu, L.-H., see C.-H. Chang (1-3) 21- 43 Huang, Q. and A. Chang, Circulant digraphs determined by their spectra (Note) (1-3) 261-270 Kawarabayashi, K., K. Ota and A. Saito, Hamiltonian cycles in n-factor-critical graphs (1-3) 71- 82 Kézdy, A.E. and M. Scobee, A proof of Hougardy’s conjecture for diamond-free graphs (1-3) 83- 95 Korsh, J.F., Loopless generation of up-down permutations (1-3) 97-122 Kostochka, A.V. and D.R. Woodall, Choosability conjectures and multicircuits (1-3) 123-143 Lemos, M., On Mills’s conjecture on matroids with many common bases (Note) (1-3) 271-276 Liu, B., see W. Yan (1-3) 219-229 McCutcheon, R., see N. Hindman (1-3) 45- 70 Milici, S., A. Rosa and V. Voloshin, Colouring Steiner systems with specified block colour patterns (1-3) 145-160 Miller, M., see H. Nagamochi (1-3) 175-185 Mills, D., Factorizations of root-based polynomial compositions (1-3) 161-173 Nagamochi, H., M. Miller and Slamin, Bounds on the number of isolates in sum graph labeling (1-3) 175-185 Negami, S., Diagonal flips in pseudo-triangulations on closed surfaces (1-3) 187-196 Nowakowski, R.J., see S.L. Fitzpatrick (1-3) 253-260 Ostergard, P.R.J., see G.T. Bogdanova (1-3) 13- 19 Ota, K., see K. Kawarabayashi (1-3) 71- 82 Pushpam, P.R.L., see S. Arumugam (1-3) 231-237 Rajasingh, I., see S. Arumugam (1-3) 231-237 Rosa, A., see S. Milici (1-3) 145-160 Saito, A., see K. Kawarabayashi (1-3) 71- 82 Scobee, M., see A.E. Kézdy (1-3) 83- 95 Sebille, M., An extension theorem for t-designs (1-3) 197-204 Shahmohamad, H., Some flow-equivalent planar and non-planar graphs (Note) (1-3) 277-280 Slamin, see H. Nagamochi (1-3) 175-185 Sun, H.-M., Segments in a planar nearring (1-3) 205-217 0012-365X/01/$-see front matter PII: $0012-365X(01)00306-5 300 Author index Tomiyama, M., On the primitive idempotents of distance-regular graphs (Note) 281-294 Voloshin, V., see S. Milici 145-160 Wang, Q. and J. Yuan, Maximal IM-unextendable graphs (Note) 295-298 Woodall, D.R., see A.V. Kostochka 123-143 Yan, W. and B. Liu, Some results on integral sum graphs 219-229 Yuan, J., see Q. Wang 295-298