Master index ofvolumes 161-170

Abderrezzak, M.E.K., E. Flandrin, A. Harkat-Benhamdine and H. Li, D;.-cyc1es in A-c1aw-freegraphs

Abrams, A., The kth upper chromatic number of theline (Note)

Acenjian, see X.-R. YongAchlioptas, D., The complexity of G-free colourabilityAcketa, D.M. and V. Mudrinski, Two 5-designs on 32

points (Note)Aguila, F., M.A. Fiol and C. Garcia, Triple loop

networks with small transmission delayAit Haddadene, H. and F. Maffray, Coloring perfect

degenerate graphs (Note)Alevras, D., Order preserving assignments without

contiguityAlon, N., Zs. Tuza and M. Voigt, Choosability and

fractional chromatic numbersAlthofer, I. and M. Lowe, Edge search in hypergraphs

(Note)Amar, D., see O. OrdazAnanchuen, N. and L. Caccetta, Matching extension

and minimum degreeAndersen, L.D. and AJ.W. Hilton, Triangulations of

3-way regular tripartite graphs of degree 4, withapplications to orthogonal latin squares

Ando, K. and Y. Egawa, The minimum number ofedges in a vertex diameter-2-critical graph

Arumugam, S. and K.A. Germina, On indexablegraphs (Note)

5

165/166 (1997) 11- 20

169 (1997) 157-162169 (1997) 293-298

165/166 (1997) 21- 30

163 (1997) 209-210

167/168 (1997) 3- 16

163 (1997) 211-215

163 (1997) 1- 11

165/166 (1997) 31- 38

162 (1996) 267-271161 (1996) 207-215

170 (1997) 1- 13

167/168 (1997) 17- 34

167/168 (1997) 35- 63

161 (1996) 285-289

Bailey, R.A. and P.E. Chigbu, Enumeration of semi-Latin squares

Bailey, R.A., A Howell design admitting AsBalbuena, C., A. Carmona, J. Fabrega and M.A. Fiol,

Extraconnectivity of graphs with large minimumdegree and girth

Elsevier Science B.Y.

167/168 (1997)167/168 (1997)

167/168 (1997)

73- 8465- 71

85-100

6 Master index of volumes 161-170

169 (1997) 163-168

162 (1996) 13- 22

170 (1997) 29- 39

163 (1997) 13- 45

1- 12

1- 11

169 (1997) 169-175

164 (1997) 21- 28

162 (1996) 23- 29

170 (1997) 15- 28

170 (1997) 211-217

161 (1996)

163 (1997) 217-223

162 (1996)

169 (1997) 145-152

164 (1997) 5- 19

165/166 (1997) 61- 70

167/168 (1997) 127-139169 (1997) 279-282

167/168 (1997) 115-126

167/168 (1997) 101-114

165/166 (1997) 39- 60

Banaszczyk, W., see S. Sevast'janovBang-Jensen, 1. and G. Gutin, Alternating cycles and

paths in edge-coloured multigraphs: A surveyBang-Jensen, 1. and G. Gutin, Paths and cycles in

extended and decomposable digraphsBang-Jensen, J. and G. Gutin, Vertex heaviest paths

and cycles in quasi-transitive digraphs (Note)Bang-Jensen, J., G. Gutin and A. Yeo, On k-strong

and k-cyclic digraphsBang-Jensen, 1., G. Gutin and 1. Huang, A sufficient

condition for a semicomplete multipartite digraphto be Hamiltonian

Bang-Jensen, J., Y. Guo, G. Gutin and L. Volkmann,A classification of locally semicomplete digraphs

Bankovic, D., General reproductive solutions ofPostian equations (Note)

Barcucci, E., A.D. Lungo, S. Fezzi and R. Pinzani,Nondecreasing Dyck paths and q-Fibonacci num-bers (Note)

Bauslaugh, B.L., Compactness and finite equivalenceof infinite digraphs

Beck, D.A., The combinatorics of symmetric func-tions and permutation enumeration of the hyper-octahedral group

Beineke, L.W. and M.A. Henning, Opinion functionson trees

Ben-Israel, A., see X. TangBenade, G., I. Broere, B. Jonck and M. Frick, Uni-

quely (m, k)t-colourable graphs and k-r-saturatedgraphs

Bennett, F.E. and 1. Yin, Packings and coverings ofthe complete directed multigraph with 3- and 4-circuits

Bennett, F.E. and R. Wei, The existence of Schroderdesigns with equal-sized holes

Berge, C. and 1.-L. Fouquet, On the optimal transver-sals of the odd cycles (Note)

Berge, c., Motivations and history of some of myconjectures

Bernstein, M., N.J.A. Sloane and P.E. Wright, Onsublattices of the hexagonal lattice

Bielak, H., Chromatic uniqueness in a family of 2-connected graphs

Master index of oolumes 161-170 7

Blokhuis, A. and A.E. Brouwer, Determination of thedistance-regular graphs without 3-claws (Note) 163 (1997) 225-227

Bohme, T., H,J. Broersma, F. Gobel, A.V. Kostochkaand M. Stiebitz, Spanning trees with pairwisenonadjacent endvertices (Note) 170 (1997) 219-222

Bollobas, B. and A.D. Scott , Independent sets andrepeated degrees 170 (1997) 41- 49

Bollobas, B. and L Leader, Sums in the grid 162 (1996) 31- 48Bondy, J.A., Counting subgraphs: A new approach to

the Caccetta-Haggkvist conjecture 165/166 (1997) 71- 80Bonisoli, A. and G. Korchmaros, Suzuki groups, one-

factorizations and Liineburg planes 161 (1996) 13- 24Borobia, A., Vertices of the generalized transitive

tournament polytope (Note) 163 (1997) 229-234Borodin, O.V., A new proof of Griinbaum's 3 color

theorem (Note) 169 (1997) 177-183Boros, E. and O. Cepek, On perfect 0, ± 1 matrices 165/166 (1997) 81-100Bouchakour, M. and A.R. Mahjoub, One-node cutsets

and the dominating set polytope 165/166 (1997) 101-123Bouchemakh, Land K. Engel, The order-interval hy-

pergraph of a finite poset and the Konig property 170 (1997) 51- 61Bouchet, A. and L. Ghier, Connectivity and p-invari-

ants of isotropic systems and 4-regular graphs 161 (1996) 25- 44Boukliev, I.G., New bounds for the minimum length of

