Discrete Mathematics 1994: Vol 124 Index

1 Pages·1994·0.22 MB·English

Discrete Mathematics 124 (1994) 271
North-Holland
Author index to volume 124 (1994)
(1-3) 3-12
Bagga, K.S., L.W. Beineke, M.J. Lipman and R.E. Pippert, Edge-integrity: a survey
Bauer, D., A. Morgana and E. Schmeichel, On the complexity of recognizing
(1-3) 13-17
tough graphs
(1-3) 3-12
Beineke, L.W., see Bagga, K.S.
(1-3) 19- 36
Biggs, N., Combinatorics and connectionism
Broersma, H.J. and I. Schiermeyer, A closure concept based on neighborhood
(1-3) 37- 47
unions of independent triples
Brouwer, A.E. and M. Numata, A characterization of some graphs which do not
(1-3) 49- 54
contain 3-claws
(1-3) 55- 66
Dejter, I.J.. On symmetric subgraphs of the 7-cube: an overview
(1-3) 67- 78
Fiol, M.A., The superconnectivity of large digraphs and graphs
(1-3) 79- 86
Gionfriddo, M. and Z. Tuza, On conjectures of Berge and Chvatal
(1-3) 87- 98
Gropp, H., Nonsymmetric configurations with natural index
(1-3) 99-105
Harary, F., Sum graphs over all the integers
Hartman, A., The fundamental construction for 3-designs (1-3) 107-132
Kamath, G.D., see Sampathkumar, E. (1-3) 173-177
Krasikov, I. and J. Schonheim, On near subgroups (1-3) 133-136
Lipman, M.J., see Bagga, K.S. (1-3) 3-12
Lovasz. L., Stable sets and polynomials (1-3) 137-153
McDiarmid, C.J.H. and A. Sanchez-Arroyo, Total colouring regular bipartite graphs
is NP-hard (1-3) 155-162
Moon, J.W., Some determinant expansions and the matrix-tree theorem (1-3) 163-171
Morgana, A., see Bauer, D. (1-3) 13- 17
Numata, M., see Brouwer, A.E. (1-3) 49- 54
Pippert, R.E., see Bagga, K.S. (1-3) 3-12
Sirai, J. and M. Skoviera, Regular maps from Cayley graphs II: Antibalanced
(1-3) 179-191
Cayley maps
(1-3) 179-191
Skoviera, M., see Sirai, J.
(1-3) 155-162
Sanchez-Arroyo, A., see McDiarmid, C.J.H.
(1-3) 173-177
Sampathkumar, E. and G.D. Kamath, A generalization of chromatic index
(1-3) 37- 47
Schiermeyer, I., see Broersma, H.J.
(1-3) 13-17
Schmeichel, E., see Bauer, D.
(1-3) 133-136
Schonheim, J., see Krasikov, I.
(1-3) 193-216
Thatte, B.D., Some results and approaches for reconstruction conjectures
(1-3) 217-228
Thomassen, C., Embeddings of graphs
(1-3) 79- 86
Tuza, Z., see Gionfriddo, M.
(1-3) 229-239
Veldman, H.J., On dominating and spanning circuits in graphs
(1-3) 241-250
Vestergaard, P.D., Two-cacti with minimum number of spanning trees
(1-3) 251-269
Welsh, D.J.A., The computational complexity of knot and matroid polynomials