- Email: [email protected]
Master index of volumes 141–150
Master index of volumes 141-150 Abrham, J. and A. Kotzig, Graceful valuations of 2-regular graphs with two components Acketa, D.M., see S. Matib-Keki6 Adams, P., E.J. Billington and D.E. Bryant, Partitionable perfect cycle systems with cycle lengths 6 and 8 Ahlswede, R. and L.H. Khachatrian, A counterexample to Aharoni's strongly maximal matching conjecture (Note) Aigner, M., E. Triesch and Z. Tuza, Searching for acyclic orientations of graphs Ainouche, A., A common generalization of Chv~,tal-Erd6s' and Fraisse's sufficient conditions for hamiltonian graphs Akemann, C.A. and J. Anderson, The continuous BeckFiala theorem is optimal Akkari, S., Random packing by matroid bases and triangles Albertson, M.O. and R. Haas, Parsimonious edge coloring Aluffi, P., A blow-up construction and graph coloring Anderson, J., see C.A. Akemann Ando, K., S. Fujishige and T. Naitoh, A characterization of bisubmodular functions (Note) Ando, K., A. Kaneko and S. Gervacio, The bandwidth of a tree with k leaves is at most [-k-](Note) Andreae, T., On independent cycles and edges in graphs
(Note) Andreae, T. and C. Flotow, On covering all cliques of a chordal graph (Note) Arasu, K.T., D. Jungnickel, S.L. Ma and A. Pott, Relative difference sets with n = 2 Archdeacon, D., see J. Chen Archdeacon, D. and D.A. Grable, The genus of a random graph Baliflska, K.T. and L.V. Quintas, Degrees in a digraph whose nodes are graphs Bandelt, H.-J., A. Henkmann and F. Nicolai, Powers of distance-hereditary graphs Elsevier ScienceB.V.
150 (1996) 3 - 15 150 (1996) 303-313 149
(1996)
1-
9
149
(1996) 289
144
(1995)
3- 10
142
(1995)
1- 19
146 (1995) 145 (1995) 148 (1996) 145 (1995) 146 (1995)
1- 9 1- 9 1- 7 11- 35 1- 9
148
(1996) 299-303
150
(1996) 403-406
149
(1996) 291-297
149
(1996) 299-302
147 (1995) 149 (1996)
1- 17 19- 29
142
(1995)
21- 37
150
(1996)
17- 29
145
(1995)
37- 60
Master index of volumes 141-150
Bao, X., Two new symmetric inseparable double squares
(Note) Barahona, F. and A.R. Mahjoub, On two-connected subgraph polytopes Barefoot, C.A., L.H. Clark, R.C. Entringer, T.D. Porter, L.A. Sz6kely and Zs. Tuza, Cycle-saturated graphs of minimum size Barnes, F.W., Best packing of rods into boxes (Note) Barraez, D., E. Flandrin, H. Li and O. Ordaz, Dominating cycles in bipartite biclaw-free graphs Bauer, D., H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree Berman, A., see R. Michel Berrizbeitia, P. and R.E. Giudici, Counting pure k-cycles in sequences of Cayley graphs Bessenrodt, C., Generalisations of the Andrews-Olsson partition identity and applications Bialostocki, A., H. Lefmann and T. Meerdink, On the degree of regularity of some equations Billington, E.J., see P. Adams Blanchard, J.L., An extension theorem for Steiner systems B6na, M. and G. T6th, A Ramsey-type problem on rightangled triangles in space Bogart, K.P. and A.N. Trenk, Bipartite tolerance
(Corrioendum) Boisen, P., Polynomials and packings: a new proof of de Bruijn's theorem (Note) Bondy, J.A., A short proof of the Chen-Manalastas theorem
(Note) Bonnington, C.P., W. lmrich and M.E. Watkins, Separating double rays in locally finite planar graphs Booth, R.S., see J.F. Weng Boros, E. and R. Meshulam, On the number of flats spanned by a set of points in PG(d, q) (Note) Brandt, S. and E. Dobson, The Erd6s-S6s conjecture for graph of girth 5 (Note) Brass, P., On the Erd6s-diameter of sets (Note) Brewster, T.L., M.J. Dinneen and V. Faber, A computational attack on the conjectures of Graffiti: New counterexamples and proofs Brigham, R.C., see R.D. Dutton Broersma, H.J., see D. Bauer
141
(1995) 275-277
147
(1995)
150 142
(1996) 31- 48 (1995) 271-275
146
(1995)
141 146
(1995) 1- 10 (1995) 313-320
149
(1996)
11- 18
141
(1995)
11- 22
150 (1996) 149 (1996) 141 (1995)
49- 60 1- 9 23- 35
150
(1996)
61- 67
145
(1995) 347
146
(1995) 285-287
146
(1995) 289-292
145 141
(1995) 61- 72 (1995) 259-274
150
(1996) 407-409
19- 34
11- 18
150 (1996) 411-414 150 (1996) 415-419
147 (1995) 35- 55 147 (1995) 293-295 141 (1995) 1- 10
Master index of volumes 141-150 Brualdi, R.A. and Fonseca, A., On the quasi-transversals of a matroid (Note) Brualdi, R.A., J.S. Graves and K.M. Lawrence, Codes with a poser metric Bryant, D.E., see P. Adams Burris, A.C., The irregular coloring number of a tree (Note) Buze~eanu, $.N. and V. Domoco~, Polynomial identities from weighted lattice path counting (Note) Buze~eanu, $.N., see V. Domoco~ Catlin, P.A. and H.-J. Lai, Vertex arboricity and maximum degree Chan, O., C.C. Chen and Q. Yu, On 2-extendable abelian Cayley graphs Chan, W., An exchange property of matroid (Note) Chang, G.J. and Y.-J. Tsay, The partial gossiping problem Chapman, R.J., Shrinking integer lattices Chari, M.K., Matroid inequalities (Communication) Chartrand, G., H. Gavlas and M. Schultz, Convergent sequences of iterated H-line graphs Chen, C., Binding number and toughness for matching extension (Note) Chen, C.C., see O. Chan Chen, J., D. Archdeacon and J i . Gross, Maximum genus and connectivity Chen, W. and T. Klove, Lower bounds on multiple distinct sums sets Chetwynd, A.G. and S.J. Rhodes, Chessboard squares Chia, G.L., The chromaticity of wheels with a missing spoke II (Note) Chiang, N.-P. and H.-L. Fu, The achromatic indices of the regular complete multipartite graphs Choudum, S.A. and K. Kayathri, There are no edgechromatic 4-critical graphs of order 12 Chow, T.Y., On the Dinitz conjecture and related conjectures Christen, C.A., G. Coray and S.M. Selkow, A characterization of n-component graphs (Communication) Chrz~towski-Wachtel, P., see M. Raczunas Chung, M.S. and D.B. West, Large 2P3-free graphs with bounded degree Cimikowski, R. and D. Coppersmith, The sizes of maximal planar, outerplanar, and bipartite planar subgraphs (Note)
7
146 (1995) 293-297 147 (1995) 57- 72 149 (1996) 1- 9 141 (1995) 279-283 150 (1996) 421-425 147 (1995) 287-292
141
(1995)
146 146 148 142 147
(1995) 19- 32 (1995) 299-302 9- 14 (1996) (1995) 39- 48 (1995) 283-286
147 (1995)
37- 46
73- 86
146 (1995) 303-306 146 (1995) 19- 32 149
(1996)
19- 29
148 (1996) 141 (1995)
15- 35 47- 59
148 (1996) 305-310 141
(1995)
61- 66
141 (1995) 145 (1995)
67- 73 73- 82
149 (1996) 279-281 150 (1996) 347-357 150 (1996)
69- 79
149 (1996) 303-309
8
Master index of volumes 141-150
Clark, L.H., see C.A. Barefoot Cockayne, E.J. and C.M. Mynhardt, A characterisation of universal minimal total dominating functions in trees Coppersmith, D., see R. Cimikowski Coray, G., see C.A. Christen Csizmadia, G., Furthest neighbours in space Denley, T., The Ramsey numbers for disjoint unions of cycles Dias da Silva, J.A. and A. Fonseca, The r-depth ofa matroid Dilcher, K., Some q-series identities related to divisor functions Ding, G. and B. Oporowski, On tree-partitions of graphs Ding, K. and P. Terwilliger, On Garsia-Remmel problem of rook equivalence Dinneen, M.J., see T.L. Brewster Dobson, E., see S. Brandt Dobson, E., Isomorphism problem for Cayley graphs of Z~ Domoco~ V., see $.N. Buze!~eanu Domoco~, V. and $.N. Buze[eanu, The generating function of irreducible coverings by edges of complete k-partite graphs (Note) Dong, F.-M. and Y. Liu, On the chromatic uniqueness of the graph W(n, n - 2) + Kk Du, D.-Z., see B. Gao Du, B., The existence of orthogonal diagonal Latin squares with subsquares Dunbar, J., S. Hedetniemi, M.A. Henning and A.A. McRae, Minus domination in regular graphs (Note) Dunham, D., D.S. Jungreis and D. Witte, Infinite Hamiltonian paths in Cayley digraphs of hyperbolic symmetry groups Dutton, R.D. and R.C. Brigham, On the radius and diameter of the clique graph (Note) Dym/16ek, W.M. and T. Whaley, Generating strings for bipartite Steinhaus graphs Edelman, P.H., Lexicographically first reduced words Ehrenfeucht, A., see E. Knill Eke, B.G., Coprimes in blocks of successive integers (Note) Entringer, R.C., see C.A. Barefoot Erd5s, P., T. Gallai and Z. Tuza, Covering and independence in triangle structures
150 (1996) 141 149 149 150
31- 48
(1995) 75- 84 (1996) 303-309 (1996) 279-281 (1996) 81- 88
149 (1996) 141 (1995)
31- 44 85- 93
145 (1995) 149 (1996)
83- 93 45- 58
149 147 150 147 150
(1996) 59- 68 (1995) 35- 55 (1996) 411-414 (1995) 87- 94 (1996) 421-425
147
(1995) 287-292
145 (1995) 142 (1995)
95-103 49- 63
148 (1996)
37- 48
149 (1996) 311-312
143
(1995)
147
(1995) 293-295
141
(1995)
147 141 149 150
(1995) 95-106 (1995) 185-194 (1996) 313-317 (1996) 31- 48
150 (1996)
1- 30
95-107
89-101
Master index of volumes 141-150
9
Erd6s, P., R. Faudree, T.J. Reid, R. Schelp and W. Staton, Degree sequence and independence in K(4)-free graphs
(Note) Erdrs, P.L., U. Faigle and W. Kern, On the average rank of LYM-sets Evako, A.V., Topological properties of the intersection graph of covers of n-dimensional surfaces Faber, V., see T.L. Brewster Faigle, U., see P.L. Erdfs Fanning, J.D., A family of symmetric designs (Note) Faudree, R., see P. Erdrs Faudree, R.J., R.J. Gould, M.S. Jacobson and L.M. Lesniak, Degree conditions and cycle extendability Faudree, R.J., R.J. Gould, M.S. Jacobson, J. Lehel and L.M. Lesniak, Graph spectra Favaron, O., Least domination in a graph Fedou, J.-M. and D. Rawlings, Statistics on pairs of permutations Felsner, S. and W.T. Trotter, Colorings of diagrams of interval orders and a-sequences of sets Fiol, M.A., On congruence in Z" and the dimension of a multidimensional circulant Fishel, S., Nonnegativity results for generalized q-binomial coefficients Flandrin, E., see D. Barraez Flotow, C., see T. Andreae Floudas, C.A., see C.D. Maranas Fonseca, A., see R.A. Brualdi Fonseca, A., see J.A. Dias da Silva Fouquet, J.-L., V. Giakoumakis, F. Maire and H. Thuillier, On graphs without p5 and _p5 Fraenkel, A.S. and M. Loebl, Complexity of circuit intersection in graphs Fu, H.-L. see N.-P. Chiang Fujishige, S., see K. Ando Galeana-Shnchez, H., B1- and Bz-orientable graphs in kernel theory (Note) Gallai, T., see P. Erd6s Gao, B., D.-Z. Du and R.L. Graham, A tight lower bound for the Steiner ratio in Minkowski planes Gao, G.-G. and G. Hahn, Minimal graphs that fold onto K,
(Note)
141
(1995) 285-290
144 (1995)
11- 22
147
(1995) 107-120
147 144 146 141
(1995) 35- 55 (1995) 11- 22 (1995) 307-312 (1995) 285-290
141
(1995) 109-122
150 (1996) 103-113 150 (1996) 115-122 143
(1995)
31- 45
144 (1995)
23- 31
141
(1995) 123-134
147 146 149 142 146 141
(1995) (1995) (1996) (1995) (1995) (1995)
121-137 11- 18 299-302 287-293 293-297 85- 93
146 (1995)
33- 44
141 (1995) 135-151 141 (1995) 61- 66 148 (1996) 299-303 143 (1995) 269-274 150 (1996) 89-101 142 (1995)
49- 63
142 (1995) 277-280
10
Master index of volumes 141-150
Gavlas, H., see G. Chartrand Gehrke, M. and E. Walker, Iterating conditionals and symmetric Stone algebras Geroldinger, A. and R. Schneider, The cross number of finite abelian groups III Giakoumakis, V., see J.-L. Fouquet Goldstern, M., R. Grossberg and M. Kojman, Infinite homogeneous bipartite graphs with unequal sides Gordon, G. and E. McDonnell, Trees with the same degree sequence and path numbers (Note) Gould, R.J., see R.J. Faudree Gould, R.J., see R.J. Faudree Grable, D.A., see D. Archdeacon Graham, R.L., see B. Gao Granot, F. and M. Penn, On the integral 4-packing of T-cuts Graves, J.S., see R.A. Brualdi Gravier, S. and A. Khelladi, On the domination number of cross products of graphs (Communication) Griffel, D.H. and C.A.N. Morris, Complete latin squares of order 2k (Note) Griggs, J.R. and Y.-C. Lin, Planar graphs with few vertices of small degree Griggs, J.R., Matchings, cutsets, and chain partitions in graded posets Gross, J.L., see J. Chen Gross, J.L. and T.W. Tucker, Stratified graphs for imbedding systems Grossberg, R., see M. Goldstern Gruszka, J., see T. Luczak Gu, W., see K.B. Reid Giudici, R.E., see P. Berrizbeitia Gulliver, T.A., Two new optimal ternary two-weight codes and strongly regular graphs Gurich, V., see L. Libkin Gutierrez, M. and L. Oubifia, Minimum proper interval graphs Gutin, G., Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs Gutman, I. and A. Ivi6, On Matula numbers Haas, R., see M.O. Albertson Haddad, L. and H. Zhou, Star chromatic numbers of hypergraphs and partial Steiner triple systems
147
(1995)
73- 86
148
(1996)
49- 63
150 (1996) 123-130 146 (1995) 33- 44 149
(1996)
69- 82
147 141 150 142 142 142 147
(1995) 297-300 (1995) 109-122 (1996) 103-113 (1995) 21- 37 (1995) 49- 63 (1995) 65- 75 (1995) 57- 72
145
(1995) 273-277
145
(1995) 291-293
143
(1995)
47- 70
144 149
(1995) (1996)
33- 46 19- 29
143 (1995) 71- 85 149 (1996) 69- 82 148 (1996) 311-316 147 (1995) 185-196 149 (1996) 11- 18 149 145
(1996) 83- 92 (1995) 321-327
142
(1995)
141 150
(1995) 153-162 (1996) 131-142
148
(1996)
146
(1995)
77- 85
1-
7
45- 58
Master index of volumes 141-150
Hahn, G., see G.-G. Gao Hakimi, S.L., J. Mitchem and E. Schmeichel, Star arboricity of graphs Halbeisen, L. and N. Hungerbiihler, The general counterfeit coin problem Hamada, N. and T. Helleseth, A characterization of some {3v,+1, 3v,; k-l,q}-minihypers and some [ n , k , q k-1 - 3qU; q]-codes (k + 3, q + 5, 1 ~<# < k - 1) meeting the Griesmer bound Harant, J. and P.J. Owens, Non-hamiltonian ¼-tough maximal planar graphs (Note) Harant, J., P.J. Owens, M. Tkfid and H. Walther, 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one Hartsfield, N. and W.F. Smyth, A family of sparse graphs of large sum number Hartvigsen, D., Generalizing the all-pairs rain cut problem Hauge, E.R. and J. Mykkeltveit, On the classification of deBruijn sequences Hauge, E.R., On the cycles and adjacencies in the complementary circulating register Haukkanen, P., An abstract M6bius inversion formula with number-theoretic applications Haussler, D., see E. Knill Haviland, J., Independent domination in regular graphs (Note)
Haxell, P.E., Atoms of set systems with a fixed number of pairwise unions Heden, O., On Bruen chains Heden, O., Maximal partial spreads and the modular n-queen problem I1 Hedetniemi, S., see J. Dunbar Helleseth, T., see N. Hamada Helleseth, T. and P.V. Kumar, The weight hierarchy of the Kasami codes Henkmann, A., see H.-J. Bandelt Henning, M.A., see J. Dunbar Henning, M.A., Irredundance perfect graphs Ho/mg, C.T., Hamiltonian degree conditions for tough graphs Hobart, S., see D.G. Hoffman Hoffman, D.G., S. Hobart and R.C. Mullin, Near subgroups of groups
11
142 (1995) 277-280 149 (1996)
93- 98
147 (1995) 139-150
146 (1995) 147
59- 67
(1995) 301-305
150 (1996) 143-153 141 (1995) 163-171 147 (1995) 151-169 148 (1996)
65- 83
145 (1995) 105-132 142 (1995) 87- 96 141 (1995) 185-194 143
(1995) 275 280
150 (1996) 155-166 146 (1995) 69- 96 142 (1995) 97-106 149 (1996) 311-312 146 (1995) 59- 67 145 145 149 142
(1995) 133-143 (1995) 37- 60 (1996) 311-312 (1995) 107-120
142 (1995) 121-139 146 (1995) 97-108 146 (1995)
97-108
12
Master index of volumes 141-150
Hoffman, I. and A. Soifer, Another six-coloring of the plane (Note) Hofmeister, M., Graph covering projections arising from finite vector spaces over finite fields Hong, S., J.H. Kwak and J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extension property Hor~tk, M., R. Lauff and R. Sotfik, On existence of hypergraphs with prescribed edge degree profile Horng, M.-C., see S. Tseng Hou, X., GL(m, 2) Acting on R(r,m)/R(r - 1,m) Hu, G., see C. Lin Huang, R., Muir's identity - - A supersymmetric approach Hungerbiihler, N., see L. Halbeisen Hurlbert, G. and G. Isaak, Equivalence class universal cycles for permutations Hurtado, F. and M. Noy, Ears of triangulations and Catalan numbers (Note) Imrich, W., see C.P. Bonnington Imrich, W. and J. Zerovnik, On the weak reconstruction of Cartesian-product graphs Isaak, G., see G. Hurlbert Ivi6, A., see I. Gutman
150 (1996) 427-429 143 (1995)
87- 97
148 (1996)
85-105
146 148 149 141 146 147
(1995) (1996) (1996) (1995) (1995) (1995)
149
(1996) 123-129
149
(1996) 319-324
145 (1995)
109-121 205-216 99-122 291-297 123-131 139-150
61- 72
150 (1996) 167-178 149 (1996) 123-129 150 (1996) 131-142
Jacobson, M.S., see R.J. Faudree Jacobson, M.S., see R.J. Faudree Jacobson, M.S. and J. Lehel, Irregular embeddings of hypergraphs with fixed chromatic number Jacobson, M.S. and J. Lehel, Irregular embeddings of multigraphs with fixed chromatic number (Note) JendroT, S. and M. Tkfi~, The irregularity strength of tKp (Note) JendroT, S. and M. Tk/td and Z. Tuza, The irregularity strength and cost of the union of cliques Jepsen, C.H., Dissections into 1:2 rectangles Jin, G., Triangle-free four-chromatic graphs Joseph, A., The isomorphism problem for Cayley digraphs on groups of prime-squared order Jungnickel, D., see K.T. Arasu Jungreis, D.S., see D. Dunham
141 (1995) 109-122 150 (1996) 103-113
141 (1995) 173-183 147 (1995) 1- 17 143 (1995) 1- 30
Katchalski, M., W. McCuaig and S. Seager, Ordered colourings
142 (1995) 141-154
145 (1995) 145-150 145
(1995) 295-299
145 (1995) 301-305 150 (1996) 179-186 148 (1996) 107-117 145 (1995) 151-170
Master index of volumes 141 150
Kayathri, K., see S.A. Choudum Kennedy, G.T. and V. Pless, A coding theoretic approach to extending designs Kern, W., see P.L. Erd6s Khachatrian, L.H., see R. Ahlswede Khelladi, A., see S. Gravier Kierstead, H.A. and J. Qin, Coloring interval graphs with First-Fit Kierstead, H.A. and V. Rodl, Applications of hypergraph coloring to coloring graphs not inducing certain trees Klove, T., see W. Chen Klazar, M., Extremal functions for sequences Knill, E., A. Ehrenfeucht and D. Haussler, The size of k-pseudotrees K6rner, J., Intersection number and capacities of graphs Koh, K.M. and B.P. Tan, Kings in multipartite tournaments Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite graph Kojman, M., see M. Goldstern Kolossa, K., On the on-line chromatic number of the family of on-line 3-chromatic graphs Kolountzakis, M.N., An effective additive basis for the integers (Note) Koml6s, J. and W.O.J. Moser, Almost all trees have tribe number 2 or 3 (Note) Korzhik, V.P., A nonorientable triangular embedding of K , - K z , n=8(mod 12) Kotzig, A., see J. Abrham Kountanis, D., see B.P. Mull Kratsch, D., J. Lehel and H. Miiller, Toughness, hamiltonicity and split graphs Krivelevich, M., On a conjecture of Tuza about packing and covering of triangles (Note) Kubale, M. and K. Piwakowski, A linear time algorithm for edge coloring of binomial trees Kumar, P.V., see T. Helleseth Kwak, J.H., see S. Hong Labahn, R., Kernels of minimum size gossip schemes Lai, H.-J., see P.A. Catlin Lai, H.-J., Supereulerian graphs and excluded induced minors
13
141
(1995)
142 144 149 145
(1995) 155-168 (1995) 11- 22 (1996) 289 (1995) 273-277
144 (1995)
67- 73
47- 57
150 (1996) 187-193 148 (1996) 15- 35 150 (1996) 195-203 141 (1995) 185-194 142 (1995) 169-184 147 (1995) 171-183 149 (1996) 131-139 149 (1996) 69- 82 150 (1996) 205-230 145 (1995) 307-313 143
(1995) 281-285
141 (1995) 195-211 150 (1996) 3- 15 143 (1995) 209-220 150 (1996) 231-245 142 (1995) 281-286 150 (1996) 247-256 145 (1995) 133-143 148 (1996) 85-105 143 (1995) 141 (1995)
99-139 37- 46
146 (1995) 133-143
14
Master index of volumes 141 150
Lai, H.-J. and G. Weng, Strength and fractional arboricity of complementary graphs Lalonde, P., Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids Lauff, R., see M. Horfi~ik Laurent, M., Hilbert bases of cuts Lawrence, K.M., see R.A. Brualdi Lee, J., see S. Hong Lefmann, H., see A. Bialostocki Lehel, J., see D. Kratsch Lehel, J., see M.S. Jacobson Lehel, J., see M.S. Jacobson Lehel, J., see R.J. Faudree Lengyel, T., On some properties of the series ~k~=o k"x k and the Stirling numbers of the second kind Lepovi6, M., On strongly asymmetric graphs (Note) Lesniak, L.M., see R.J. Faudree Lesniak, L.M., see R.J. Faudree Li, H., see D. Barraez Li, H., Circumferences in 1-tough graphs Libkin, L. and V. Gurvich, Trees as semilattices (Note) Lin, Y.-C., see J.R. Griggs Lin, C., G. Hu and Z. Zhang, A six-color theorem for the edge-face coloring of plane graphs (Note) Lison~k, P., Local and global majorities revisited Liu, Y., see E. Song Liu, Y., see F.-M. Dong Liu, G., Orthogonal (9,f)-factorizations in graphs Liu, J. and C. Zhao, A new bound on the feedback vertex sets in cubic graphs Liu, J. and K. Williams, On bandwidth and edgesum for the composition of two graphs Liu, W.-P., I. Rival and N. Zaguia, Automorphisms, Isotone self-maps and cycle-free orders Loebl, M., see A.S. Fraenkel Lou, D. and Q. Zhu, The 2-extendability of strongly regular graphs Lu, X., A Hamiltonian game on K,,, Luczak, T., A. Rucifiski and J. Gruszka, On the evolution of a random tournament (Note) Ma, S.L., see K.T. Arasu
143
(1995)
141-151
145 146 150 147 148 150 150 145 145 150
(1995) (1995) (1996) (1995) (1996) (1996) (1996) (1995) (1995) (1996)
171-189 109-121 257-279 57 72 85-105 49- 60 231-245 145-150 295-299 103-113
150 145 150 141 146 146 145 143
(1996) (1995) (1996) (1995) (1995) (1995) (1995) (1995)
281-292 315 320 103-113 109-122 11- 18 145-151 321-327 47- 70
141 146 145 145 143
(1995) (1995) (1995) (1995) (1995)
291-297 153-158 343-346 95-103 153-158
148
(1996)
119-131
143
(1995)
159-166
144 141
(1995) 59- 66 (1995) 135-151
148 (1996) 133-140 142 (1995) 185-191 148
(1996) 311-316
147
(1995)
1
17
Master index of volumes 141-150
Madani, R.-M., Characterization of Laborde-Mulder graphs (extended odd graphs) Madej, T. and D.B. West, Interval number of special posers and random posers Mahjoub, A.R., see F. Barahona Maire, F., see J.-L. Fouquet Maranas, C.D., C.A. Floudas and P.M. Pardalos, New results in the packing of equal circles in a square (Note) Mati6-Keki6, S., D.M. Acketa and J.D. Zuni6, An exact construction of digital convex polygons with minimal diameter Maurin, F., On the existence of (v, 4, 3, I)-BHDs (Note) McCuaig, W., see M. Katchalski McDonnell, E., see G. Gordon McRae, A.A., see J. Dunbar Meerdink, T., see A. Bialostocki Melissen, J.B.M. and P.C. Schuur, Packing 16, 17 or 18 circles in an equilateral triangle (Note) Meshulam, R., see E. Boros Metsch, K., Quasi-residual designs, 1½-designs, and strongly regular multigraphs Miao, Y. and L. Zhu, Perfect Mendelsohn designs with block size six Michel, R., G. Taubenfeld and A. Berman, A connection between random variables and latin k-cubes (Note) Mih6k, P., On the minimal reducible bound for outerplanar and planar graphs (Note) Mikl6s, D. and A. Telcs, Fully extended self-avoiding polygons (Note) Mikl6s, D., Product of association schemes and Shannon capacity (Note) Milici, S., G. Quattrocchi and H. Shen, Embeddings of Simple Maximum Packings of triples with 2 Even Mitas, J., Interval orders based on arbitrary ordered sets Mitchem, J., see S.L. Hakimi Mizuno, H. and I. Sato, Characteristic polynomials of some graph coverings (Note) Mohanty, S.P., see B.S. Panda Mohar, B., N. Robertson and R.P. Vitray, Planar graphs on the projective plane Moon, J.W., see S. Tazawa Morillo, P., see C. Padr6
15
150
(1996) 293-301
144 (1995) 147 (1995) 146 (1995) 142
67- 74 19- 34 33- 44
(1995) 287-293
150 (1996) 303-313 145 (1995) 329-331 142 (1995) 141-154 147 (1995) 297-300 149 (1996) 311-312 150 (1996) 49- 60 145 150
(1995) 333-342 (1996) 407-409
143
(1995)
167-188
143
(1995)
189-207
146
(1995) 313-320
150
(1996) 431-435
150
(1996) 437-440
150
(1996) 441-447
145 144 149
(1995) 191-200 (1995) 75- 95 (1996) 93- 98
142 146
(1995) 295-298 (1995) 179-209
149 143 149
(1996) 141 157 (1995) 287-291 (1996) 189-204
16
Master index of volumes 141-150
Morris, C.A.N., see D.H. Griffel Moser, W.O.J., see J. Koml6s Miiller, H., On edge perfectness and classes of bipartite graphs Mfiller, H., see D. Kratsch Mull, B.P., D. Kountanis and R. Rashidi, Uniform strong 2-cell imbeddings of bridgeless graphs Mullin, R.C., see D.G. Hoffman Mykkeltveit, J., see E.R. Hauge Mynhardt, C.M., see E.J. Cockayne Naitoh, T., see K. Ando Nara, C., see S. Tazawa Nicolai, F., see H.-J. Bandelt Nomura, K., A remark on Mulder's conjecture about interval-regular graphs (Note) Noy, M., see F. Hurtado Nundelman, S.P., The modular n-queens problem in higher dimensions Odlyzko, A.M. and W.D. Smith, Nonabelian sets with distinct k-sums Oporowski, B., see G. Ding Ordaz, O., see D. Barraez Ota, K., Cycles through prescribed vertices with large degree sum Oubifia, L., see M. Gutierrez Owens, P.J., see J. Harant Owens, P.J., see J. Harant Oxley, J. and H. Wu, On matroid connectivity (Note) Padr6, C. and P. Morillo, Diameter vulnerability of iterated line digraphs Panda, B.S. and S.P. Mohanty, Intersection graphs of vertex disjoint paths in a tree Pardalos, P.M., see C.D. Maranas Penn, M., see F. Granot Petrovi6, V., Decomposition of some planar graphs into trees (Note) Piwakowski, K., see M. Kubale Pless, V., see G.T. Kennedy Plummer, M.D., Extending matchings in planar graphs V Polat, N., Stable graphs for a family of endomorphisms
145 143
(1995) 291-293 (1995) 281-285
149 (1996) 159-187 150 (1996) 231-245 143 (1995) 209-220 146 (1995) 97-108 148 (1996) 65- 83 141 (1995) 75- 84 148 143 145
(1996) 299-303 (1995) 287-291 (1995) 37- 60
147 149
(1995) 307-311 (1996) 319-324
146
(1995) 159-167
146 (1995) 169-177 149 (1996) 45- 58 146 (1995) 11- 18 145 (1995) 201-210 142 (1995) 77- 85 150 (1996) 143-153 147 (1995) 301-305 146 (1995) 321-324
149
(1996) 189-204
146 (1995) 179-209 142 (1995) 287-293 142 (1995) 65- 75 150 150 142 150 150
(1996) (1996) (1995) (1996) (1996)
449-451 247-256 155-168 315-324 325-335
Master index of volumes 141-150
Popescu, D.-R., Une m6thode d'6num6ration des cycles n6gatifs d'un graphe sign6 Porter, T.D., see C.A. Barefoot Pott, A., see K.T. Arasu Pr6a, P., Distance sequences in infinite regular tessellations Qin, J., see H.A. Kierstead Qing, X., Reversible (m, n, k, 21, 22)-abelian divisible difference sets with k - 21 non-square Quattrocchi, G., see S. Milici Quinn, J.J., Cycle packings in graphs and digraphs (Note) Quintas, L.V., see K.T. Balifiska Raczunas, M. and P. Chrz~stowski-Wachtel, A Diophantine problem of Frobenius in terms of the least common multiple Rashidi, R., see B.P. Mull Ratier, G., On the stable marriage polytope Rawlings, D., see J.-M. Fedou R6v6sz, G. and J. Szigeti, Eulerian trace identities (Note) Reid, T.J., see P. Erd6s Reid, K.B. and W. Gu, Plurality preference digraphs realized by trees - - I. Necessary and sufficient conditions Rhodes, S.J., see A.G. Chetwynd Rhodes, F., Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics Riskin, A., The genus 2 crossing number of K9 Rival, I., see W.-P. Liu R6dseth, O.J., Weighted multi-connected loop networks Robertson, N., see B. Mohar Rodier, F., Estimation asymptotique de la distance minimale du dual des codes BCH et polyn6mes de Dickson Rodl, V., see H.A. Kierstead Rogers, T.D., The graph of the square mapping on the prime fields (Note) Rucifiski, A., see T. Luczak Runge, B., Codes and Siegel modular forms Rusu, I., A new class of perfect Ho~ng graphs
(Communication) Sacl6, J.-F., Lower bounds for the size in four families of minimum broadcast graphs Sanyal, B.K., see M.K. Sen
17
150 (1996) 337-345 150 (1996) 31- 48 147 (1995) 1- 17 146 (1995) 211-233 144
(1995)
47- 57
142 (1995) 193-201 145 (1995) 191-200 149 (1996) 325-328 150 (1996) 17- 29
150 143 148 143 147 141
(1996) (1995) (1996) (1995) (1995) (1995)
147 141
(1995) 185-196 (1995) 47- 59
147 145 144 148 149
(1995) 197-209 (1995) 211-227 (1995) 59- 66 (1996) 161-173 (1996) 141-157
347-357 209-220 141-159 31- 45 313-319 285-290
149 (1996) 205-221 150 (1996) 187-193 148 148 148
(1996) 317-324 (1996) 311-316 (1996) 175-204
145
(1995) 279-285
150 147
(1996) 359-369 (1995) 235-245
18
Master index of volumes 141-150
142 147 141 149 150 147 145 142 149
(1995) (1995) (1995) (1996) (1996) (1995) (1995) (1995) (1996)
295-298 211-234 285-290 93- 98 123-130 73- 86 333-342 141-154 279-281
Sato, I., see H. Mizuno Savick), P., Bent functions and random boolean formulas Schelp, R., see P. Erd6s Schmeichel, E., see S.L. Hakimi Schneider, R., see A. Geroldinger Schultz, M., see G. Chartrand Schuur, P.C., see J.B.M. Melissen Seager, S., see M. Katchalski Selkow, S.M., see C.A. Christen Sen, M.K., B.K. Sanyal and D.B. West, Representing digraphs using intervals or circular arcs Serfati, M., Boolean differential equations Servatius, H., see B. Servatius Servatius, B. and H. Servatius, Self-dual graphs Sewell, E.C. and L.E. Trotter Jr, Stability critical graphs and ranks facets of the stable set polytope Shen, H., see S. Milici Shen, X., Generalized Latin squares II Shen, R. and F. Tian, Neighborhood unions and hamiltonicity of graphs Smith, W.D., see A.M. Odlyzko Smithline, L., Bandwidth of the complete k-ary tree Smyth, W.F., see N. Hartsfield Soifer, A., see I. Hoffman Song, E., W. Ye and Y. Liu, New lower bounds for Ramsey number R(p, q; 4) (Note) Sotfik, R., see M. Horfifik Sprugnoli, R., Riordan arrays and the Abel-Gould identity Stadler, P.F., Random walks and orthogonal functions associated with highly symmetric graphs Stahl, S., Bounds for the average genus of the vertexamalgamation of graphs Staton, W., see P. Erd6s Strahringer, S., Dimensionality of ordinal structures Su, X.-Y., On complete subgraphs of color-critical graphs Systo, M.M., The jump number problem on interval orders: A 3/2 approximation algorithm Sz~kely, L.A., see C.A. Barefoot Szigeti, J., see G. R6v6sz Szwarcfiter, J.L., On edge transitivity of directed graphs
144 (1995) 119-130 150 (1996) 31- 48 147 (1995) 313-319 141 (1995) 227-235
Tan, B.P., see K.M. Koh Tan, B.P., see K.M. Koh
149 147
147 (1995) 235-245 146 (1995) 235-246 149 (1996) 223-232 149 (1996) 223-232 147 (1995) 247-255 145 (1995) 191-200 143 (1995) 221-242 141 146 142 141 150
(1995) (1995) (1995) (1995) (1996)
213-225 169-177 203-212 163-171 427-429
145 (1995) 343-346 146 (1995) 109-121 142 (1995) 213-233 145
(1995) 229-237
142 141 144 143
(1995) 235-245 (1995) 285-290 (1995) 97-117 (1995) 243-249
(1996) 131-139 (1995) 171-183
Master index of volumes 141 150
Taubenfeld, G., see R. Michel Tazawa, S., C. Nara and J.W. Moon, The number of 4-cycles in triangle-free oriented graphs (Note) Telcs, A., see D. Mikl6s Terwilliger, P., see K. Ding Thuillier, H., see J.-L. Fouquet Tian, F., see R. Shen Tk/td, M., see J. Harant Tk~i6, M., see S. Jendroi" Tk/~d, M., see S. Jendrol" T6th, G., see M. B6na Tokunaga, S.-i., On a straight-line embedding problem of graphs Tomescu, I., On the number of irreducible coverings by edges of complete bipartite graphs (Note) Tonchev, V.D., The uniformly packed binary [27, 21,3] and [35, 29, 3] codes (Communication) Trenk, A.N., see K.P. Bogart Triesch, E., see M. Aigner Trotter Jr, L.E., see E.C. Sewell Trotter, W.T., see S. Felsner Tsay, Y.-J., see G.J. Chang Tseng, S. and M.-C. Horng, Partitions of a finite threecomplete poset Tucker, T.W., see J.L. Gross Tuza, Z., see M. Aigner Tuza, Z., see P. Erd6s Tuza, Z., see S. Jendrol" Tuzu, Zs., see C.A. Barefoot
19
146
(1995) 313-320
143 150 149 146 141 150 145 150 150
(1995) (1996) (1996) (1995) (1995) (1996) (1995) (1996) (1996)
150
(1996) 371-378
150
(1996) 453-456
149 145 144 147 144 148
(1996) 283-288 (1995) 347 (1995) 3- 10 (1995) 247-255 (1995) 23- 31 (1996) 9- 14
287-291 437-440 59- 68 33- 44 213-225 143-153 301-305 179-186 61- 67
148 (1996) 205-216 143 (1995) 71- 85 144 (1995) 3- 10 150 (1996) 89-101 150 (1996) 179-186 150 (1996) 31- 48
Ulatowski, W., Cycle interpolation properties of graphs
143
(1995) 251-257
van den Heuvel, J., see D. Bauer Veldman, H.J., see D. Bauer Vesztergombi, K., The two largest distances in finite planar sets Vitray, R.P., see B. Mohar Voigt, M., Choosability of planar graphs (Note) Voigt, M., A not 3-choosable planar graph without 3-cycles
141 141
(1995) (1995)
(Note) Walker, E., see M. Gehrke Walther, H., A nonhamiltonian five-regular multitriangular polyhedral graph
1- 10 1 10
150 (1996) 379-386 149 (1996) 141-157 150 (1996) 457-460 146
(1995) 325-328
148
(1996)
150
(1996) 387-392
49- 63
20
Master index of volumes 141-150
Walther, H., see J. Harant Wang, C., Boolean minors Wang, J., Long cycles in bipartite tournaments Wang, C.-D., A short proof of the existence of 2-sequencings in dihedral groups (Communication) Wang, W., On the colorings of outerplanar graphs Watkins, M.E., see C.P. Bonnington Weng, G., see H.-J. Lai Weng, J.F. and R.S. Booth, Steiner minimal trees on regular polygons with centre Wenzel, W., Pfaffian forms and A-matroids with coefficients West, D.B., see T. Madej West, D.B., see M.S. Chung West, D.B., see M.K. Sen West, J., Generating trees and the Catalan and Schrrder numbers Wetzel, J.E., Regular dissections of an infinite strip Whaley, T., see W.M. Dymfi~ek Whittle, G., Inequivalent representations of ternary matroids Wild, M., Base exchange properties of graphic matroids Willard, R., Essential arities of term operations in finite algebras Williams, K., see J. Liu Wirsching, G., On the combinatorial structure of 3N + 1 predecessor sets Witte, D., see D. Dunham Wo2niak, M., Packing three trees Wu, H., see J. Oxley Yan, L., A family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property (Note) Yang, K.-W., Matrix q-hypergeometric series Yang, S., The isomorphic factorization of complete tripartite graphs K(m, n,s) - - A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjecture Ye, W., see E. Song Yu, Q., see O. Chan Yuan, J., A local reductive elimination for the fill-in of graphs (Note) Zerovnik, J., see W. Imrich
150 (1996) 143-153 141 (1995) 237-258 148 (1996) 217-225 145 (1995) 287-289 147 (1995) 257-269 145 (1995) 61- 72 143 (1995) 141-151 141 148 144 150 147
(1995) 259-274 (1996) 227-252 (1995) 67- 74 (1996) 69- 79 (1995) 235-245
146 (1995) 247-262 146 (1995) 263-269 141 (1995) 95-107 149 (1996) 233-238 148 (1996) 253-264 149 (1996) 239-259 143 (1995) 159-166 148 143 150 146
(1996) 265-286 (1995) 1- 30 (1996) 393-402 (1995) 321-324
143 (1995) 293-297 146 (1995) 271-284
145 (1995) 239-257 145 (1995) 343-346 146 (1995) 19- 32 147 (1995) 321-327 150 (1996) 167-178
21
Master index of volumes 141-150
Zuni6, J.D., see S. Mati6-Keki6 Zaguia, N., see W.-P. Liu Zang, W., Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs Zemanian, A.H., Connectedness in transfinite graphs and the existence and uniqueness of node voltages Zha, X., On minimum-genus embeddings Zha, X., The closed 2-cell embeddings of 2-connected doubly toroidal graphs Zhang, Z., see C. Lin Zhang, Z., Parsons graphs of matrices on ~ep, (Note) Zhao, C., see J. Liu Zhou, H., see L. Haddad Zhou, H., On the ultimate normalized chromatic difference sequence of a graph Zhu, L., see Y. Miao Zhu, Q., see D. Lou Zhu, Q., The largest transversal numbers of uniform hypergraphs
150 (1996) 303-313 144 (1995) 59- 66 143
(1995) 259-268
142 (1995) 247-269 149 (1996) 261-278 145 141 148 148 146
(1995) 259-271 (1995) 291-297 (1996) 325-327 (1996) 119-131 (1995) 45- 58
148 143 148
(1996) 287-297 (1995) 189-207 (1996) 133-140
147
(1995) 271-282
(Note) Andreae, T. and C. Flotow, On covering all cliques of a chordal graph (Note) Arasu, K.T., D. Jungnickel, S.L. Ma and A. Pott, Relative difference sets with n = 2 Archdeacon, D., see J. Chen Archdeacon, D. and D.A. Grable, The genus of a random graph Baliflska, K.T. and L.V. Quintas, Degrees in a digraph whose nodes are graphs Bandelt, H.-J., A. Henkmann and F. Nicolai, Powers of distance-hereditary graphs Elsevier ScienceB.V.
150 (1996) 3 - 15 150 (1996) 303-313 149
(1996)
1-
9
149
(1996) 289
144
(1995)
3- 10
142
(1995)
1- 19
146 (1995) 145 (1995) 148 (1996) 145 (1995) 146 (1995)
1- 9 1- 9 1- 7 11- 35 1- 9
148
(1996) 299-303
150
(1996) 403-406
149
(1996) 291-297
149
(1996) 299-302
147 (1995) 149 (1996)
1- 17 19- 29
142
(1995)
21- 37
150
(1996)
17- 29
145
(1995)
37- 60
Master index of volumes 141-150
Bao, X., Two new symmetric inseparable double squares
(Note) Barahona, F. and A.R. Mahjoub, On two-connected subgraph polytopes Barefoot, C.A., L.H. Clark, R.C. Entringer, T.D. Porter, L.A. Sz6kely and Zs. Tuza, Cycle-saturated graphs of minimum size Barnes, F.W., Best packing of rods into boxes (Note) Barraez, D., E. Flandrin, H. Li and O. Ordaz, Dominating cycles in bipartite biclaw-free graphs Bauer, D., H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree Berman, A., see R. Michel Berrizbeitia, P. and R.E. Giudici, Counting pure k-cycles in sequences of Cayley graphs Bessenrodt, C., Generalisations of the Andrews-Olsson partition identity and applications Bialostocki, A., H. Lefmann and T. Meerdink, On the degree of regularity of some equations Billington, E.J., see P. Adams Blanchard, J.L., An extension theorem for Steiner systems B6na, M. and G. T6th, A Ramsey-type problem on rightangled triangles in space Bogart, K.P. and A.N. Trenk, Bipartite tolerance
(Corrioendum) Boisen, P., Polynomials and packings: a new proof of de Bruijn's theorem (Note) Bondy, J.A., A short proof of the Chen-Manalastas theorem
(Note) Bonnington, C.P., W. lmrich and M.E. Watkins, Separating double rays in locally finite planar graphs Booth, R.S., see J.F. Weng Boros, E. and R. Meshulam, On the number of flats spanned by a set of points in PG(d, q) (Note) Brandt, S. and E. Dobson, The Erd6s-S6s conjecture for graph of girth 5 (Note) Brass, P., On the Erd6s-diameter of sets (Note) Brewster, T.L., M.J. Dinneen and V. Faber, A computational attack on the conjectures of Graffiti: New counterexamples and proofs Brigham, R.C., see R.D. Dutton Broersma, H.J., see D. Bauer
141
(1995) 275-277
147
(1995)
150 142
(1996) 31- 48 (1995) 271-275
146
(1995)
141 146
(1995) 1- 10 (1995) 313-320
149
(1996)
11- 18
141
(1995)
11- 22
150 (1996) 149 (1996) 141 (1995)
49- 60 1- 9 23- 35
150
(1996)
61- 67
145
(1995) 347
146
(1995) 285-287
146
(1995) 289-292
145 141
(1995) 61- 72 (1995) 259-274
150
(1996) 407-409
19- 34
11- 18
150 (1996) 411-414 150 (1996) 415-419
147 (1995) 35- 55 147 (1995) 293-295 141 (1995) 1- 10
Master index of volumes 141-150 Brualdi, R.A. and Fonseca, A., On the quasi-transversals of a matroid (Note) Brualdi, R.A., J.S. Graves and K.M. Lawrence, Codes with a poser metric Bryant, D.E., see P. Adams Burris, A.C., The irregular coloring number of a tree (Note) Buze~eanu, $.N. and V. Domoco~, Polynomial identities from weighted lattice path counting (Note) Buze~eanu, $.N., see V. Domoco~ Catlin, P.A. and H.-J. Lai, Vertex arboricity and maximum degree Chan, O., C.C. Chen and Q. Yu, On 2-extendable abelian Cayley graphs Chan, W., An exchange property of matroid (Note) Chang, G.J. and Y.-J. Tsay, The partial gossiping problem Chapman, R.J., Shrinking integer lattices Chari, M.K., Matroid inequalities (Communication) Chartrand, G., H. Gavlas and M. Schultz, Convergent sequences of iterated H-line graphs Chen, C., Binding number and toughness for matching extension (Note) Chen, C.C., see O. Chan Chen, J., D. Archdeacon and J i . Gross, Maximum genus and connectivity Chen, W. and T. Klove, Lower bounds on multiple distinct sums sets Chetwynd, A.G. and S.J. Rhodes, Chessboard squares Chia, G.L., The chromaticity of wheels with a missing spoke II (Note) Chiang, N.-P. and H.-L. Fu, The achromatic indices of the regular complete multipartite graphs Choudum, S.A. and K. Kayathri, There are no edgechromatic 4-critical graphs of order 12 Chow, T.Y., On the Dinitz conjecture and related conjectures Christen, C.A., G. Coray and S.M. Selkow, A characterization of n-component graphs (Communication) Chrz~towski-Wachtel, P., see M. Raczunas Chung, M.S. and D.B. West, Large 2P3-free graphs with bounded degree Cimikowski, R. and D. Coppersmith, The sizes of maximal planar, outerplanar, and bipartite planar subgraphs (Note)
7
146 (1995) 293-297 147 (1995) 57- 72 149 (1996) 1- 9 141 (1995) 279-283 150 (1996) 421-425 147 (1995) 287-292
141
(1995)
146 146 148 142 147
(1995) 19- 32 (1995) 299-302 9- 14 (1996) (1995) 39- 48 (1995) 283-286
147 (1995)
37- 46
73- 86
146 (1995) 303-306 146 (1995) 19- 32 149
(1996)
19- 29
148 (1996) 141 (1995)
15- 35 47- 59
148 (1996) 305-310 141
(1995)
61- 66
141 (1995) 145 (1995)
67- 73 73- 82
149 (1996) 279-281 150 (1996) 347-357 150 (1996)
69- 79
149 (1996) 303-309
8
Master index of volumes 141-150
Clark, L.H., see C.A. Barefoot Cockayne, E.J. and C.M. Mynhardt, A characterisation of universal minimal total dominating functions in trees Coppersmith, D., see R. Cimikowski Coray, G., see C.A. Christen Csizmadia, G., Furthest neighbours in space Denley, T., The Ramsey numbers for disjoint unions of cycles Dias da Silva, J.A. and A. Fonseca, The r-depth ofa matroid Dilcher, K., Some q-series identities related to divisor functions Ding, G. and B. Oporowski, On tree-partitions of graphs Ding, K. and P. Terwilliger, On Garsia-Remmel problem of rook equivalence Dinneen, M.J., see T.L. Brewster Dobson, E., see S. Brandt Dobson, E., Isomorphism problem for Cayley graphs of Z~ Domoco~ V., see $.N. Buze!~eanu Domoco~, V. and $.N. Buze[eanu, The generating function of irreducible coverings by edges of complete k-partite graphs (Note) Dong, F.-M. and Y. Liu, On the chromatic uniqueness of the graph W(n, n - 2) + Kk Du, D.-Z., see B. Gao Du, B., The existence of orthogonal diagonal Latin squares with subsquares Dunbar, J., S. Hedetniemi, M.A. Henning and A.A. McRae, Minus domination in regular graphs (Note) Dunham, D., D.S. Jungreis and D. Witte, Infinite Hamiltonian paths in Cayley digraphs of hyperbolic symmetry groups Dutton, R.D. and R.C. Brigham, On the radius and diameter of the clique graph (Note) Dym/16ek, W.M. and T. Whaley, Generating strings for bipartite Steinhaus graphs Edelman, P.H., Lexicographically first reduced words Ehrenfeucht, A., see E. Knill Eke, B.G., Coprimes in blocks of successive integers (Note) Entringer, R.C., see C.A. Barefoot Erd5s, P., T. Gallai and Z. Tuza, Covering and independence in triangle structures
150 (1996) 141 149 149 150
31- 48
(1995) 75- 84 (1996) 303-309 (1996) 279-281 (1996) 81- 88
149 (1996) 141 (1995)
31- 44 85- 93
145 (1995) 149 (1996)
83- 93 45- 58
149 147 150 147 150
(1996) 59- 68 (1995) 35- 55 (1996) 411-414 (1995) 87- 94 (1996) 421-425
147
(1995) 287-292
145 (1995) 142 (1995)
95-103 49- 63
148 (1996)
37- 48
149 (1996) 311-312
143
(1995)
147
(1995) 293-295
141
(1995)
147 141 149 150
(1995) 95-106 (1995) 185-194 (1996) 313-317 (1996) 31- 48
150 (1996)
1- 30
95-107
89-101
Master index of volumes 141-150
9
Erd6s, P., R. Faudree, T.J. Reid, R. Schelp and W. Staton, Degree sequence and independence in K(4)-free graphs
(Note) Erdrs, P.L., U. Faigle and W. Kern, On the average rank of LYM-sets Evako, A.V., Topological properties of the intersection graph of covers of n-dimensional surfaces Faber, V., see T.L. Brewster Faigle, U., see P.L. Erdfs Fanning, J.D., A family of symmetric designs (Note) Faudree, R., see P. Erdrs Faudree, R.J., R.J. Gould, M.S. Jacobson and L.M. Lesniak, Degree conditions and cycle extendability Faudree, R.J., R.J. Gould, M.S. Jacobson, J. Lehel and L.M. Lesniak, Graph spectra Favaron, O., Least domination in a graph Fedou, J.-M. and D. Rawlings, Statistics on pairs of permutations Felsner, S. and W.T. Trotter, Colorings of diagrams of interval orders and a-sequences of sets Fiol, M.A., On congruence in Z" and the dimension of a multidimensional circulant Fishel, S., Nonnegativity results for generalized q-binomial coefficients Flandrin, E., see D. Barraez Flotow, C., see T. Andreae Floudas, C.A., see C.D. Maranas Fonseca, A., see R.A. Brualdi Fonseca, A., see J.A. Dias da Silva Fouquet, J.-L., V. Giakoumakis, F. Maire and H. Thuillier, On graphs without p5 and _p5 Fraenkel, A.S. and M. Loebl, Complexity of circuit intersection in graphs Fu, H.-L. see N.-P. Chiang Fujishige, S., see K. Ando Galeana-Shnchez, H., B1- and Bz-orientable graphs in kernel theory (Note) Gallai, T., see P. Erd6s Gao, B., D.-Z. Du and R.L. Graham, A tight lower bound for the Steiner ratio in Minkowski planes Gao, G.-G. and G. Hahn, Minimal graphs that fold onto K,
(Note)
141
(1995) 285-290
144 (1995)
11- 22
147
(1995) 107-120
147 144 146 141
(1995) 35- 55 (1995) 11- 22 (1995) 307-312 (1995) 285-290
141
(1995) 109-122
150 (1996) 103-113 150 (1996) 115-122 143
(1995)
31- 45
144 (1995)
23- 31
141
(1995) 123-134
147 146 149 142 146 141
(1995) (1995) (1996) (1995) (1995) (1995)
121-137 11- 18 299-302 287-293 293-297 85- 93
146 (1995)
33- 44
141 (1995) 135-151 141 (1995) 61- 66 148 (1996) 299-303 143 (1995) 269-274 150 (1996) 89-101 142 (1995)
49- 63
142 (1995) 277-280
10
Master index of volumes 141-150
Gavlas, H., see G. Chartrand Gehrke, M. and E. Walker, Iterating conditionals and symmetric Stone algebras Geroldinger, A. and R. Schneider, The cross number of finite abelian groups III Giakoumakis, V., see J.-L. Fouquet Goldstern, M., R. Grossberg and M. Kojman, Infinite homogeneous bipartite graphs with unequal sides Gordon, G. and E. McDonnell, Trees with the same degree sequence and path numbers (Note) Gould, R.J., see R.J. Faudree Gould, R.J., see R.J. Faudree Grable, D.A., see D. Archdeacon Graham, R.L., see B. Gao Granot, F. and M. Penn, On the integral 4-packing of T-cuts Graves, J.S., see R.A. Brualdi Gravier, S. and A. Khelladi, On the domination number of cross products of graphs (Communication) Griffel, D.H. and C.A.N. Morris, Complete latin squares of order 2k (Note) Griggs, J.R. and Y.-C. Lin, Planar graphs with few vertices of small degree Griggs, J.R., Matchings, cutsets, and chain partitions in graded posets Gross, J.L., see J. Chen Gross, J.L. and T.W. Tucker, Stratified graphs for imbedding systems Grossberg, R., see M. Goldstern Gruszka, J., see T. Luczak Gu, W., see K.B. Reid Giudici, R.E., see P. Berrizbeitia Gulliver, T.A., Two new optimal ternary two-weight codes and strongly regular graphs Gurich, V., see L. Libkin Gutierrez, M. and L. Oubifia, Minimum proper interval graphs Gutin, G., Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs Gutman, I. and A. Ivi6, On Matula numbers Haas, R., see M.O. Albertson Haddad, L. and H. Zhou, Star chromatic numbers of hypergraphs and partial Steiner triple systems
147
(1995)
73- 86
148
(1996)
49- 63
150 (1996) 123-130 146 (1995) 33- 44 149
(1996)
69- 82
147 141 150 142 142 142 147
(1995) 297-300 (1995) 109-122 (1996) 103-113 (1995) 21- 37 (1995) 49- 63 (1995) 65- 75 (1995) 57- 72
145
(1995) 273-277
145
(1995) 291-293
143
(1995)
47- 70
144 149
(1995) (1996)
33- 46 19- 29
143 (1995) 71- 85 149 (1996) 69- 82 148 (1996) 311-316 147 (1995) 185-196 149 (1996) 11- 18 149 145
(1996) 83- 92 (1995) 321-327
142
(1995)
141 150
(1995) 153-162 (1996) 131-142
148
(1996)
146
(1995)
77- 85
1-
7
45- 58
Master index of volumes 141-150
Hahn, G., see G.-G. Gao Hakimi, S.L., J. Mitchem and E. Schmeichel, Star arboricity of graphs Halbeisen, L. and N. Hungerbiihler, The general counterfeit coin problem Hamada, N. and T. Helleseth, A characterization of some {3v,+1, 3v,; k-l,q}-minihypers and some [ n , k , q k-1 - 3qU; q]-codes (k + 3, q + 5, 1 ~<# < k - 1) meeting the Griesmer bound Harant, J. and P.J. Owens, Non-hamiltonian ¼-tough maximal planar graphs (Note) Harant, J., P.J. Owens, M. Tkfid and H. Walther, 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one Hartsfield, N. and W.F. Smyth, A family of sparse graphs of large sum number Hartvigsen, D., Generalizing the all-pairs rain cut problem Hauge, E.R. and J. Mykkeltveit, On the classification of deBruijn sequences Hauge, E.R., On the cycles and adjacencies in the complementary circulating register Haukkanen, P., An abstract M6bius inversion formula with number-theoretic applications Haussler, D., see E. Knill Haviland, J., Independent domination in regular graphs (Note)
Haxell, P.E., Atoms of set systems with a fixed number of pairwise unions Heden, O., On Bruen chains Heden, O., Maximal partial spreads and the modular n-queen problem I1 Hedetniemi, S., see J. Dunbar Helleseth, T., see N. Hamada Helleseth, T. and P.V. Kumar, The weight hierarchy of the Kasami codes Henkmann, A., see H.-J. Bandelt Henning, M.A., see J. Dunbar Henning, M.A., Irredundance perfect graphs Ho/mg, C.T., Hamiltonian degree conditions for tough graphs Hobart, S., see D.G. Hoffman Hoffman, D.G., S. Hobart and R.C. Mullin, Near subgroups of groups
11
142 (1995) 277-280 149 (1996)
93- 98
147 (1995) 139-150
146 (1995) 147
59- 67
(1995) 301-305
150 (1996) 143-153 141 (1995) 163-171 147 (1995) 151-169 148 (1996)
65- 83
145 (1995) 105-132 142 (1995) 87- 96 141 (1995) 185-194 143
(1995) 275 280
150 (1996) 155-166 146 (1995) 69- 96 142 (1995) 97-106 149 (1996) 311-312 146 (1995) 59- 67 145 145 149 142
(1995) 133-143 (1995) 37- 60 (1996) 311-312 (1995) 107-120
142 (1995) 121-139 146 (1995) 97-108 146 (1995)
97-108
12
Master index of volumes 141-150
Hoffman, I. and A. Soifer, Another six-coloring of the plane (Note) Hofmeister, M., Graph covering projections arising from finite vector spaces over finite fields Hong, S., J.H. Kwak and J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extension property Hor~tk, M., R. Lauff and R. Sotfik, On existence of hypergraphs with prescribed edge degree profile Horng, M.-C., see S. Tseng Hou, X., GL(m, 2) Acting on R(r,m)/R(r - 1,m) Hu, G., see C. Lin Huang, R., Muir's identity - - A supersymmetric approach Hungerbiihler, N., see L. Halbeisen Hurlbert, G. and G. Isaak, Equivalence class universal cycles for permutations Hurtado, F. and M. Noy, Ears of triangulations and Catalan numbers (Note) Imrich, W., see C.P. Bonnington Imrich, W. and J. Zerovnik, On the weak reconstruction of Cartesian-product graphs Isaak, G., see G. Hurlbert Ivi6, A., see I. Gutman
150 (1996) 427-429 143 (1995)
87- 97
148 (1996)
85-105
146 148 149 141 146 147
(1995) (1996) (1996) (1995) (1995) (1995)
149
(1996) 123-129
149
(1996) 319-324
145 (1995)
109-121 205-216 99-122 291-297 123-131 139-150
61- 72
150 (1996) 167-178 149 (1996) 123-129 150 (1996) 131-142
Jacobson, M.S., see R.J. Faudree Jacobson, M.S., see R.J. Faudree Jacobson, M.S. and J. Lehel, Irregular embeddings of hypergraphs with fixed chromatic number Jacobson, M.S. and J. Lehel, Irregular embeddings of multigraphs with fixed chromatic number (Note) JendroT, S. and M. Tkfi~, The irregularity strength of tKp (Note) JendroT, S. and M. Tk/td and Z. Tuza, The irregularity strength and cost of the union of cliques Jepsen, C.H., Dissections into 1:2 rectangles Jin, G., Triangle-free four-chromatic graphs Joseph, A., The isomorphism problem for Cayley digraphs on groups of prime-squared order Jungnickel, D., see K.T. Arasu Jungreis, D.S., see D. Dunham
141 (1995) 109-122 150 (1996) 103-113
141 (1995) 173-183 147 (1995) 1- 17 143 (1995) 1- 30
Katchalski, M., W. McCuaig and S. Seager, Ordered colourings
142 (1995) 141-154
145 (1995) 145-150 145
(1995) 295-299
145 (1995) 301-305 150 (1996) 179-186 148 (1996) 107-117 145 (1995) 151-170
Master index of volumes 141 150
Kayathri, K., see S.A. Choudum Kennedy, G.T. and V. Pless, A coding theoretic approach to extending designs Kern, W., see P.L. Erd6s Khachatrian, L.H., see R. Ahlswede Khelladi, A., see S. Gravier Kierstead, H.A. and J. Qin, Coloring interval graphs with First-Fit Kierstead, H.A. and V. Rodl, Applications of hypergraph coloring to coloring graphs not inducing certain trees Klove, T., see W. Chen Klazar, M., Extremal functions for sequences Knill, E., A. Ehrenfeucht and D. Haussler, The size of k-pseudotrees K6rner, J., Intersection number and capacities of graphs Koh, K.M. and B.P. Tan, Kings in multipartite tournaments Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite graph Kojman, M., see M. Goldstern Kolossa, K., On the on-line chromatic number of the family of on-line 3-chromatic graphs Kolountzakis, M.N., An effective additive basis for the integers (Note) Koml6s, J. and W.O.J. Moser, Almost all trees have tribe number 2 or 3 (Note) Korzhik, V.P., A nonorientable triangular embedding of K , - K z , n=8(mod 12) Kotzig, A., see J. Abrham Kountanis, D., see B.P. Mull Kratsch, D., J. Lehel and H. Miiller, Toughness, hamiltonicity and split graphs Krivelevich, M., On a conjecture of Tuza about packing and covering of triangles (Note) Kubale, M. and K. Piwakowski, A linear time algorithm for edge coloring of binomial trees Kumar, P.V., see T. Helleseth Kwak, J.H., see S. Hong Labahn, R., Kernels of minimum size gossip schemes Lai, H.-J., see P.A. Catlin Lai, H.-J., Supereulerian graphs and excluded induced minors
13
141
(1995)
142 144 149 145
(1995) 155-168 (1995) 11- 22 (1996) 289 (1995) 273-277
144 (1995)
67- 73
47- 57
150 (1996) 187-193 148 (1996) 15- 35 150 (1996) 195-203 141 (1995) 185-194 142 (1995) 169-184 147 (1995) 171-183 149 (1996) 131-139 149 (1996) 69- 82 150 (1996) 205-230 145 (1995) 307-313 143
(1995) 281-285
141 (1995) 195-211 150 (1996) 3- 15 143 (1995) 209-220 150 (1996) 231-245 142 (1995) 281-286 150 (1996) 247-256 145 (1995) 133-143 148 (1996) 85-105 143 (1995) 141 (1995)
99-139 37- 46
146 (1995) 133-143
14
Master index of volumes 141 150
Lai, H.-J. and G. Weng, Strength and fractional arboricity of complementary graphs Lalonde, P., Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids Lauff, R., see M. Horfi~ik Laurent, M., Hilbert bases of cuts Lawrence, K.M., see R.A. Brualdi Lee, J., see S. Hong Lefmann, H., see A. Bialostocki Lehel, J., see D. Kratsch Lehel, J., see M.S. Jacobson Lehel, J., see M.S. Jacobson Lehel, J., see R.J. Faudree Lengyel, T., On some properties of the series ~k~=o k"x k and the Stirling numbers of the second kind Lepovi6, M., On strongly asymmetric graphs (Note) Lesniak, L.M., see R.J. Faudree Lesniak, L.M., see R.J. Faudree Li, H., see D. Barraez Li, H., Circumferences in 1-tough graphs Libkin, L. and V. Gurvich, Trees as semilattices (Note) Lin, Y.-C., see J.R. Griggs Lin, C., G. Hu and Z. Zhang, A six-color theorem for the edge-face coloring of plane graphs (Note) Lison~k, P., Local and global majorities revisited Liu, Y., see E. Song Liu, Y., see F.-M. Dong Liu, G., Orthogonal (9,f)-factorizations in graphs Liu, J. and C. Zhao, A new bound on the feedback vertex sets in cubic graphs Liu, J. and K. Williams, On bandwidth and edgesum for the composition of two graphs Liu, W.-P., I. Rival and N. Zaguia, Automorphisms, Isotone self-maps and cycle-free orders Loebl, M., see A.S. Fraenkel Lou, D. and Q. Zhu, The 2-extendability of strongly regular graphs Lu, X., A Hamiltonian game on K,,, Luczak, T., A. Rucifiski and J. Gruszka, On the evolution of a random tournament (Note) Ma, S.L., see K.T. Arasu
143
(1995)
141-151
145 146 150 147 148 150 150 145 145 150
(1995) (1995) (1996) (1995) (1996) (1996) (1996) (1995) (1995) (1996)
171-189 109-121 257-279 57 72 85-105 49- 60 231-245 145-150 295-299 103-113
150 145 150 141 146 146 145 143
(1996) (1995) (1996) (1995) (1995) (1995) (1995) (1995)
281-292 315 320 103-113 109-122 11- 18 145-151 321-327 47- 70
141 146 145 145 143
(1995) (1995) (1995) (1995) (1995)
291-297 153-158 343-346 95-103 153-158
148
(1996)
119-131
143
(1995)
159-166
144 141
(1995) 59- 66 (1995) 135-151
148 (1996) 133-140 142 (1995) 185-191 148
(1996) 311-316
147
(1995)
1
17
Master index of volumes 141-150
Madani, R.-M., Characterization of Laborde-Mulder graphs (extended odd graphs) Madej, T. and D.B. West, Interval number of special posers and random posers Mahjoub, A.R., see F. Barahona Maire, F., see J.-L. Fouquet Maranas, C.D., C.A. Floudas and P.M. Pardalos, New results in the packing of equal circles in a square (Note) Mati6-Keki6, S., D.M. Acketa and J.D. Zuni6, An exact construction of digital convex polygons with minimal diameter Maurin, F., On the existence of (v, 4, 3, I)-BHDs (Note) McCuaig, W., see M. Katchalski McDonnell, E., see G. Gordon McRae, A.A., see J. Dunbar Meerdink, T., see A. Bialostocki Melissen, J.B.M. and P.C. Schuur, Packing 16, 17 or 18 circles in an equilateral triangle (Note) Meshulam, R., see E. Boros Metsch, K., Quasi-residual designs, 1½-designs, and strongly regular multigraphs Miao, Y. and L. Zhu, Perfect Mendelsohn designs with block size six Michel, R., G. Taubenfeld and A. Berman, A connection between random variables and latin k-cubes (Note) Mih6k, P., On the minimal reducible bound for outerplanar and planar graphs (Note) Mikl6s, D. and A. Telcs, Fully extended self-avoiding polygons (Note) Mikl6s, D., Product of association schemes and Shannon capacity (Note) Milici, S., G. Quattrocchi and H. Shen, Embeddings of Simple Maximum Packings of triples with 2 Even Mitas, J., Interval orders based on arbitrary ordered sets Mitchem, J., see S.L. Hakimi Mizuno, H. and I. Sato, Characteristic polynomials of some graph coverings (Note) Mohanty, S.P., see B.S. Panda Mohar, B., N. Robertson and R.P. Vitray, Planar graphs on the projective plane Moon, J.W., see S. Tazawa Morillo, P., see C. Padr6
15
150
(1996) 293-301
144 (1995) 147 (1995) 146 (1995) 142
67- 74 19- 34 33- 44
(1995) 287-293
150 (1996) 303-313 145 (1995) 329-331 142 (1995) 141-154 147 (1995) 297-300 149 (1996) 311-312 150 (1996) 49- 60 145 150
(1995) 333-342 (1996) 407-409
143
(1995)
167-188
143
(1995)
189-207
146
(1995) 313-320
150
(1996) 431-435
150
(1996) 437-440
150
(1996) 441-447
145 144 149
(1995) 191-200 (1995) 75- 95 (1996) 93- 98
142 146
(1995) 295-298 (1995) 179-209
149 143 149
(1996) 141 157 (1995) 287-291 (1996) 189-204
16
Master index of volumes 141-150
Morris, C.A.N., see D.H. Griffel Moser, W.O.J., see J. Koml6s Miiller, H., On edge perfectness and classes of bipartite graphs Mfiller, H., see D. Kratsch Mull, B.P., D. Kountanis and R. Rashidi, Uniform strong 2-cell imbeddings of bridgeless graphs Mullin, R.C., see D.G. Hoffman Mykkeltveit, J., see E.R. Hauge Mynhardt, C.M., see E.J. Cockayne Naitoh, T., see K. Ando Nara, C., see S. Tazawa Nicolai, F., see H.-J. Bandelt Nomura, K., A remark on Mulder's conjecture about interval-regular graphs (Note) Noy, M., see F. Hurtado Nundelman, S.P., The modular n-queens problem in higher dimensions Odlyzko, A.M. and W.D. Smith, Nonabelian sets with distinct k-sums Oporowski, B., see G. Ding Ordaz, O., see D. Barraez Ota, K., Cycles through prescribed vertices with large degree sum Oubifia, L., see M. Gutierrez Owens, P.J., see J. Harant Owens, P.J., see J. Harant Oxley, J. and H. Wu, On matroid connectivity (Note) Padr6, C. and P. Morillo, Diameter vulnerability of iterated line digraphs Panda, B.S. and S.P. Mohanty, Intersection graphs of vertex disjoint paths in a tree Pardalos, P.M., see C.D. Maranas Penn, M., see F. Granot Petrovi6, V., Decomposition of some planar graphs into trees (Note) Piwakowski, K., see M. Kubale Pless, V., see G.T. Kennedy Plummer, M.D., Extending matchings in planar graphs V Polat, N., Stable graphs for a family of endomorphisms
145 143
(1995) 291-293 (1995) 281-285
149 (1996) 159-187 150 (1996) 231-245 143 (1995) 209-220 146 (1995) 97-108 148 (1996) 65- 83 141 (1995) 75- 84 148 143 145
(1996) 299-303 (1995) 287-291 (1995) 37- 60
147 149
(1995) 307-311 (1996) 319-324
146
(1995) 159-167
146 (1995) 169-177 149 (1996) 45- 58 146 (1995) 11- 18 145 (1995) 201-210 142 (1995) 77- 85 150 (1996) 143-153 147 (1995) 301-305 146 (1995) 321-324
149
(1996) 189-204
146 (1995) 179-209 142 (1995) 287-293 142 (1995) 65- 75 150 150 142 150 150
(1996) (1996) (1995) (1996) (1996)
449-451 247-256 155-168 315-324 325-335
Master index of volumes 141-150
Popescu, D.-R., Une m6thode d'6num6ration des cycles n6gatifs d'un graphe sign6 Porter, T.D., see C.A. Barefoot Pott, A., see K.T. Arasu Pr6a, P., Distance sequences in infinite regular tessellations Qin, J., see H.A. Kierstead Qing, X., Reversible (m, n, k, 21, 22)-abelian divisible difference sets with k - 21 non-square Quattrocchi, G., see S. Milici Quinn, J.J., Cycle packings in graphs and digraphs (Note) Quintas, L.V., see K.T. Balifiska Raczunas, M. and P. Chrz~stowski-Wachtel, A Diophantine problem of Frobenius in terms of the least common multiple Rashidi, R., see B.P. Mull Ratier, G., On the stable marriage polytope Rawlings, D., see J.-M. Fedou R6v6sz, G. and J. Szigeti, Eulerian trace identities (Note) Reid, T.J., see P. Erd6s Reid, K.B. and W. Gu, Plurality preference digraphs realized by trees - - I. Necessary and sufficient conditions Rhodes, S.J., see A.G. Chetwynd Rhodes, F., Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics Riskin, A., The genus 2 crossing number of K9 Rival, I., see W.-P. Liu R6dseth, O.J., Weighted multi-connected loop networks Robertson, N., see B. Mohar Rodier, F., Estimation asymptotique de la distance minimale du dual des codes BCH et polyn6mes de Dickson Rodl, V., see H.A. Kierstead Rogers, T.D., The graph of the square mapping on the prime fields (Note) Rucifiski, A., see T. Luczak Runge, B., Codes and Siegel modular forms Rusu, I., A new class of perfect Ho~ng graphs
(Communication) Sacl6, J.-F., Lower bounds for the size in four families of minimum broadcast graphs Sanyal, B.K., see M.K. Sen
17
150 (1996) 337-345 150 (1996) 31- 48 147 (1995) 1- 17 146 (1995) 211-233 144
(1995)
47- 57
142 (1995) 193-201 145 (1995) 191-200 149 (1996) 325-328 150 (1996) 17- 29
150 143 148 143 147 141
(1996) (1995) (1996) (1995) (1995) (1995)
147 141
(1995) 185-196 (1995) 47- 59
147 145 144 148 149
(1995) 197-209 (1995) 211-227 (1995) 59- 66 (1996) 161-173 (1996) 141-157
347-357 209-220 141-159 31- 45 313-319 285-290
149 (1996) 205-221 150 (1996) 187-193 148 148 148
(1996) 317-324 (1996) 311-316 (1996) 175-204
145
(1995) 279-285
150 147
(1996) 359-369 (1995) 235-245
18
Master index of volumes 141-150
142 147 141 149 150 147 145 142 149
(1995) (1995) (1995) (1996) (1996) (1995) (1995) (1995) (1996)
295-298 211-234 285-290 93- 98 123-130 73- 86 333-342 141-154 279-281
Sato, I., see H. Mizuno Savick), P., Bent functions and random boolean formulas Schelp, R., see P. Erd6s Schmeichel, E., see S.L. Hakimi Schneider, R., see A. Geroldinger Schultz, M., see G. Chartrand Schuur, P.C., see J.B.M. Melissen Seager, S., see M. Katchalski Selkow, S.M., see C.A. Christen Sen, M.K., B.K. Sanyal and D.B. West, Representing digraphs using intervals or circular arcs Serfati, M., Boolean differential equations Servatius, H., see B. Servatius Servatius, B. and H. Servatius, Self-dual graphs Sewell, E.C. and L.E. Trotter Jr, Stability critical graphs and ranks facets of the stable set polytope Shen, H., see S. Milici Shen, X., Generalized Latin squares II Shen, R. and F. Tian, Neighborhood unions and hamiltonicity of graphs Smith, W.D., see A.M. Odlyzko Smithline, L., Bandwidth of the complete k-ary tree Smyth, W.F., see N. Hartsfield Soifer, A., see I. Hoffman Song, E., W. Ye and Y. Liu, New lower bounds for Ramsey number R(p, q; 4) (Note) Sotfik, R., see M. Horfifik Sprugnoli, R., Riordan arrays and the Abel-Gould identity Stadler, P.F., Random walks and orthogonal functions associated with highly symmetric graphs Stahl, S., Bounds for the average genus of the vertexamalgamation of graphs Staton, W., see P. Erd6s Strahringer, S., Dimensionality of ordinal structures Su, X.-Y., On complete subgraphs of color-critical graphs Systo, M.M., The jump number problem on interval orders: A 3/2 approximation algorithm Sz~kely, L.A., see C.A. Barefoot Szigeti, J., see G. R6v6sz Szwarcfiter, J.L., On edge transitivity of directed graphs
144 (1995) 119-130 150 (1996) 31- 48 147 (1995) 313-319 141 (1995) 227-235
Tan, B.P., see K.M. Koh Tan, B.P., see K.M. Koh
149 147
147 (1995) 235-245 146 (1995) 235-246 149 (1996) 223-232 149 (1996) 223-232 147 (1995) 247-255 145 (1995) 191-200 143 (1995) 221-242 141 146 142 141 150
(1995) (1995) (1995) (1995) (1996)
213-225 169-177 203-212 163-171 427-429
145 (1995) 343-346 146 (1995) 109-121 142 (1995) 213-233 145
(1995) 229-237
142 141 144 143
(1995) 235-245 (1995) 285-290 (1995) 97-117 (1995) 243-249
(1996) 131-139 (1995) 171-183
Master index of volumes 141 150
Taubenfeld, G., see R. Michel Tazawa, S., C. Nara and J.W. Moon, The number of 4-cycles in triangle-free oriented graphs (Note) Telcs, A., see D. Mikl6s Terwilliger, P., see K. Ding Thuillier, H., see J.-L. Fouquet Tian, F., see R. Shen Tk/td, M., see J. Harant Tk~i6, M., see S. Jendroi" Tk/~d, M., see S. Jendrol" T6th, G., see M. B6na Tokunaga, S.-i., On a straight-line embedding problem of graphs Tomescu, I., On the number of irreducible coverings by edges of complete bipartite graphs (Note) Tonchev, V.D., The uniformly packed binary [27, 21,3] and [35, 29, 3] codes (Communication) Trenk, A.N., see K.P. Bogart Triesch, E., see M. Aigner Trotter Jr, L.E., see E.C. Sewell Trotter, W.T., see S. Felsner Tsay, Y.-J., see G.J. Chang Tseng, S. and M.-C. Horng, Partitions of a finite threecomplete poset Tucker, T.W., see J.L. Gross Tuza, Z., see M. Aigner Tuza, Z., see P. Erd6s Tuza, Z., see S. Jendrol" Tuzu, Zs., see C.A. Barefoot
19
146
(1995) 313-320
143 150 149 146 141 150 145 150 150
(1995) (1996) (1996) (1995) (1995) (1996) (1995) (1996) (1996)
150
(1996) 371-378
150
(1996) 453-456
149 145 144 147 144 148
(1996) 283-288 (1995) 347 (1995) 3- 10 (1995) 247-255 (1995) 23- 31 (1996) 9- 14
287-291 437-440 59- 68 33- 44 213-225 143-153 301-305 179-186 61- 67
148 (1996) 205-216 143 (1995) 71- 85 144 (1995) 3- 10 150 (1996) 89-101 150 (1996) 179-186 150 (1996) 31- 48
Ulatowski, W., Cycle interpolation properties of graphs
143
(1995) 251-257
van den Heuvel, J., see D. Bauer Veldman, H.J., see D. Bauer Vesztergombi, K., The two largest distances in finite planar sets Vitray, R.P., see B. Mohar Voigt, M., Choosability of planar graphs (Note) Voigt, M., A not 3-choosable planar graph without 3-cycles
141 141
(1995) (1995)
(Note) Walker, E., see M. Gehrke Walther, H., A nonhamiltonian five-regular multitriangular polyhedral graph
1- 10 1 10
150 (1996) 379-386 149 (1996) 141-157 150 (1996) 457-460 146
(1995) 325-328
148
(1996)
150
(1996) 387-392
49- 63
20
Master index of volumes 141-150
Walther, H., see J. Harant Wang, C., Boolean minors Wang, J., Long cycles in bipartite tournaments Wang, C.-D., A short proof of the existence of 2-sequencings in dihedral groups (Communication) Wang, W., On the colorings of outerplanar graphs Watkins, M.E., see C.P. Bonnington Weng, G., see H.-J. Lai Weng, J.F. and R.S. Booth, Steiner minimal trees on regular polygons with centre Wenzel, W., Pfaffian forms and A-matroids with coefficients West, D.B., see T. Madej West, D.B., see M.S. Chung West, D.B., see M.K. Sen West, J., Generating trees and the Catalan and Schrrder numbers Wetzel, J.E., Regular dissections of an infinite strip Whaley, T., see W.M. Dymfi~ek Whittle, G., Inequivalent representations of ternary matroids Wild, M., Base exchange properties of graphic matroids Willard, R., Essential arities of term operations in finite algebras Williams, K., see J. Liu Wirsching, G., On the combinatorial structure of 3N + 1 predecessor sets Witte, D., see D. Dunham Wo2niak, M., Packing three trees Wu, H., see J. Oxley Yan, L., A family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property (Note) Yang, K.-W., Matrix q-hypergeometric series Yang, S., The isomorphic factorization of complete tripartite graphs K(m, n,s) - - A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjecture Ye, W., see E. Song Yu, Q., see O. Chan Yuan, J., A local reductive elimination for the fill-in of graphs (Note) Zerovnik, J., see W. Imrich
150 (1996) 143-153 141 (1995) 237-258 148 (1996) 217-225 145 (1995) 287-289 147 (1995) 257-269 145 (1995) 61- 72 143 (1995) 141-151 141 148 144 150 147
(1995) 259-274 (1996) 227-252 (1995) 67- 74 (1996) 69- 79 (1995) 235-245
146 (1995) 247-262 146 (1995) 263-269 141 (1995) 95-107 149 (1996) 233-238 148 (1996) 253-264 149 (1996) 239-259 143 (1995) 159-166 148 143 150 146
(1996) 265-286 (1995) 1- 30 (1996) 393-402 (1995) 321-324
143 (1995) 293-297 146 (1995) 271-284
145 (1995) 239-257 145 (1995) 343-346 146 (1995) 19- 32 147 (1995) 321-327 150 (1996) 167-178
21
Master index of volumes 141-150
Zuni6, J.D., see S. Mati6-Keki6 Zaguia, N., see W.-P. Liu Zang, W., Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs Zemanian, A.H., Connectedness in transfinite graphs and the existence and uniqueness of node voltages Zha, X., On minimum-genus embeddings Zha, X., The closed 2-cell embeddings of 2-connected doubly toroidal graphs Zhang, Z., see C. Lin Zhang, Z., Parsons graphs of matrices on ~ep, (Note) Zhao, C., see J. Liu Zhou, H., see L. Haddad Zhou, H., On the ultimate normalized chromatic difference sequence of a graph Zhu, L., see Y. Miao Zhu, Q., see D. Lou Zhu, Q., The largest transversal numbers of uniform hypergraphs
150 (1996) 303-313 144 (1995) 59- 66 143
(1995) 259-268
142 (1995) 247-269 149 (1996) 261-278 145 141 148 148 146
(1995) 259-271 (1995) 291-297 (1996) 325-327 (1996) 119-131 (1995) 45- 58
148 143 148
(1996) 287-297 (1995) 189-207 (1996) 133-140
147
(1995) 271-282