quaternary linear codes of dimension five (Note) 169 (1997) 185-192Bowler, A., Orthomorphisms of dihedral groups 167/168 (1997) 141-144Boza, L.,A. Dianez and A. Marquez, The center of an

infinite graph 161 (1996) 45- 52Brandstadt, A., see F.F. Dragan 162 (1996) 93-108Brewster, R.C, P. Hell and G. MacGillivray, The

complexity of restricted graph homomorphisms 167/168 (1997) 145-154Brinkmann, G. and E. Steffen, 3- and 4-critical graphs

of small even order (Not e) 169 (1997) 193-197Broere, L, see G. Benade 162 (1996) 13- 22Broersma, H.J., A note on the minimum size of a

vertex pancyclic graph 164 (1997) 29- 32Broersma, H,J., Z. Ryjacek and L Schiermeyer, Dirac's

minimum degree condition restricted to claws 167/168 (1997) 155-166Broersma, H,J., see T. Bohme 170 (1997) 219-222Brouwer, A.E. and H.M. Mulder, The vertex con-

nectivity of a {O, 2}-graph equals its degree(Communication) 169 (1997) 153-155

Brouwer, A.E., see A. Blokhuis 163 (1997) 225-227

8 Master index a/volumes 161-170

161 (1996) 291-295

163 (1997) 47- 66

161 (1996) 53- 61167/168 (1997) 405-410

164 (1997) 33- 45

170 (1997) 1- 13169 (1997) 1- 16

169 (1997) 205-209167/168 (1997) 175-187

162 (1996) 49- 66167/168 (1997) 85-100

164 (1997) 47- 65

163 (1997) 235-241165/166 (1997) 81-100

167/168 (1997) 189-196170 (1997) 223-230170 (1997) 223-230169 (1997) 121-131163 (1997) 165-172163 (1997) 201-208

165/166 (1997) 139-153

170 (1997) 63- 79

Caccetta, L., see N. AnanchuenCai, M.-C., Connected [k, k + l]-factors of graphsCameron, K., Coloured matchings in bipartite graphs

(Note)Cameron, PJ., On the probability of connectednessCaragiu, M., On a class of finite upper half-planesCarmona, A., see C. BalbuenaCaro, Y., Y. Roditty and J. Schonheim, On colored

designs - ICaughman IV, J.S., Intersection numbers of bipartite

distance-regular graphs (Note)Cepek, 0., see E. BorosCerny, A., P. Horak and W.D. Wallis, Kirkman's

school projectsChang, Ci-C, see C. ChenChang, GJ., see C. ChenChang, GJ., see D. KuoChang, G.J., see Y.-J. TsayCharles, P., see J. StefanCharon, I., A. Guenoche, O. Hudry and F. Woirgard,

New results on the computation of median ordersChartrand, G., H. Hevia, E.B. Jarrett and M. Schultz,

Subgraph distances in graphs defined by edgetransfers

Brualdi, R.A. and J.A. Dias da Silva, A retract charac-terization of posets with the fixed-point property(Note) 169 (1997) 199-203

Brunat, J.M., M. Maureso and M. Mora, Characteriz-ation of c-circulant digraphs of degree two whichare circulant 165/166 (1997) 125-137

Bryant, D.E. and S. Oates-Williams, Strongly 2-per-feet cycle systems and their quasigroups 167/168 (1997) 167-174

Buratti, M., Edge-colourings characterizing a classof Cayley graphs and a new characterization ofhypercubes (Note)

Burger, A.P., EJ. Cockayne and C.M. Mynhardt,Domination and irredundance in the queens' graph

Burkard, R.E., T. Dudas and T. Maier, Cut and patchSteiner trees for ladders

Byard, K., see D. JenningsBylka, S. and J. Komar, Interesection properties of

line graphs

Master index of tolumes 16/-170

Chen, Y-g., On m-harmonic sequences (Note)Chen, B., Parametric Mobius inversion formulas

(Note)Chen, C., Ci-C. Chang and GJ. Chang, Proper inter-

val graphs and the guard problem (Note)Chen, G., A result on C4-star Ramsey numbers (Note)Chen, G., R.H. Schelp and W.E. Shreve, A special

k-coloring for a connected k-chromatic graph(Note)

Chen, Z., On polynomial functions fromZnl X Znz X ••. X Znr to Zm

Chen, Z.-H., The size of graphs with clique numberm and without nowhere-zero 4-flows (Note)

Chernoff, W.W., Interwoven polygonal framesChigbu, P.E., see R.A. BaileyChernyak, A.A. and Zh.A. Chernyak, r-Multihyper-

graphs with prescribededge degreesequences (Note)Chernyak, Zh.A., see A.A. ChernyakChew, K.H., The chromatic index of graphs of high

maximum degreeChia, G.L., On graphs uniquely colorable under the

action of their automorphism groups (Note)Chia, G.L., On the chromatic equivalence class of

a family of graphs (Note)Chvatal , V., In praise of Claude BergeClements, G.F., The cubical poset is additiveCockayne, EJ. and C.M. Mynhardt, Domination and

irredundance in cubic graphsCockayne, E.J., see A.P. BurgerCollins, K.L. and L.B. Krompart, The number of

Hamiltonian paths in a rectangular gridCordovil, R., Coloring matroidsCoulson, D., An 18-colouring of 3-space omitting

distance one (Note)Cowling, P., The total graph of a hypergraphCrippa, D. and K. Simon, q-distributions and Markov

processes

de Figueiredo, C.M.H., see H. Everettde Caen, D., A lower bound on the probability of

a union (Note)de Werra, D., Restricted coloring models for time-

tabling

9

162 (1996) 273-280

169 (1997) 211-215

170 (1997) 223-230163 (1997) 243-246

170 (1997) 231-236

162 (1996) 67- 76

163 (1997) 247-249167/168 (1997) 197-204167/168 (1997) 73- 84

170 (1997) 237-240170 (1997) 237-240

162 (1996) 77- 91

162 (1996) 281-284

162 (1996) 285-289165/166 (1997) 3- 9

169 (1997) 17- 28

167/168 (1997) 205-214163 (1997) 47- 66

169 (1997) 29- 38165/166 (1997) 155-160

170 (1997) 241-247167/168 (1997) 215-236

170 (1997) 81- 98

165/166 (1997) 233-252

169 (1997) 217-220

165/166 (1997) 161-170

10 Master index a/volumes 161-170

