- Email: [email protected]
Author index volume 34 (1981)
Discrete Mathematics 34 (1981) 329-330 North-Holland Publish@ Company
v&me 34 (ml) D?Agostiai, E., On caps with weighted paints in PQ(t,.qj ;2) lO%J IO Akiyama, J., H. Era, and. GExoo, Further results on graph equationscfor line g&p&;, and rr.-th power graphs &09-218 Alexanderson, G.L. and J.E. Wet&& &raugements,of -p@nes-in space (3) 219-UO Alspach, B. and M. Qosenfeld,Realization of certain generalized paths in tournaments (2) 199-202 wote1 Barth&my, J.-P. About the shortest chain between two vertices in a quasi strongly COMWted dimph with a potential (Communication) (3) 321-324 Boshemitzan, M. urd A.S. Fraenkel, Nonhomogeneous spe@a of numbers (CommuniCation) {3) 325-327 Brigham, R.C. and R.D. Dutton, Graphs which, w&h.their complements, have certain .. clique covering numbers (I) l-7 Brouwer; A.E. and R. Tijdeman, On the edge-&owing problem for unions -of complete uniform hypergraphs (3) 242,-260 Burge, W&I.,A correspondence between partitions relayed .to generalizations of the ’ Rogers-Ramanujan identities (1) 9-1s Carmony, LA. and S-T. Tan, S-quasi-symmetry . (1)17-24 (1) 85-87 Chandak, ML., see B.L. Misra Charalambides, Ch.A., Bipartitional polynomials and their applications in com(1) 81-84 binatorics and statistics (Note) (1) 1-7 Dutton, RD., see RC. Brigham (3) 209-218 Era, H., see J. Akiyanw (3) 209-21s Exoo, G., see J. Akiypma (3) 325-327 Fraenkel, AS., see M, Boshemitzan Frank& P. and Z. Fiilredi, A short proof for a theorem of Harper about Hamming(3) 311-313 spheres (Note) (3) 311-313 Furedi, Z., see P. Frank1 Gallivan, S., E.R. Lockeberg and P. McMullen, Complete subgrar hs of the graphs of (1) 25-23 convex polytQpes Gionfriddo, M, and CC, Lindner, Construction of Steiner quadruple systems having a (1) 31-42 prwribed number of blocks in common (2) 111-117 Gould, R.J., On tine graphs and the hamiltonian index (2) 119-13:3 Gronau, H.-D.O.F., On maximal families of subsets of a finite set Griitschel, M. and Y. Wskabayashi, On the structure of the monotone asymmetric (1) 43-59 travelling salesman polytope I: hypohamiltonian facets (2) 131-1 qt3 Hahn, G., More star sub-Ramsey numbers Hartfiel, D.J. and C.J. Maxson, The construction and decomposition of patterns (3) 26” 274 induced by a positive cone of functions (1) 6 r-67 Hoede, C. and H.J. Veldman, Contraction theorems in Hamiltonian graph theory (2) 141-144 Kriegl, A., A characterization of reduced incidence :&lgebras (1) 31-42 Lindner, C.C., see M. Gionfriddo (1) 25-29 Loekeberg, E.R.. see S. Gallivan (2) 145-152 Maamoun, M., Parite des cycles contenant des sommets speci%s d’un graphe (3) 275-281 Marques de SB, E., Note on graphs and weakly cyt:Iic matrices (3) 261-274 Maxson; C.J., see D.J. Ha&e1 (3) 315-318 McKee, T.A., A quantifier for matroid duality (Note) (I) 25-29 McMullen, P., see S. Gallivan
330
Au&or Index
Misra, B.L. and MI,. Chandak, Construction of symmetric PBlB designs and related results (Note) Miiller, H., Oriented hypergaphs, stability numbers and chromatic numbers (Note) Naddef, D. and W.R. Pulleyblank, Matchings in regular grands 1 Per], Y. and S. Zaks, Deficient generalized fibonaccl maximum path graphs Poljak, S. and A. Pultr, On the dimension of trees Po!jak, S. and V. Rijdl, On set systems determined by intersections Pulleyblank, W.P., see D. Naddef Pultr, A., see S. Poljak R&H, V., see S. Poljak Rosenfeld, M., see B. Alspach Shapiro, L.W., A combinatorial proof of a Chebyshev polynomial identity (Note) Slater, P.J., On k-sequential and other numbered graphs Tan, S.T., see LA. Carmony TBndGreanu, N., On generalized Boolean functions I Tijdeman, R., see -4.E. Brouwer Tomasta, P., “DUE calculus” of induced subsets Turner, B. and K. Warner, The structure and geometry of 4 x 4 pandiagonal matrices Veldman, H.J., see C. Hoede VitBnyi, P.M.B., How well can a graph be n-colored? Wakabayashi, Y., see M. Griitschel Warner, K., see B. Turner Wetzel, J.E., see G.L. Alexanderson Yoshizawa, M., Remarks on distance-regular graphs (Communication I Zaks, S., see Y. Per1 Zeilberger, D., Enumeration of words by their number of mistakes (Note) Zhu, L., Affinely totally variant subsets of V1,(GF(3)) (Communication)
(1) 85-87 (3) 319-320 (3) 283-291 (2) 153-164 (2) 165-171 (2) 173-184 (3) 283-291 (2) 165-17 1 (2) 173-184 (2) 199-202 (2) 203-206 (2) 185-193 (1) 17-24 (3) 293-299 (3) 241-260 (2) 195-198 (5; ?GP-310 (1) 61-67 (1) 69-90 (1) 43-59 (3) 301-310 (3) 219-240 (1) 93-94 (2) 153-164 (1) 89-91 (1) 95-99
v&me 34 (ml) D?Agostiai, E., On caps with weighted paints in PQ(t,.qj ;2) lO%J IO Akiyama, J., H. Era, and. GExoo, Further results on graph equationscfor line g&p&;, and rr.-th power graphs &09-218 Alexanderson, G.L. and J.E. Wet&& &raugements,of -p@nes-in space (3) 219-UO Alspach, B. and M. Qosenfeld,Realization of certain generalized paths in tournaments (2) 199-202 wote1 Barth&my, J.-P. About the shortest chain between two vertices in a quasi strongly COMWted dimph with a potential (Communication) (3) 321-324 Boshemitzan, M. urd A.S. Fraenkel, Nonhomogeneous spe@a of numbers (CommuniCation) {3) 325-327 Brigham, R.C. and R.D. Dutton, Graphs which, w&h.their complements, have certain .. clique covering numbers (I) l-7 Brouwer; A.E. and R. Tijdeman, On the edge-&owing problem for unions -of complete uniform hypergraphs (3) 242,-260 Burge, W&I.,A correspondence between partitions relayed .to generalizations of the ’ Rogers-Ramanujan identities (1) 9-1s Carmony, LA. and S-T. Tan, S-quasi-symmetry . (1)17-24 (1) 85-87 Chandak, ML., see B.L. Misra Charalambides, Ch.A., Bipartitional polynomials and their applications in com(1) 81-84 binatorics and statistics (Note) (1) 1-7 Dutton, RD., see RC. Brigham (3) 209-218 Era, H., see J. Akiyanw (3) 209-21s Exoo, G., see J. Akiypma (3) 325-327 Fraenkel, AS., see M, Boshemitzan Frank& P. and Z. Fiilredi, A short proof for a theorem of Harper about Hamming(3) 311-313 spheres (Note) (3) 311-313 Furedi, Z., see P. Frank1 Gallivan, S., E.R. Lockeberg and P. McMullen, Complete subgrar hs of the graphs of (1) 25-23 convex polytQpes Gionfriddo, M, and CC, Lindner, Construction of Steiner quadruple systems having a (1) 31-42 prwribed number of blocks in common (2) 111-117 Gould, R.J., On tine graphs and the hamiltonian index (2) 119-13:3 Gronau, H.-D.O.F., On maximal families of subsets of a finite set Griitschel, M. and Y. Wskabayashi, On the structure of the monotone asymmetric (1) 43-59 travelling salesman polytope I: hypohamiltonian facets (2) 131-1 qt3 Hahn, G., More star sub-Ramsey numbers Hartfiel, D.J. and C.J. Maxson, The construction and decomposition of patterns (3) 26” 274 induced by a positive cone of functions (1) 6 r-67 Hoede, C. and H.J. Veldman, Contraction theorems in Hamiltonian graph theory (2) 141-144 Kriegl, A., A characterization of reduced incidence :&lgebras (1) 31-42 Lindner, C.C., see M. Gionfriddo (1) 25-29 Loekeberg, E.R.. see S. Gallivan (2) 145-152 Maamoun, M., Parite des cycles contenant des sommets speci%s d’un graphe (3) 275-281 Marques de SB, E., Note on graphs and weakly cyt:Iic matrices (3) 261-274 Maxson; C.J., see D.J. Ha&e1 (3) 315-318 McKee, T.A., A quantifier for matroid duality (Note) (I) 25-29 McMullen, P., see S. Gallivan
330
Au&or Index
Misra, B.L. and MI,. Chandak, Construction of symmetric PBlB designs and related results (Note) Miiller, H., Oriented hypergaphs, stability numbers and chromatic numbers (Note) Naddef, D. and W.R. Pulleyblank, Matchings in regular grands 1 Per], Y. and S. Zaks, Deficient generalized fibonaccl maximum path graphs Poljak, S. and A. Pultr, On the dimension of trees Po!jak, S. and V. Rijdl, On set systems determined by intersections Pulleyblank, W.P., see D. Naddef Pultr, A., see S. Poljak R&H, V., see S. Poljak Rosenfeld, M., see B. Alspach Shapiro, L.W., A combinatorial proof of a Chebyshev polynomial identity (Note) Slater, P.J., On k-sequential and other numbered graphs Tan, S.T., see LA. Carmony TBndGreanu, N., On generalized Boolean functions I Tijdeman, R., see -4.E. Brouwer Tomasta, P., “DUE calculus” of induced subsets Turner, B. and K. Warner, The structure and geometry of 4 x 4 pandiagonal matrices Veldman, H.J., see C. Hoede VitBnyi, P.M.B., How well can a graph be n-colored? Wakabayashi, Y., see M. Griitschel Warner, K., see B. Turner Wetzel, J.E., see G.L. Alexanderson Yoshizawa, M., Remarks on distance-regular graphs (Communication I Zaks, S., see Y. Per1 Zeilberger, D., Enumeration of words by their number of mistakes (Note) Zhu, L., Affinely totally variant subsets of V1,(GF(3)) (Communication)
(1) 85-87 (3) 319-320 (3) 283-291 (2) 153-164 (2) 165-171 (2) 173-184 (3) 283-291 (2) 165-17 1 (2) 173-184 (2) 199-202 (2) 203-206 (2) 185-193 (1) 17-24 (3) 293-299 (3) 241-260 (2) 195-198 (5; ?GP-310 (1) 61-67 (1) 69-90 (1) 43-59 (3) 301-310 (3) 219-240 (1) 93-94 (2) 153-164 (1) 89-91 (1) 95-99