Table Of Content

Discrete Applied Mathematics 44 (1993) 311-312 North-Holland Author Index Volume 44 (1993) Adler, I., A.J. Hoffman and R. Shamir, Monge and feasibility sequences in general flow problems (1-3) 21- 38 Anstee, R.P., Minimum vertex weighted deficiency of (g, f )-factors: A greedy algorithm (1-3) 247-260 Arikati, S.R. and U.N. Peled, A linear algorithm for the group path problem on chordal graphs (1-3) 185-190 Bandelt, H.-J., M. Farber and P. Hell, Absolute reflexive retracts and absolute bipartite retracts (1-3) 9- 20 Bernhard, P.J., S.T. Hedetniemi and D.P. Jacobs, Efficient sets in graphs (1-3) 99-108 Blair, J.R.S., The efficiency of AC graphs (1-3) 119-138 Brigham, R.C., see T.W. Haynes (1-3) 295-304 Cai, L. and F. Maffray, On the SPANNING k-TREE problem (1-3) 139-156 Chang, Y.-W., M.S. Jacobson, C.L. Monma and D.B. West, Subtree and substar intersection numbers (1-3) 205-220 Chvatal, V., Which claw-free graphs are perfectly orderable? (1-3) 39- 63 Colbourn, C.J., A. Satyanarayana, C. Suffel and K. Sutner, Computing residual connectedness reliability for restricted networks (1-3) 221-232 Dutton, R.D., see T.W. Haynes (1-3) 295-304 Elmallah, E.S. and L.K. Stewart, Independence and domination in polygon graphs (1-3) 65- 77 Farber, M., see H.-J. Bandelt (1-3) 9- 20 Fishburn, P.C. and F.S. Roberts, Elementary sequences, sub-Fibonacci sequences (1-3) 261-281 Golumbic, M.C. and R.C. Laskar, Irredundancy in circular arc graphs (1-3) 79- 89 Hartman, A. and Y. Medan, Covering the complete graph with plane cycles (1-3) 305-310 Haynes, T.W., R.C. Brigham and R.D. Dutton, Extremal graphs domination insensitive to the removal of k edges (1-3) 295-304 Hedetniemi, S.T., see P.J. Bernhard (1-3) 99-108 Hell, P., see H.-J. Bandelt (1-3) 9- 20 Hoffman, A.J., see I. Adler (1-3) 21- 38 Isaak, G., Bounded discrete representations of interval orders (1-3) 157-183 Jacobs, D.P., see P.J. Bernhard (1-3) 99-108 Jacobson, M.S., J. Lehel and L.M. Lesniak, ¢-threshold and @-tolerance chain graphs (1-3) 191-203 Jacobson, M.S. and K. Peters, A note on graphs which have upper irredundance equal to independence (1-3) 91- 97 Jacobson, M.S., see Y.-W. Chang (1-3) 205-220 Laskar, R.C., see M.C. Golumbic (1-3) 79- 89 Lehel, J., see M.S. Jacobson (1-3) 191-203 Lesniak, L.M., see M.S. Jacobson (1-3) 191-203 Maffray, F., see L. Cai (1-3) 139-156 Medan, Y., see A. Hartman (1-3) 305-310 Elsevier Science Publishers B.V. 312 Author index Monma, C.L., see Y.-W. Chang (1-3) 205-220 Peled, U.N., see S.R. Arikati (1-3) 185-190 Peters, K., see M.S. Jacobson (1-3) 91- 97 Prémel, H.J. and A. Steger, Excluding induced subgraphs II: extremal graphs (1-3) 283-294 Proskurowski, A., see J.A. Telle (1-3) 109-117 Roberts, F.S., see P.C. Fishburn (1-3) 261-281 Satyanarayana, A., see C.J. Colbourn (1-3) 221-232 Scheinerman, E.R. and A. Trenk, On generalized perfect graphs: bounded degree and bounded edge perfection (1-3) 233-245 Shamir, R., see I. Adler (1-3) 21- 38 Steger, A., see H.J. Proémel (1-3) 283-294 Stewart, L.K., see E.S. Elmallah (1-3) 65- 77 Suffel, C., see C.J. Colbourn (1-3) 221-232 Sutner, K., see C.J. Colbourn (1-3) 221-232 Telle, J.A. and A. Proskurowski, Efficient sets in partial k-trees (1-3) 109-117 Trenk, A., see E.R. Scheinerman (1-3) 233-245 West, D.B., see Y.-W. Chang (1-3) 205-220