Dell'Olmo, P., M.G. Speranza and Zs. Tuza, Efficien-cy and effectiveness of normal schedules on threededicated processors

Delorme, C. and J.P. Tillich, Eigenvalues, eigenspacesand distances to subsets

Deogun, 1.S., D. Kratsch and G. Steiner, J-Toughcocomparability graphs are hamiltonian

Deuber, W.A. and X. Zhu, The chromatic numbers ofdistance graphs

Deza, M. and V. Grishukhin, The skeleton of the120-cell is not 5-gonal

Dianez, A., see L. BozaDias da Silva, J.A., see R.A. BrualdiDillencourt, M.B. and W.D . Smith, Graph-theoretical

conditions for inscribability and Delaunay realiza-bility

Ding, G. and P.L. Hammer, Matroids arisen frommatrogenic graphs

Ding, K., Rook placements and cellular decomposi-tion of partition varieties

Domke, G.S. and R.C. Laskar, The bondage and re-inforcement numbers of YI for some graphs

Domke, G.S., J.E. Dunbar and L.R. Markus, Gallai-type theorems and domination parameters

Dong, F.M. and K.M. Koh, On graphs in which anypair of colour classes but one induces a tree

Dorrough, D., Convergence of sequences of iteratedtriangular line graphs

Dragan, F.F. and A. Brandstadt, y-Dominatingcliques in graphs with hypertree structure

Du, D.-Z., see P.-J. WanDu, Q., Chromaticity of the complements of paths and

cyclesDudas, T., see R.E. BurkardDunbar, 1.E., 1.W. Grossman, 1.H. Hattingh, S.T.

Hedetniemi and A.A. McRae, On weakly connec-ted domination in graphs

Dunbar, 1.E., see G.S. Domke

Edmonds, J., M. Laurent and A. Schrijver, A minor-monotone graph parameter based on orientedmatroids

Egawa, Y., see K. Ando

164 (1997) 67- 79

165/166 (1997) 171-194

170 (1997) 99-106

165/166 (1997) 195-204

165/166 (1997) 205-210161 (1996) 45- 52169 (1997) 199-203

161 (1996) 63- 77

165/166 (1997) 211-217

170 (1997) 107-151

167/168 (1997) 249-259

167/168 (1997) 237-248

169 (1997) 39- 54

161 (1996) 79- 86

162 (1996) 93-108163 (1997) 173-200

162 (1996) 109-125161 (1996) 53- 61

167/168 (1997) 261-269167/168 (1997) 237-248

165/166 (1997) 219-226167/168 (1997) 35- 63

Master index a/volumes 161-170 11

Engel, K., see I. Bouchemakh 170 (1997) 51- 61Erdos, P. and L. Pyber, Covering a graph by complete

bipartite graphs (Note) 170 (1997) 249-252Erdos, P., Some recent problems and results in graph

theory 164 (1997) 81- 85

Erdos, P.L., Splitting property in infinite posets (Note) 163 (1997) 251-256Erdos, P., Some old and new problems in various

branches of combinatorics 165/166 (1997) 227-231

Etzion, T., Optimal constant weight codes over Z, andgeneralized designs 169 (1997) 55- 82

Everett, H., C.M.H. de Figueiredo, C. Linhares-Sales,

F. Maffray, O. Porto and B.A. Reed, Path parityand perfection 165/166 (1997) 233-252

Fabrega, J., see C. Balbuena 167/168 (1997) 85-100Farley, J.D., Perfect sequences of chain-complete

posets 167/168 (1997) 271-296Faudree, R., E. Flandrin and Z. Ryjacek, Claw-free

graphs - a survey 164 (1997) 87-147

Favaron, O. and Y. Redouane, Minimum independent

generalized t-degree and independence number in

Kl,r +l-free graphs 165/166 (1997) 253-261Fezzi , S., see E. Barcucci 170 (1997) 211-217Filipoiu, A. and G. Georgescu, On values in relatively

normal lattices 161 (1996) 87-100Fiol, M.A., E. Garriga, and J.L.A. Yebra, The alternat-

ing polynomials and their relation with the spectraand conditional diameters of graphs 167/168 (1997) 297-307

Fio1, M.A., see C. Ba1buena 167/168 (1997) 85-100Fio1, M.A., see F. Aguila 167/168 (1997) 3- 16F1andrin, E., see M.E.K. Abderrezzak 165/166 (1997) 11- 20Flandrin, E., see R. Faudree 164 (1997) 87-147Fleischner, H., A numbering of the vertices of special

networks 165/166 (1997) 263-276Fouche, W.L., Symmetry and the Ramsey degree of

posets 167/168 (1997) 309-315Fouquet, J.-L. , see C. Berge 169 (1997) 169-175Fouquet, J.-L. and V. Giakoumakis, On semi-Pz-

sparse graphs 165/166 (1997) 277-300Fouquet, J.-L., F. Maire, I. Rusu and H. Thuillier, On

transversals in minimal imperfect graphs 165/166 (1997) 301-312Fournier, J.c., Tiling pictures of the plane with

dominoes 165/166 (1997) 313-320

12 Master index of volumes 161-170

Frick, M., see G. BenadeFroncek, D., Almost self-complementary factors of

complete bipartite graphsFulmek, M. and C. Krattenthaler, A bijection be-

tween Proctor's and Sundaram's odd orthogonaltableaux

162 (1996) 13- 22

167/168 (1997) 317-327

161 (1996) 101-120

161 (1996) 121-132

169 (1997) 227-232

164 (1997) 149-153

169 (1997) 221-225

267-2733- 16

297-30787-100

285-28925- 44

277-300

(1997)(1997)(1997)(1996)(1996)(1996)(1997)

163 (1997) 257-265

170 (1997) 253-257

169 (1997) 233-243167/168 (1997) 341-352

165/166 (1997) 353-358

165/166 (1997) 343-351170 (1997) 219-222

167/168 (1997) 329-339

167/168 (1997) 341-352

165/166 (1997) 321-342

163167/168167/168

161161161

165/166

Galeana-Sanchez, H., A characterization of normalfraternally orientable perfect graphs (Note)

Gao, W., An addition theorem for finite cyclic groups(Note)

Gao, W., On the number of zero sum subsequences(Note)

Garcia, C, see F. AguilaGarriga, E., see M.A. FiolGeorgescu, G., see A. FilipoiuGermina, K.A., see S. ArumugamGhier, 1., see A. BouchetGiakoumakis, v., see J.-L. FouquetGiakoumakis, V., F. Roussel and H. Thuillier, Scatter-

