ebook img

Discrete Applied Mathematics 1997: Vol 80 Index PDF

3 Pages·1997·0.34 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Discrete Applied Mathematics 1997: Vol 80 Index

DISCRETE APPLIED MATHEMATICS Discrete Applied Mathematics 80 (1997) 269-270 Author Index Volume 80 (1997) Barefoot, C.A., R.C. Entringer and L.A. Székely, Extremal values for ratios of distances in trees (1) 37— 56 Calude, C. and S. Yu, Language-theoretic complexity of disjunctive sequences (2-3) 203—209 Chang, M.-S., Weighted domination of cocomparability graphs (2-3) 135-148 Charon, I.,O. Hudry and F. Woirgard, A 16-vertex tournament for which Banks set and Slater set are disjoint (2-3) 211-215 Chepoi, V., M. Deza and V. Grishukhin, Clin d’oeil on L,-embeddable planar graphs (1) 3— 19 Dankelmann, P., Average distance and domination number (1) 2i- 35 Deza, M., see V. Chepoi (1) 3— 19 Entringer, R.C., see C.A. Barefoot (1) 37— 56 Gauyacgq, G., Edge-forwarding index of star graphs and other Cayley graphs (2-3) 149-160 Giakoumakis, V. and I. Rusu, Weighted parameters in (Ps, P;)-free graphs (2-3) 255-261 Gravier, S. and M. Mollard, On domination numbers of Cartesian product of paths (2-3) 247-250 Grishukhin, V., see V. Chepoi (1) 3- 19 Gutman, I., see S. Klavzar (1) 73— 81 Hanazawa, M., see H. Narushima (2-3) 231-238 Hudry, O., see I. Charon (2-3) 211-215 Juvan, M., B. Mohar and J. Zerovnik, Distance-related invariants on polygraphs (1) 57— 71 Jiinger, M., see C.D. Simone (2-3) 223-229 Klavzar, S. and I. Gutman, Wiener number of vertex-weighted graphs and a chemical application (1) 73-— 81 Kovalyov, M.Y., Batch scheduling and common due data assignment problem: an NP-hard case 251-254 Laforest, C., Broadcast and gossip in line-communication mode 161—176 83— 96 Lam, P.C.B., see W.C. Shiu Macula, A.J., Error-correcting nonadaptive group testing with d°-disjunct matrices 217-222 McDiarmid, C., A doubly cyclic channel assignment problem 263-268 Meng, J.-X., see J.-Z. Wang 177-191 Mohar, B., see M. Juvan S7- 71 Mollard, M., see S. Gravier 247-250 Mulder, H.M., The majority strategy on graphs 97-105 Narushima, H. and M. Hanazawa, A more efficient algorithm for MPR problems in phylogeny 231-238 Pachter, L., Constructing status injective graphs 107-113 Reid, K.B., The k-ball /-path branch weight centroid 239-246 Rusu, I., see V. Giakoumakis 255-261 Shiu, W.C., C.S. Tong and P.C.B. Lam, Wiener number of hexagonal jagged-rectangles 83— 96 Shull, R. and A.N. Trenk, Cliques that are tolerance digraphs 119-134 Simone, C.D. and M. Jiinger, On the two-connected planar spanning subgraph polytope 223-229 Sun, W. and Y.X. Yang, Correlation functions of a family of generalized geometric sequences 193-201 Székely, L.A., see C.A. Barefoot 37— 56 270 Discrete Applied Mathematics 80 (1997) 269-270 Tong, C.S., see W.C. Shiu (1) 83— 96 Wang, J.-Z. and J.-X. Meng, The exponent of the primitive Cayley digraphs on finite Abelian groups (2-3) 177-191 Woirgard, F., see I. Charon (2-3) 211-215 Yang, Y.X., see W. Sun (2-3) 193-201 Yu, S., see C. Calude (2-3) 203-209 Zerovnik, J., see M. Juvan (1) Ss7- 71

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.