- Email: [email protected]
Author index to volume 268
Discrete Mathematics 268 (2003) 351–352
Author index to volume 268
Abel, R.J.R., N.J. Finizio, M. Greig and S.J. Lewis, Generalized whist tournament designs Ahn, J., H.K. Kim, J.S. Kim and M. Kim, Classification of perfect linear codes with crown poset structure Axenovich, M.A., On multiple coverings of the infinite rectangular grid with balls of constant radius Balakrishnan, R., J.-C. Bermond, P. Paulraja and M.-L. Yu, On Hamilton cycle decompositions of the tensor product of complete graphs Bermond, J.-C., see R. Balakrishnan Bulatov, A.A. and P.M. Idziak, Counting Mal’tsev clones on small sets
(1–3)
1– 19
(1–3)
21– 30
(1–3)
31– 48
(1–3) (1–3) (1–3)
49– 58 49– 58 59– 80
(1–3)
81–101
Chastand, M., Fiber-complemented graphs II. Retractions and endomorphisms Chen, C., F.K. Hwang, J.S. Lee and S.J. Shih, The existence of hyper-L triple-loop networks
(1–3) 287–291
Duursma, I., Extremal weight enumerators and ultraspherical polynomials
(1–3) 103–127
Eschen, E.M., W.F. Klostermeyer and R. Sritharan, Planar domination graphs
(1–3) 129–137
Finizio, N.J., see R.J.R. Abel
(1–3)
Ge, G. and C.W.H. Lam, Bhaskar Rao designs with block size four Ge, G. and C.W.H. Lam, Resolvable group divisible designs with block size four and group size six Goddard, W. and M.A. Henning, Nordhaus–Gaddum bounds for independent domination Gravier, S., F. Maffray and B. Mohar, On a list-coloring problem Greig, M., see R.J.R. Abel Guo, V.J.W., A simple proof of Dixon’s identity
(1–3) 293–298
1– 19
(1–3) 139–151 (1–3) 299–302 (1–3) 303–308 (1–3) 1– 19 (1–3) 309–310
Henning, M.A., see W. Goddard Heuberger, C., On planarity and colorability of circulant graphs Hibi, T., see H. Ohsugi Hwang, F.K., On Macula’s error-correcting pool designs Hwang, F.K., see C. Chen
(1–3) (1–3) (1–3) (1–3) (1–3)
299–302 153–169 217–242 311–314 287–291
Idziak, P.M., see A.A. Bulatov
(1–3)
59– 80
Kim, H.K., see J. Ahn Kim, J.S., see J. Ahn
(1–3) (1–3)
21– 30 21– 30
0012-365X/03/$ - see front matter doi:10.1016/S0012-365X(03)00171-7
352
Author index to volume 268
Kim, M., see J. Ahn Klostermeyer, W.F., see E.M. Eschen Kremer, D. and W.C. Shiu, Finite transition matrices for permutations avoiding pairs of length four patterns
(1–3) 21– 30 (1–3) 129–137
Lam, C.W.H., see G. Ge Lam, C.W.H., see G. Ge Lee, J.S., see C. Chen Lewis, S.J., see R.J.R. Abel Li, J., see B.-Y. Zhang Li, R. and R.H. Schelp, Every 3-connected distance claw-free graph is Hamiltonconnected Li, X. and C.-Q. Zhang, Chords of longest circuits in 3-connected graphs
(1–3) (1–3) (1–3) (1–3) (1–3)
Maffray, F., see S. Gravier Mierendorff, H., Magic twin body stars generated from chains of prismoids Mohar, B., see S. Gravier
(1–3) 303–308 (1–3) 315–323 (1–3) 303–308
$ Naserasr, R. and R. Skrekovski, The Petersen graph is not 3-edge-colorable—a new proof Negami, S., Composite planar coverings of graphs
(1–3) 325–326 (1–3) 207–216
Ohsugi, H. and T. Hibi, Normalized volumes of configurations related with root systems and complete bipartite graphs
(1–3) 217–242
Paulraja, P., see R. Balakrishnan Prisner, E., The recognition problem for line bigraphs
(1–3) 49– 58 (1–3) 243–256
Schelp, R.H., see R. Li Sharir, M. and S. Smorodinsky, On neighbors in geometric permutations Shih, S.J., see C. Chen Shin, D.-J. and W. Sung, A new Kloosterman sum identity over F2m for odd m Shiu, W.C., see D. Kremer $ Skrekovski, R., see R. Naserasr Smorodinsky, S., see M. Sharir Sritharan, R., see E.M. Eschen Sung, W., see D.-J. Shin
(1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3)
Truss, J.K., The automorphism group of the random graph: four conjugates good, three conjugates better
(1–3) 257–271
Yu, M.-L., see R. Balakrishnan
(1–3)
49– 58
Zhang, B.-Y. and J. Li, An improvement of the two-line algorithm for proving q-hypergeometric identities Zhang, C.-Q., see X. Li Zhang, H., see L. Zhu Zhu, L. and H. Zhang, Completing the spectrum of r-orthogonal Latin squares
(1–3) (1–3) (1–3) (1–3)
273–286 199–206 343–349 343–349
(1–3) 171–183 139–151 293–298 287–291 1– 19 273–286
(1–3) 185–197 (1–3) 199–206
185–197 327–335 287–291 337–341 171–183 325–326 327–335 129–137 337–341
Author index to volume 268
Abel, R.J.R., N.J. Finizio, M. Greig and S.J. Lewis, Generalized whist tournament designs Ahn, J., H.K. Kim, J.S. Kim and M. Kim, Classification of perfect linear codes with crown poset structure Axenovich, M.A., On multiple coverings of the infinite rectangular grid with balls of constant radius Balakrishnan, R., J.-C. Bermond, P. Paulraja and M.-L. Yu, On Hamilton cycle decompositions of the tensor product of complete graphs Bermond, J.-C., see R. Balakrishnan Bulatov, A.A. and P.M. Idziak, Counting Mal’tsev clones on small sets
(1–3)
1– 19
(1–3)
21– 30
(1–3)
31– 48
(1–3) (1–3) (1–3)
49– 58 49– 58 59– 80
(1–3)
81–101
Chastand, M., Fiber-complemented graphs II. Retractions and endomorphisms Chen, C., F.K. Hwang, J.S. Lee and S.J. Shih, The existence of hyper-L triple-loop networks
(1–3) 287–291
Duursma, I., Extremal weight enumerators and ultraspherical polynomials
(1–3) 103–127
Eschen, E.M., W.F. Klostermeyer and R. Sritharan, Planar domination graphs
(1–3) 129–137
Finizio, N.J., see R.J.R. Abel
(1–3)
Ge, G. and C.W.H. Lam, Bhaskar Rao designs with block size four Ge, G. and C.W.H. Lam, Resolvable group divisible designs with block size four and group size six Goddard, W. and M.A. Henning, Nordhaus–Gaddum bounds for independent domination Gravier, S., F. Maffray and B. Mohar, On a list-coloring problem Greig, M., see R.J.R. Abel Guo, V.J.W., A simple proof of Dixon’s identity
(1–3) 293–298
1– 19
(1–3) 139–151 (1–3) 299–302 (1–3) 303–308 (1–3) 1– 19 (1–3) 309–310
Henning, M.A., see W. Goddard Heuberger, C., On planarity and colorability of circulant graphs Hibi, T., see H. Ohsugi Hwang, F.K., On Macula’s error-correcting pool designs Hwang, F.K., see C. Chen
(1–3) (1–3) (1–3) (1–3) (1–3)
299–302 153–169 217–242 311–314 287–291
Idziak, P.M., see A.A. Bulatov
(1–3)
59– 80
Kim, H.K., see J. Ahn Kim, J.S., see J. Ahn
(1–3) (1–3)
21– 30 21– 30
0012-365X/03/$ - see front matter doi:10.1016/S0012-365X(03)00171-7
352
Author index to volume 268
Kim, M., see J. Ahn Klostermeyer, W.F., see E.M. Eschen Kremer, D. and W.C. Shiu, Finite transition matrices for permutations avoiding pairs of length four patterns
(1–3) 21– 30 (1–3) 129–137
Lam, C.W.H., see G. Ge Lam, C.W.H., see G. Ge Lee, J.S., see C. Chen Lewis, S.J., see R.J.R. Abel Li, J., see B.-Y. Zhang Li, R. and R.H. Schelp, Every 3-connected distance claw-free graph is Hamiltonconnected Li, X. and C.-Q. Zhang, Chords of longest circuits in 3-connected graphs
(1–3) (1–3) (1–3) (1–3) (1–3)
Maffray, F., see S. Gravier Mierendorff, H., Magic twin body stars generated from chains of prismoids Mohar, B., see S. Gravier
(1–3) 303–308 (1–3) 315–323 (1–3) 303–308
$ Naserasr, R. and R. Skrekovski, The Petersen graph is not 3-edge-colorable—a new proof Negami, S., Composite planar coverings of graphs
(1–3) 325–326 (1–3) 207–216
Ohsugi, H. and T. Hibi, Normalized volumes of configurations related with root systems and complete bipartite graphs
(1–3) 217–242
Paulraja, P., see R. Balakrishnan Prisner, E., The recognition problem for line bigraphs
(1–3) 49– 58 (1–3) 243–256
Schelp, R.H., see R. Li Sharir, M. and S. Smorodinsky, On neighbors in geometric permutations Shih, S.J., see C. Chen Shin, D.-J. and W. Sung, A new Kloosterman sum identity over F2m for odd m Shiu, W.C., see D. Kremer $ Skrekovski, R., see R. Naserasr Smorodinsky, S., see M. Sharir Sritharan, R., see E.M. Eschen Sung, W., see D.-J. Shin
(1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3) (1–3)
Truss, J.K., The automorphism group of the random graph: four conjugates good, three conjugates better
(1–3) 257–271
Yu, M.-L., see R. Balakrishnan
(1–3)
49– 58
Zhang, B.-Y. and J. Li, An improvement of the two-line algorithm for proving q-hypergeometric identities Zhang, C.-Q., see X. Li Zhang, H., see L. Zhu Zhu, L. and H. Zhang, Completing the spectrum of r-orthogonal Latin squares
(1–3) (1–3) (1–3) (1–3)
273–286 199–206 343–349 343–349
(1–3) 171–183 139–151 293–298 287–291 1– 19 273–286
(1–3) 185–197 (1–3) 199–206
185–197 327–335 287–291 337–341 171–183 325–326 327–335 129–137 337–341