ing number and modular decompositionGimbel, J., M. Maheo and C. Virlouvet, Double total

domination of graphsGobel, F., see T. BohmeGoddard, W. and H.C. Swart, Distances between

graphs under edge operationsGoddard, W., M.D. Plummer and H.C. Swart,

Maximum and minimum toughness of graphs ofsmall genus

Gorgol, I., On bounds for size Ramsey numbers ofa complete tripartite graph

Gourdon, X. and H. Prodinger, A generating functionapproach to random subgraphs of the n-cyc1e(Note)

Grannell, MJ., T.S. Griggs and J.P. Murphy, TwinSteiner triple systems

Gravier, S. and F. Maffray, Choice number of 3-colorable elementary graphs

Gravier, S., Hamiltonicity of the cross product of twoHamiltonian graphs (Note)

Griggs, J.R. and Y.-C. Lin, The maximum sum ofdegrees above a threshold in planar graphs (Note)

Griggs, T.S., see M.J. Grannell

Master index of volumes 161-/70 13

Grishukhin, V., see M. Deza 165/166 (1997) 205-210Gropp, H., Configurations and graphs - II 164 (1997) 155-163Gropp, H., Blocking set free configurations and their

relations to digraphs and hypergraphs 165/166 (1997) 359-370Grossman, J.W., Dominating sets whose closed stars

form spanning trees 169 (1997) 83- 94Grossman, J.W., see J.E. Dunbar 167/168 (1997) 261-269Grytczuk, J., Infinite self-similar words 161 (1996) 133-141Guenoche, A., see 1. Charon 165/166 (1997) 139-153Guiduli, B.,On incidence coloring and star arboricity

of graphs (Note) 163 (1997) 275-278Guo, Y, A. Pinkernell and L. Volkmann, On cycles

through a given vertex in multipartite tourna-ments 164 (1997) 165-170

Guo, Y., Path-connectivity in local tournaments 167/168 (1997) 353-372Guo, Y., see J. Bang-Jensen 167/168 (1997) 101-114Gurvich, V. and L. Khachiyan, On the frequency of

the most frequently occurring variable in dualmonotone DNFs (Note) 169 (1997) 245-248

Gutin, G., see J. Bang-Jensen 161 (1996) 1- 12Gutin, G., see J. Bang-Jensen 162 (1996) 1- 11Gutin, G., see J. Bang-Jensen 163 (1997) 217-223Gutin, G., see J. Bang-Jensen 164 (1997) 5- 19Gutin , G., see J. Bang-Jensen 165/166 (1997) 39- 60Gutin, G., see J. Bang-Jensen 167/168 (1997) 101-114Gyori, E., C6-free bipartite graphs and product repres-

entation of squares 165/166 (1997) 371-375Gyori, E., A.V. Kostochka and T. Luczak, Graphs

without short odd cycles are nearly bipartite(Note) 163 (1997) 279-284

Hadjiat, M. and J.F. Maurras, A strongly poly-nomial algorithm for the minimum cost tensionproblem 165/166 (1997) 377-394

Hagauer, J. and S. Klavzar, Clique-gated graphs 161 (1996) 143-149Hall, T.E. and M.V. Sapir, Idempotents, regular ele-

ments and sequences from finite semigroups 161 (1996) 151-160Henning, M.A.,O.R. Oellermann and H.C. Swart, The

diversity of domination 161 (1996) 161-173Hamidoune, YO. and M.L. Vergnas, Directed switch-

ing games II: The Arborescence Game 165/166 (1997) 395-402Hamidoune, Y.O., On weighted sums in abelian

groups 162 (1996) 127-132

14 Master index of volumes 161-170

Hamilton, G.M., C. Ramsay, LT. Roberts and D.G.Rogers, Uniform perfect systems of sets of iterateddifferences of size 4

Hammer, P.L., see G. DingHansen, P., A. Hertz and N. Quinodoz, Splitting

treesHarkat-Benhamdine, A., see M.E.K. AbderrezzakHattingh, J.H., see J.E. DunbarHedetniemi, S.T., see J.E. DunbarHell, P., see R.C. BrewsterHenning, M.A., O,R. Oellermann and H.C. Swart,

Local edge domination critical graphsHenning, M.A., see L.W. BeinekeHertz, A., see P. HansenHevia, H., see G. ChartrandHilton, AJ.W., see L.D. AndersenHindman, N. and H. Lefmann, Canonical partition

relations for (m, p, c)-systemsHoffmann, P., Counting maximal cycles in binary

matroids (Note)Hoggar, S.G., Weight enumerators of codes derived

from polynomial product algorithmsHorak, P., see A. CernyHornak, M. and S. Jendrol, On the d-distance face

chromatic number of plane graphsHougardy, S., Perfect graphs with unique P 4 -structureHoward, F.T., Explicit formulas for degenerate Be-

rnoulli numbersHuang, J., see 1. Bang-JensenHudry, 0., see L CharonHurley, S., see D.H. SmithHurtado, F., O. Serra and 1. Urrutia, Hiding points in

arrangements of segments

Imrich, W., T. Pisanski and J. Zerovnik, RecognizingCartesian graph bundles

Jackson, B. and N.C. Wormald, On the lineark-arboricity of cubic graphs (Note)

Jarrett, E.B., see G. ChartrandJendro1, S., see M. HornakJennings, D. and K. Byard, An extension for residue

difference sets

162 (1996) 133-150165/166 (1997) 211-217

165/166 (1997) 403-419165/166 (1997) 11- 20167/168 (1997) 261-269167/168 (1997) 261-269167/168 (1997) 145-154

161 (1996) 175-184167/168 (1997) 127-139165/166 (1997) 403-419

170 (1997) 63- 79167/168 (1997) 17- 34

162 (1996) 151-174

162 (1996) 291-292

167/168 (1997) 373-391167/168 (1997) 189-196

164 (1997) 171-174165/166 (1997) 421-430

162 (1996) 175-185161 (1996) 1- 12

165/166 (1997) 139-153167/168 (1997) 571-582

162 (1996) 187-197

167/168 (1997) 393-403

162 (1996) 293-297170 (1997) 63- 79164 (1997) 171-174

167/168 (1997) 405-410

Masterindexof volumes 161-170 15

