Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 95 (1999) 467-468 Author Index Volume 95 (1999) Ahliswede, R. and Z. Zhang, On maximal shadows of members in left-compressed sets 3- 9 Babel, L. and S. Olariu, On the p-connectedness of graphs - a survey 11- 33 Bang-Jensen, J. and G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs 41- 60 Bang-Jensen, J., Y. Guo and A. Yeo, A new sufficient condition for a digraph to be Hamiltonian 61- 72 Bennett, F.E., A brief survey of perfect Mendelsohn packing and covering designs 73- 81 Betten, A. and D. Betten, The proper linear spaces on 17 points 83-108 Betten, A., R. Laue and A. Wassermann, Simple 8-(40,11,1440) designs 109-114 Betten, D., see A. Betten 83-108 Bey, C., The Erdés-Ko-Rado bound for the functilaottnic e 115-125 Bezrukov, S.L., R. Elsasser and U.-P. Schroeder, On k-partitioning of Hamming graphs 127-140 Bar, G., On the Complexity of Linear Programming in the BSS-model 35- 40 Brandstadt, A. and P.L. Hammer, On the stability number of claw-free P;-free and more general graphs 163-167 Brandstadt, A. and V.B. Le, Tree- and forest-perfect graphs 141-162 Canfield, E.R. and K. Engel, An upper bound for the size of the largest antichain in the poset of partitioonf sa n integer 169-180 Cicerone, S. and G.D. Stefano, On the extension of bipartite to parity graphs 181-195 Cicerone, S. and G.D. Stefano, Graph classes between parity and distance-hereditary graphs 197-216 Cieslik, D., The Steiner ratio of #4, 217-221 Dragan, F.F., Almost diameter of a house-hole-free graph in linear time via LexBFS 223-239 Elsasser, R., see S.L. Bezrukov 127-140 Engel, K., see E.R. Canfield 169-180 Fomin, F.V., Note on a helicopter search problem on graphs 241-249 Griittmiiller, M., On the PBD-closure of sets containing 3 251-272 Guo, Y., see J. Bang-Jensen 61- 72 Guo, Y., Outpaths in semicomplete multipartite digraphs 273-277 Gutin, G., see J. Bang-Jensen 41- 60 Hammer, P.L., see A. Brandstadt 163-167 Harborth, H. and M. Moller, Weakened Ramsey numbers 279-294 Harper, L.H., On an isoperimetric problem for Hamming graphs 285-309 Hartmann, S., Asymptotic results on suborthogonal 6-decompositions of complete digraphs 311-320 Imrich, W. and S. Klavzar, Recognizing graphs of acyclic cubical complexes 321-330 Jungnickel, D. and A. Pott, Perfect and almost perfect sequences 331-359 Khosrovshahi, G.B., H.R. Maimani and R. Torabi, On trades: an update 361-376 Klavzar, S., see W. Imrich 321-330 Laue, R., see A. Betten 109-114 Le, V.B., see A. Brandstadt 141-162 468 Discrete Applied Mathematics 95 (1999) 467-468 Leck, U. and V. Leck, Orthogonal double covers of complete graphs by trees of small diameter (1-3) 377-388 Leck, V., see U. Leck (1-3) 377-388 Mahjoub, A.R. and C. Nocq, On the linear relaxation of the 2-node connected subgraph polytope (1-3) 389-416 Maimani, H.R., see G.B. Khosrovshahi (1-3) 361-376 Mengersen, I. and J. Oeckermann, Matching-star Ramsey sets (1-3) 417-424 Moller, M., see H. Harborth (1-3) 279-294 Nocgq, C., see A.R. Mahjoub (1-3) 389-416 Nurmela, K.J. and P.R.J. Ostergard, Covering t-sets with (t + 2)-sets (1-3) 425-437 Oeckermann, J., see I. Mengersen (1-3) 417-424 Olariu, S., see L. Babel (1-3) l1- 33 Ostergard, P.R.J., see K.J. Nurmela (1-3) 425-437 Pott, A., see D. Jungnickel (1-3) 331-359 Schroeder, U.-P., see S.L. Bezrukov (1-3) 127-140 Schumacher, U., Suborthogonal double covers of the complete graph by stars (1-3) 439-444 Stefano, G.D., see S. Cicerone (1-3) 197-216 Stefano, G.D., see S. Cicerone (1-3) 181-195 Tittmann, P., Partitions and network reliability (1-3) 445-453 Torabi, R., see G.B. Khosrovshahi (1-3) 361-376 Wagler, A., Critical edges in perfect line graphs and some polyhedral consequences (1-3) 455-466 Wassermann, A., see A. Betten (1-3) 109-114 Yeo, A., see J. Bang-Jensen (1-3) 61- 72 Zhang, Z., see R. Ahlswede (1-3) 3- 9