Jonck, R, see G. Benade 162 (1996) 13- 22Junming, L., see X. Keyi 163 (1997) 285-291

Kalhotf, F., On projective embeddings of partialplanes and rank-three matroids 163 (1997) 67- 79

Katona, G.O.H., Extremal problems for finite sets andconvex hulls - A survey 164 (1997) 175-185

Katona, G.Y., Toughness and edge-toughness 164 (1997) 187-196Keyi, X. and L. Junming, On Srivastava's problems

and the properties of Hadamard matrices (Note) 163 (1997) 285-291Khachiyan, L., see V. Gurvich 169 (1997) 245-248Klavzar, S., see 1. Hagauer 161 (1996) 143-149Klazar, M., Combinatorial aspects of Davenport-,

Schinzel sequences-,

165/166 (1997) 431-445Klazar, M., On well quasiordering of finite languages 163 (1997) 81- 88Ko, C.-W., J. Lee and E. Steingrimsson, The volume

of relaxed Boolean-quadric and cut polytopes(Note) 163 (1997) 293-298

Kochol, M., A cyclically 6-edge-connected snark oforder 118 (Note) 161 (1996) 297-300

Koh, K.M., see F.M. Dong 169 (1997) 39- 54Koh, K.M. and RP. Tan, The number of kings in

a multipartite tournament 167/168 (1997) 411-418Komar, J., see S. Bylka 164 (1997) 33- 45Korchmaros, G., see A Bonisoli 161 (1996) 13- 24Korzhik, V.P., A tighter bounding interval for the

1-chromatic number of a surface 169 (1997) 95-120Kostochka, A. and 1. Kratochvil, Covering and color-

ing polygon-circle graphs (Note) 163 (1997) 299-305Kostochka, A.V., M. Stiebitz and R Wirth, The colour

theorems of Brooks and Gallai extended (Note) 162 (1996) 299-303Kostochka, AV., The total chromatic number of any

multigraph with maximum degree five is at mostseven 162 (1996) 199-214

Kostochka, AV., see E. Gyori 163 (1997) 279-284Kostochka, A.V., see T. Bohme 170 (1997) 219-222Kratochvil, J., see A. Kostochka 163 (1997) 299-305Kratsch, D. and J.-X. Rampon, Width two posets are

reconstructible (Note) 162 (1996) 305-310Kratsch, D., see J.S. Deogun 170 (1997) 99-106Krattenthaler, C., see M. Fulmek 161 (1996) 101-120Kreinin, A. and A. Vainshtein, Asymptotics for

Morgan numbers of fractional orders (Note) 161 (1996) 301-308

16 Master index a/ volumes 161-1 70

Krivelevich, M., Almost perfect matchings in randomuniform hypergraphs (Note) 170 (1997) 259-263

Krompart, L.B., see K.L. Collins 169 (1997) 29- 38Kiihnel , W. and G. Lassmann, Permuted difference

cycles and triangulated sphere bundles 162 (1996) 215-227Kubale, M., J. Pakulski and K. Piwakowski, The

smallest hard-to-color graph for the SL algorithm 164 (1997) 197-212Kuo, D., GJ. Chang and Y.H.H. Kwong, Cordial

labeling of mK n 169 (1997) 121-131Kwasnik, M. and A. Szelecka, Strong perfectness of

the generalized Cartesian product of graphs 164 (1997) 213-220Kwong, Y.H.H., see D. Kuo 169 (1997) 121-131

Laborde, J.M. and R.M. Madani, Generalized hyper-cubes and (0,2)-graphs 165/166 (1997) 447-459

Larose, B. and L. Zadori, Algebraic properties anddismantlability of finite posets 163 (1997) 89- 99

Laskar, R.C., see G.S. Domke 167/168 (1997) 249-259Lassmann, G., see W. Kiihnel 162 (1996) 215-227Latha, L.P., see E. Sampathkumar 161 (1996) 235-242Laurent, M., see J. Edmonds 165/166 (1997) 219-226Lauri, 1., On a formula for the number of Euler trails

for a class of digraphs (Note) 163 (1997) 307-312Lee, J., see c.-W. Ko 163 (1997) 293-298Leader, I., see B. Bollobas 162 (1996) 31- 48Leclerc, B., Families of chains of a poset and Sperner

properties 165/166 (1997) 461-468Lefmann, H., see N. Hindman 162 (1996) 151-174Lehel, J., The partition of a uniform hypergraph into

pairs of dependent hyperedges (Note) 163 (1997) 313-318Lenart, C. and N. Ray, Chromatic polynomials of

partition systems 167/168 (1997) 419-444Lewis, R.P., The ranks of partitions modulo 2 167/168 (1997) 445-449Li, H., M. Lu, F. Tian and B. Wei, Hamiltonicity of

2-connected claw-center independent graphs 165/166 (1997) 469-479Li, H., see M.E.K. Abderrezzak 165/166 (1997) 11- 20Li, 1. and F. Tian , A proof of a conjecture about

DA-paths in graphs with large neighborhoodunions 161 (1996) 185-196

Li, X., A lower bound for the connectivity of directedEuler tour transformation graphs 163 (1997) 101-108

Li, Y. an~C. Rousseau, On the Ramsey numberr(H + x; K n ) (Note) 170 (1997) 265-267

Master index of volumes 161-170 17

Li, Y., C.C. Rousseau and L. Soltes, Ramsey linearfamilies and generalized subdivided graphs (Note) 170 (1997) 269-275

Lin, Y.-c., see J.R. Griggs 169 (1997) 233-243

Liu, X. and B. Wei, A generalization of Bondy's andFan's sufficient conditions for Hamiltonian graphs

(Note) 169 (1997) 249-255Linhares-Sales, C, see H. Everett 165/166 (1997) 233-252Liptak, L., Sperner systems containing at most k sets

of every cardinality (Communication) 170 (1997) 203-209Liu, D.D.-F., T-graphs and the channel assignment

problem 161 (1996) 197-205Liu, J. and H. Zhou, Maximum induced matchings in

graphs (Note) 170 (1997) 277-281Liu, X., Lower bounds of length of longest cycles in

graphs involving neighborhood unions 169 (1997) 133-144

Llado, A.S., see G. Ringel 165/166 (1997) 587-595

Lowe, M., see I. Althofer 162 (1996) 267-271Lone, Z., Delta-system decompositions of graphs 164 (1997) 221-224Lu, M., see H. Li 165/166 (1997) 469-479Luczak, T., see E. Gyori 163 (1997) 279-284Lungo, A.D., see E. Barcucci 170 (1997) 211-217

Marquez, A., see L. Boza 161 (1996) 45- 52MacGillivray, G., see RC. Brewster 167/168 (1997) 145-154Macula, AJ., A simple construction of d-disjunct

matrices with certain constant weights (Note) 162 (1996) 311-312Macula, AJ., Two applications of separating systems

to nonadaptive procedures (Note) 169 (1997) 257-262Madani, R.M., see J.M. Laborde 165/166 (1997) 447-459Maffray, F. and M. Preissmann, On the NP-complete-

ness of the k-colorability problem for triangle-freegraphs (Note) 162 (1996) 313-317

Maffray, F., see H. Alt Haddadene 163 (1997) 211-215Maffray, F., see H. Everett 165/166 (1997) 233-252Maffray, F., see S. Gravier 165/166 (1997) 353-358Maheo, M., see J. Gimbel 165/166 (1997) 343-351Mahjoub, A.R, On perfectly two-edge connected

graphs 170 (1997) 153-172

Mahjoub, A.R, see M. Bouchakour 165/166 (1997) 101-123

Mahmoodian, E.S., R. Naserasr and M. Zaker, Defin-ing sets in vertex colorings of graphs and latinrectangles 167/168 (1997) 451-460

Maier, T., see RE. Burkard 161 (1996) 53- 61

18 Master index a/volumes 161-170

Maire, F., see 1.-L. FouquetMajcher, Z. and J. Michael, Degree sequences of high-

ly irregular graphsMajcher, Z. and 1. Michael, Highly irregular graphs

with extreme numbers of edgesMarkus, L.R., see G.S. DomkeMartin, N., Complete bipartite factorisations by com-

plete bipartite graphsMaureso, M., see 1.M. BrunatMaurras, 1.-F. and Y. Vaxes, Multicommodity net-

work flow with jump constraintsMaurras, 1.F., see M. HadjiatMcDiarmid, C, Hypergraph colouring and the

Lovasz Local LemmaMcDougal, K., A generalization of Ryser's theorem on

term rank (Note)McRae, A.A., see J.E. DunbarMichael, 1., see Z. MajcherMichael, 1., see Z. MajcherMilazzo, L., The monochromatic block numberMiller, W.P., Techniques in matroid reconstructionMonjardel, R, On a dependence relation in finite

latticesMoon, J.W., On the number of induced subgraphs of

treesMora, M., see J.M. BrunatMiiller, H. and J.-X. Rampon, Partial orders and their

convex subsetsMudrinski, V., see D.M. AcketaMulder, H.M., see A.E. BrouwerMurphy, J.P., see MJ. GrannellMuzychuk, M., On Adam's conjecture for circulant

graphsMynhardt, CM., see A.P. BurgerMynhardt, CM., see EJ. Cockayne

Naserasr, R., see E.S. MahmoodianNesetfil, J., A. Raspaud and E. Sopena, Colorings and

girth of oriented planargraphsNeumann-Lara, V. and E. Rivera-Campo, Euler tours

and a game with dominoesNeumann-Lara, v., Vertex critical 4-dichromatic

circulant tournaments (Note)

165/166 (1997) 301-312

164 (1997) 225-236

164 (1997) 237-242167/168 (1997) 237-248

167/168 (1997) 461-480165/166 (1997) 125-137

165/166 (1997) 481-486165/166 (1997) 377-394

167/168 (1997) 481-486

170 (1997) 283-288167/168 (1997) 261-269

164 (1997) 225-236164 (1997) 237-242

165/166 (1997) 487-496170 (1997) 173-183

165/166 (1997) 497-505

167/168 (1997) 487-496165/166 (1997) 125-137

165/166 (1997) 507-517163 (1997) 209-210169 (1997) 153-155

167/168 (1997) 341-352

167/168 (1997) 497-510163 (1997) 47- 66

167/168 (1997) 205-214

167/168 (1997) 451-460

165/166 (1997) 519-530

167/168 (1997) 511-517

170 (1997) 289-291

Master index a/volumes 161-170 19

Nishimura, T. and A. Saito, Two recursive theoremson n-extendibility (Note) 162 (1996) 319-323

Oates-Williams, S., see D.E. Bryant 167/168 (1997) 167-174Oellermann, O.R., see M.A. Henning 161 (1996) 161-173Oellermann, O.R., see M.A. Henning 161 (1996) 175-184Ono, K., Odd values of the partition function (Note) 169 (1997) 263-268Ordaz, 0., D. Amar and A. Raspaud, Hamiltonian

properties and the bipartite independence number 161 (1996) 207-215Owens, PJ. and D.A. Preece, Aspects of complete sets

of 9 x 9 pairwise orthogonal latin squares 167/168 (1997) 519-525

Padberg, M. and T.-Y. Sung, An analytic symmetriz-ation of max flow-min cut 165/166 (1997) 531-545

Pakulski, 1., see M. Kubale 164 (1997) 197-212Palisse, R., Subsets of a finite set that almost always

intersect each other in A elements 165/166 (1997) 547-553Payan, C., Empilement de cercles egaux dans un tri-

angle equilateral: A propos d'une conjectured'Erdos-Oler 165/166 (1997) 555-565

Perkovic, L. and B. Reed, Edge coloring regulargraphs of high degree 165/166 (1997) 567-578

Pinkernell, A., see Y. Guo 164 (1997) 165-170Pinzani, R., see E. Barcucci 170 (1997) 211-217Pisanski, T., see W. Imrich 167/168 (1997) 393-403Piwakowski, K., On Ramsey number R(4, 3, 3) and

triangle-free edge-chromatic graphs in three colors 164 (1997) 243-249Piwakowski, K., see M. Kubale 164 (1997) 197-212Plummer, M.D., see W. Goddard 167/168 (1997) 329-339Politof, T. and A. Satyanarayana, The structure of

quasi 4-connected graphs 161 (1996) 217-228Porto, 0., see H. Everett 165/166 (1997) 233-252Prea, P., About weak connectivity 165/166 (1997) 579-586Preece, D.A., Some 6 x 11 Youden squares and double

Youden rectangles 167/168 (1997) 527-541Preece, D.A., see P.I. Owens 167/168 (1997) 519-525Preissmann, M., see F. Maffray 162 (1996) 313-317Pretorius, L.M., see CJ. Swanepoel 167/168 (1997) 583-592Prisner, E., Radius versus diameter in cocomparability

and intersection graphs 163 (1997) 109-117Prodinger, H., see X. Gourdon 169 (1997) 227-232Pyber, L., see P. Erdos 170 (1997) 249-252

Quinodoz, N., see P. Hansen 165/166 (1997) 403-419

20 Master index a/volumes /61-170

Rajan, D.S. and A.M. Shende, A characterization ofroot lattices (Nate) 161 (1996) 309-314

Rampon, J.-X., see D. Kratsch 162 (1996) 305-310Rampon, J.-x., see H. MUller 165/166 (1997) 507-517Ramsay, c., see G.M. Hamilton 162 (1996) 133-150Raspaud, A., see J. Nesetfil 165/166 (1997) 519-530Raspaud, A., see O. Ordaz 161 (1996) 207-215Ray, N., see C. Lenart 167/168 (1997) 419-444Read, R'C, Combinatorial problems in the theory of

music 167/168 (1997) 543-551Redouane, Y., see O. Favaron 165/166 (1997) 253-261Reed, B., see L. Perkovic 165/166 (1997) 567-578Reed, B.A., see H. Everett 165/166 (1997) 233-252Reid, TJ. and L.L Virden, On rounded five-element

lines of matroids 163 (1997) 119-127Ren, S., A sufficient condition for graphs with large

neighborhood unions to be traceable 161 (1996) 229-234Riis, S., Bootstrapping the primitive recursive func-

tions by only 27 colors (Nate) 169 (1997) 269-272Ringel, G., A.S. Llado and O. Serra, On the tree

number of regular graphs 165/166 (1997) 587-595Rivera-Campo, E., see V. Neumann-Lara 167/168 (1997) 511-517Roberts, LT., see G.M. Hamilton 162 (1996) 133-150Roditty, Y., see Y. Caro 164 (1997) 47- 65Rogers, D.G., see G.M. Hamilton 162 (1996) 133-150Rousseau, C., see Y. Li 170 (1997) 265-267Rousseau, c.c., see Y. Li 170 (1997) 269-275Roussel, F., see V. Giakoumakis 165/166 (1997) 321-342Rucinski, A. and M. Truszczynski, A note on local

colorings of graphs 164 (1997) 251-255Rusu, I., see J.-L. Fouquet 165/166 (1997) 301-312Ryjacek, Z., Matching extension in K l.r-free graphs

with independent claw centers 164 (1997) 257-263Ryjacek, Z; see R. Faudree 164 (1997) 87-147Ryjacek, Z., see H.J. Broersma 167/168 (1997) 155-166

Sachs, H., Graph Theory in Organic Chemistry: Prob-lems and Methods in the Chemistry of CarbonFootballs and Tubes (Fullerenes) 165/166 (1997) 597-598

Sacle, J.-F. and M. Wozniak, A note on packing ofthree forests 164 (1997) 265-274

Sacle, J.-F. and M. Wozniak, On graphs which con-tain each tree of given size 165/166 (1997) 599-605

Master index of oolumes 161-170 21

Saito, A., see T. Nishimura 162 (1996) 319-323Salvetti, M. and F. Stumbo, Artin groups associated

to infinite Coxeter groups 163 (1997) 129-138Sampathkumar, E. and L.P. Latha, Strong weak

domination and domination balance in a graph 161 (1996) 235-242Sankaranarayana, R.S. and L.K. Stewart, Recursively

decomposable well-covered graphs 161 (1996) 243-263Sapir, M.V., see T.E. Hall 161 (1996) 151-160Satyanarayana, A., see T. Politof 161 (1996) 217-228Schaar, G. and A.P. Wojda, An upper bound for the

Hamiltonicity exponent of finite digraphs (Not e) 164 (1997) 313-316Schaar, G., On the Hamiltonicity exponent of directed

cacti 164 (1997) 275-284Schelp, R.H., see G. Chen 170 (1997) 231-236Schiermeyer, I., see HJ. Broersma 167/168 (1997) 155- 166Schonheim, J., see Y. Caro 164 (1997) 47- 65Schrijver, A., see J. Edmonds 165/166 (1997) 219-226Schultz, M., see G. Chartrand 170 (1997) 63- 79Scott, A.D., see B. Bollobas 170 (1997) 41- 49Serra, 0., see F. Hurtado 162 (1996) 187-197Serra, 0 ., see G. Ringel 165/166 (1997) 587-595Sevast'janov, S. and W. Banaszczyk, To the Steinitz

lemma in coordinate form 169 (1997) 145-152Shahriari, S., On the structure of maximum 2-part

Sperner families 162 (1996) 229-238Shende, A.M., see D .S. Rajan 161 (1996) 309-314Shreve, W.E., see G. Chen 170 (1997) 231-236Simon, K., see D. Crippa 170 (1997) 81- 98Sinclair, P.A., The construction and reduction of

strong snarks 167/168 (1997) 553-570Sloane, NJ.A., see M. Bernstein 170 (1997) 29- 39Smith , D.H. and S. Hurley, Bounds for the frequen cy

assignment problem 167/168 (1997) 571-582Smith , W.D., see M.B. Dillencourt 161 (1996) 63- 77Snevily, H.S., New families of graphs that have

z-labelings 170 (1997) 185-194Soltes, L., see Y. Li 170 (1997) 269-275Sopena, E., see J. Nesetfil 165/166 (1997) 519-530Speranza, M.G., see P. Dell'Olmo 164 (1997) 67- 79Stacho, L., A sufficient condition guaranteeing large

cycles in graphs (Note) 169 (1997) 273- 277Stachowiak, G., Finding parity difference by involu-

tions 163 (1997) 139-151

22 Master index of iolumes 161-170

Stefan, J. and P. Charles, Une caracterisation desproduits d'arbres et des grilles (Communication)

Steffen, E., see G. BrinkmannSteffen, E., Counterexamples to a conjecture about

bottlenecks in non-Tait-colourable cubic graphs(Note)

Steiner, G., see J.S. DeogunSteingrimsson, E., see c.W. KoStewart, LA., On locating cubic subgraphs In

bounded-degree connected bipartite graphs (Note)Stewart, L.K., see R.S. SankaranarayanaStiebitz, M., see A.V. KostochkaStiebitz, M., see T. BohmeStumbo, F., see M. SalvettiSun, Z.-H., Congruences for Bernoulli numbers and

Bernoulli polynomialsSung, T.-Y., see M. PadbergSwanepoel, c.J. and L.M. Pretorius, Factor-comp-

lement partitions of ascending k-parameter wordsSwart, H.C., see M.A. HenningSwart, H.C., see M.A. HenningSwart, H.C., see W. GoddardSwart, H.C., see W. GoddardSzelecka, A., see M. Kwasnik

Talip, see X.-R., YongTan, B.P., see K.M. KohTang, X. and A. Ben-Israel, Two consequences of

Minkowski's 2n theorem (Note)Thomassen, C., Dirac's conjecture on Ks-subdivisionsThuillier, H., see J.-L. FouquetThuillier, H., see V. GiakoumakisTian, F., see H. LiTian, F., see J. LiTillich, J.P., see C. DelormeToader, Gh., On Chebyshev's inequality for sequences

(Note)Togni, 0., Irregularity strength of the toroidal gridTomescu, I., On the number of trees having k edges in

common with a graph of bounded degrees (Note)Topp, J. and P.D. Vestergaard, Totally equimatchable

graphsTruszczynski, M., see A. Rucinski

163 (1997) 201-208169 (1997) 193-197

161 (1996) 315170 (1997) 99-106163 (1997) 293-298

163 (1997) 319-324161 (1996) 243-263162 (1996) 299-303170 (1997) 219-222163 (1997) 129-138

163 (1997) 153-163165/166 (1997) 531-545

167/168 (1997) 583-592161 (1996) 161-173161 (1996) 175-184161 (1996) 121-132

167/168 (1997) 329-339164 (1997) 213-220

169 (1997) 293-298167/168 (1997) 411-418

169 (1997) 279-282165/166 (1997) 607-608165/166 (1997) 301-312165/166 (1997) 321-342165/166 (1997) 469-479

161 (1996) 185-196165/166 (1997) 171-194

161 (1996) 317-322165/166 (1997) 609-620

169 (1997) 283-286

164 (1997) 285-290164 (1997) 251-255

Master index01volumes 16l-l70

Tsay, Y.-J. and GJ. Chang, The exact gossipingproblem

Tuza, Zs., see N. AlonTuza, Zs., see P. Dell'OlmoTyshkevich, R.L and V.E. Zverovich, Line hyper-

graphs

Urrutia, J., see F. HurtadoUshio, K., Star-factorization of symmetric complete

bipartite digraphs

23

163 (1997) 165-172165/166 (1997) 31- 38

164 (1997) 67- 79

161 (1996) 265-283

162 (1996) 187-197

167/168 (1997) 593-596

164 (1997) 303-311161 (1996) 301-308

164 (1997) 303-311

165/166 (1997) 621-638

164 (1997) 295-301164 (1997) 295-301

167/168 (1997) 189-196

Vaderlind, P., see A.P. WojdaVainshtein, A., see A. KreininValette, A., An application of Ramanujan graphs to

C*-algebra tensor productsVanderkam, J.M., Path-sequentiallabellings of cyclesVaxes, Y., see J.-F . MaurrasVergnas , M.L., see Y.O. HamidouneVestergaard, P.O., see J. ToppVirden, L.L, see TJ. ReidVirlouvet, C, see J. GimbelVoigt, M., see N. AlonVolkmann, L., see J. Bang-JensenVolkmann, L., see Y. GuoVu Dinh, H., Path partition number in tough graphs

Wloch, A. and 1. Wloch, On (k, Q-kernels in gener-alized products

Wloch, 1., see A. WlochWallis, W.O., see A. CernyWan, P.-J. and D.-Z. Du, A (log, 3 + -!-)-competitive

algorithm for the counterfeit coin problemWebb , B.S., Orbits of infinite block designs (Note)Wei, B., see X. LiuWei, B., Longest cycles in 3-connected graphsWei, B., see H. LiWei, R., see F.E. BennettWirth, B., see A.V. KostochkaWoirgard, F., see 1. CharonWojda, A.P. and P. Vaderlind, Packing bipartite

graphsWajda, A.P. and LA. Ziolo, Embedding digraphs of

small size

167/168162

165/166165/166

164163

165/166165/166167/168

164164

163169169170

165/166170162

165/166

(1997)(1996)(1997)(1997)(1997)(1997)(1997)(1997)(1997)(1997)(1997)

(1997)(1997)(1997)(1997)(1997)(1997)(1996)(1997)

597-603239-249481-486395-402285-290119-127343-35131- 38

101-114165-170291-294

173-200287-292249-255195-201469-479

15- 28299-303139-153

24 Master index of »olumes /61-170

Wojda, A.P., see G. Schaar 164 (1997) 313-316Wormald, N.C., see B. Jackson 162 (1996) 293-297Wozniak, M., see J.-F. Sacle 164 (1997) 265-274Wozniak, M., see J.-F. Sacle 165/166 (1997) 599-605Wright, P.E., see M. Bernstein 170 (1997) 29- 39

Yamasaki, Y., The arithmetic of reversed positionalgames 165/166 (1997) 639-641

Yebra, J.L.A, see M.A. Fiol 167/168 (1997) 297-307Yeo, A, see J. Bang-Jensen 162 (1996) 1- 11Yin, 1., see F.E. Bennett 162 (1996) 23- 29Yong, X.-R., Talip and Acenjian, The numbers of

spanning trees of the cubic cycle C~ and thequadruple cycle C~ (Note) 169 (1997) 293-298

Yuster, R., On packing trees into complete bipartitegraphs (Note) 163 (1997) 325-327

Zerovnik, J., see W. Imrich 167/168 (1997) 393-403Zadori, L., see B. Larose 163 (1997) 89- 99Zaker, M., see E.S. Mahmoodian 167/168 (1997) 451-460Zamfirescu, c., Cyclic and cliquewise connectedness

of line graphs (Note) 170 (1997) 293-297Zha, X., Closed 2-cell embeddings of 4 cross-cap

embeddable graphs 162 (1996) 251-266Zhang, H., Characterization of self-complementary

symmetric digraphs (Note) 161 (1996) 323-327Zhou, H., see J. Liu 170 (1997) 277-281Zhu, X., see W.A. Deuber 165/166 (1997) 195-204Ziolo, LA., see AP. Wojda 165/166 (1997) 621-638Zverovich, YE., see R.L Tyshkevich 161 (1996) 265-283