List of referees: volumes 191-200 - COnnecting REpositories · 2017-02-25 · List of referees: volumes 191-200 DISCRETE MATHEMATICS has continuously benefitted from the kind assistance

List of referees: volumes 191-200

DISCRETE MATHEMATICS has continuously benefitted from the kind assistance of a great number of referees. We hereby express our gratitude for their sustained efforts, without which our activity could not have been carried out.

the editors

M. Adams M.E. Adams A.A. Ageev F. Aguilo-Gost M. Aigner A. Ainouche M.O. Albertson N. Alon A. Altshuler D. Amar D. Archdeacon AS. Asratian G. Bacso C. Balbuena J.T. Baldwin S. Baldwin K.T. Balinska J. Bang-Jensen E. Barcucci U. Baumann R.A. Beezer L.W. Beineke E.A. Bender C. Benzaken A. Bialostocki T. Bier J. Blazewicz H.L. Bodlaender M. Bona J.E. Bonin A. Bonisoli A. Borobia O.V. Borodin E. Boros M. Bousquet-Melou A. Brandstadt F. Brenti G.R. Brightwell

H.J. Broersma R.W. Brooks J.I. Brown R.A. Brualdi A. Bruen K. Brys I. Cahit A.R. Camina E.R. Canfield J. Cazaran P.V. Ceccherini Chang Gerard J G. Chartrand Chen Guantao Chen Jianer Cheng Christine T V.D. Chepoi A.G. Chetwynd R. Cignoli E.J. Cockayne C.J. Colbourn K.L. Collins R. Cori L.J. Cowen D. Cvetkovic I.P.F. da Silva P. Damaschke F. De Clerck D. de Werra A. Del Fra A. Delandtsheer C. Delorme E. Demaine J.H. Dinitz M. Doob T. Dowling Du Qingyan S. Dulucq

J.E. Dunbar F. Durand G. Eigenthaler M.H. El-Zahar K. Engel H. Enomoto T. Etzion R.J. Evans S. Fajtlowicz J.D. Farley E.J. Farrell R.J. Faudree 0. Favaron U. Feige G. Fiorini P.C. Fishburn J.C. Fisher E. Flandrin H. Fleischner P. Gacs J.A. Gallian F. Galvin T. Gangopadhyay J. Georges B. Gerards A. Geroldinger I. Gessel F. Giannessi J. Gimbel F. Gliviak W. Goddard M.K. Goldberg E. Goles G. Gordon R.J. Gould RI. Gow D.J. Grabiner R.L. Graham

2 List of referees: wlumes 191-200

M. Greferath C.M. Grinstead H.-D. Gronau L.K. Grover J. Gruszka D.R. Guichard V.A. Gurvich G.Z. Gutin A. Gyarfas M. Habib L. Habsieger J.B. Haglund G. Hahn S.L. Hakimi P. Hamburger D.R. Hare I.B.-A. Hartman B.L. Hartnell J.H. Hattingh K. Heinrich M.A. Henning A. Hertz R. Hill J.W.P. Hirschfeld D. Hochenberger W. Hochstaettler W. Hodges M. Hofmeister I.J. Holyer I. Honkala P. Horak S. Hougardy Hwang Frank K G. lsaak Y. Ishigami MS. Jacobson S. Jendrol R.H. Jeurissen W.P. Johnson H.A. Jung D. Jungnickel J. Kahn Kang Liying L. Kaszonyi G.O.H. Katona K.P. Keating A.D. Keedwell A. Khodkar H.A. Kierstead Kim Jeong Han S. Kirkland A. Klapper V. Klee J.B. Klerlein D. Kobler

J. Komlos J. Korner G. Kortsarz A.V. Kostochka S. Kostochka J. Kratochvil D. Kratsch C. Krattenthaler W. Kubiak W. Kuehnel P.V. Kumar J.P. Kung R. Labahn J.C. Lagarias Lai Hong-Jian Le Van Bang J. Lehel P. Lemke C. Lenart T. Lengyel P. Leroux Li Cai Heng A.L. Liestman C. Lindner V. Linek V.A. Liskovets Liu Yanpei 0. Livneh E.K. Lloyd D.E. Loeb M. Loebl M. Lovrecic Sarazin J.R. Lundgren G. MacGillivray A. Machi F. Maffray M. Maheo J.I. Malitz D. Marusic W. McCuaig C. McDiarmid T.A. McKee F.R. McMorris P. McMullen E. Mendelsohn R. Meshulam SC. Milne Z.K. Min B. Mohar B. Monien G. Moran M. Morton M. Moscarini H. Mueller H.M. Mulder

X. Munoz M.E. Muzychuk C.M. Mynhardt M. Nakamura C. St. J. Nash-Williams J.B. Nation S. Negami J. Nesetril H. Niederhausen T. Niessen R. Nowakowski J. O’Rourke S. Olariu J.G. Oxley J. Path P.P. Palfy A. Pelt U.N. Peled K.T. Phelps N. Pippenger T. Pisanski M.J. Plantholt J. Plesnik A. Pluhar N. Polat R. Poschel D. Powers M. Preissmann A. Prekopa H. Priestley E. Prisner D. Pritikin H. Prodinger J. Propp A.R. Pruss A. Pultr S.P. Radziszowski E.M. Rains B. Randerath R.C. Read R. Rees K.B. Reid T.J. Reid V. Reiner K. Reuter B. Richmond C.A. Rodger Y. Roditty V. Rod1 T.D. Rogers A. Romanowska A. Rosa G.-C. Rota P. Rowlinson G.F. Royle

List of referees: volumes 191-200

S. Rudeanu A. Rutkowski Z. Ryjacek H. Sachs D. Sakai Troxell I. Schiermeyer A. Schrijver E. Schulte J.R. Seberry L.W. Shapiro J.B. Shearer J. Sheehan F.B. Shepherd J. Sichler R.E. Simion M. Simonovits D. Singerman .I. Siran J.A. Sjogren M. Skoviera Z. Skupien N.J.A. Solane P.F. Stadler S. Stahl D. Stanton R. Steinberg E. Steingrimsson L. Storme R.A. Sulanke

D.P. Sumner S. Szabo P.J. Szeptycki L. Takacs P. Terwilliger A.G. Thomason E.G. Thurber S.H. Tijs D.T. Todorov B. Toft I. Tomescu G. Toth T. Traczyk A.N. Trenk M. Truszczynski M. Tsuchiya Z. Tuza H. Tverberg P. van Emde Boas H. Van Maldeghem J.M. VanderKam V.I. Voloshin M.L. Wachs C.G. Wagner T. Walsh I. Walters Wang Chi Wang Hong M.E. Watkins

V. Welker D.J.A. Welsh D.B. West J. West A.T. White H.S. Wilf R. Willard R.J. Wilson D.R. Witte A.P. Wojda A.J. Woldar D.R. Woodall A.R. Woods N.C. Wormald M. Wozniak Wu Haidong Xu Baogang H.P. Yap Yuan Jinjiang R. Yuster L. Zadori A. Zaks J. Zaks J. Zapletal T. Zaslavsky B. Zelinka J. Zerovnik I.E. Zverovich

Master index of volumes 191-200

Abbott, H.L. and D.R. Hare, Square critically 3- chromatichypergraphs

Abels, H., A projection property for buildings Abrego, B., J.L. Arocha, S. Fernandez-Merchant and

V. Neumann-Lara, Tightness problems in the plane

Acharya, B.D. and P. Gupta, On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets

Ageev, A.A., Every circle graph of girth at least 5 is 3-colourable (Note)

Aguilo-Gost, F., New dense families of triple loop networks

Aldred, R.E.L. and M.D. Plummer, On matching extensions with prescribed and proscribed edge sets II

Alfano, J., A basis for the Y’ subspace of diagonal harmonic polynomials

Alladi, K., A variation on a theme of Sylvester - a smoother road to Gollnitz’s (Big) theorem

Allen, E.E., A conjecture of a basis for the diagonal harmonic alternants

Allen, S.M., D.H. Smith and S. Hurley, Lower bounding techniques for frequency assignment

Anderson, I., On the construction of balanced Room squares

Andreae, T., On the clique-transversal number of chordal graphs

Andrews, G.E., Pfalf’s method (I): The Mills- Robbins- Rumsey determinant

Arocha, J.L., see B. Abrego Assaf, A.M. and R. Wei, Modified group divisible

designs with block size 4 and A = 1 Atkins, A.C., G.N. Sarkozy and S.M. Selkow,

Counting irregular multigraphs (Note) Atkinson, M.D., Restricted permutations Ayala, R., M.J. Chavez, A. Marquez and A. Quintero,

On the connectivity of infinite graphs and 2- complexes

197/ 198 (1999) 3- 13 192 (1998) 3- 10

194

195 (1999) l- 13

195 (1999) 229-233

1971198 (2999) 15- 27

1971198

193

196

193

1971198

1971198

191

193 194

195

195 195

194

(1999)

(1999)

(1998)

(1999)

(1998)

(1999)

(1999)

(1998)

(1998) (1999)

(1999)

(1999) (1999)

(1999)

l- 11

29- 40

17- 31

l- 11

33- 42

41- 52

53- 60

3- 11

43- 60 l- 11

15- 25

235-237 27- 38

13- 37

Elsevier Science B.V.

6 Master index of volumes 191-200

Babel, L., Tree-like P,-connected graphs Balbuena, C., A. Carmona, J. Fabrega and M.A. Fiol,

Superconnectivity of bipartite digraphs and graphs

Balbuena, C., Extraconnectivity of s-geodetic digraphs and graphs

Bang-Jensen, J., Linkages in locally semicomplete digraphs and quasi-transitive digraphs

Barcelo, H. and E. Ihrig, Modular elements in the lattice L(A) when A is a real reflection arrange- ment

Barnette, D.W. and S. Gillett, Paths and circuits in partially directed graphs (Note)

Beasley, L.B., SD. Monson and N.J. Pullman, Linear operators that strongly preserve graphical properties of matrices - II

Bedford, D. and R.M. Whitaker, Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8

Betten, A., R. Laue and A. Wassermann, New t- designs and large sets of t-designs

Betten, A., M. Klin, R. Laue and A. Wassermann, Graphical t-designs via polynomial Kramer- Mesner matrices

Bhatnagar, G., see S.C. Milne Billey, S., Transition equations for isotropic flag mani-

folds Billington, E.J., Decomposing complete tripartite

graphs into cycles of lengths 3 and 4 Bjorner, A., A general homotopy complementation

formula Blokhuis, A. and C.M. O’Keefe, On deriving unitals Bohme, T., J. Harant, A. Pruchnewski and I. Schier-

meyer, A planarity criterion for cubic bipartite graphs

Bohme, T. and J. Harant, On Hamiltonian cycles in 4- and 5-connected plane triangulations

Bollobas, B., 0. Riordan, Z. Ryjacek, A. Saito and R.H. Schelp, Closure and Hamiltonian-connectivity of claw-free graphs

Bollobas, B., P. Erdiis and A. Sarkar, Extremal graphs for weights

Bondy, J.A., P. Erdiis and S. Fajtlowicz, Graphs of diameter two with no 4-circuits

Borodin, O.V., A.V. Kostochka and D.R. Woodall, On kernel-perfect orientations of line graphs

191 (1998) 13- 23

1971198 (1999) 61- 7.5

195 (1999) 39- 52

196 (1999) 13- 27

193

195

195

1971198 (1999) 77- 81

1971198 (1999) 111-121

1971198 193

193

197/198

193 197/ 198

191

191

195 (1999) 67- 80

200 (1999) 5- 19

200 (1999) 21- 25

191 (1998) 45- 49

(1998) 61- 78

(1999) 239-243

(1999) 53- 66

(1999) 83-109 (1998) 235-245

(1998) 69- 84

(1999) 123-135

(1998) 85- 91 (1999) 137- 141

(1998) 31- 43

(1998) 25- 30

Master index of volumes 191-200

Borowiecki, M. and D. Michalak, Generalized independence and domination in graphs

Brenti, F., Kazhdan-Lusztig and R-polynomials from a combinatorial point of view

Breiar, B., On clique-gated graphs (Note) Britto-Pacumio, R.A., Limits of iterated H-line graphs Brousek, J., Minimal 2-connected non-hamiltonian

claw-free graphs Brousek, J., Z. Ryjacek and I. Schiermeyer, Forbidden

subgraphs, stability and hamiltonicity Brousek, J., Z. Ryjacek and 0. Favaron, Forbidden

subgraphs, hamiltonicity and closure in claw-free graphs

Brunat, J.M., M. Maureso and M. Mora, Endocir- culant digraphs: connectivity and generalized cycles

Bucko, J., see P. Mihok Byer, O.D., Two path extremal graphs and an applica-

tion to a Ramsey-type problem Bylka, S., A. Idzik and Z. Tuza, Maximum cuts:

Improvements and local algorithmic analogues of the Edwards-Erdijs inequality

Cameron, P.J., A census of infinite distance-transitive graphs

Carbonara, J.O., A combinatorial interpretation of the inverse t-Kostka matrix

Carini, L. and J.B. Remmel, Formulas for the expansion of the plethysms s~[s(,,~)] and s2 [s(,,k)]

Carmona, A., see C. Balbuena Caughman IV, J.S., The Terwilliger algebras of

bipartite P- and Q-polynomial schemes Chavez, M.J., see R. Ayala Chang, G.J., see S.-C. Liaw Chang, G.J., B. DasGupta, W.M. Dymacek, M. Fiirer,

M. Koerlin, Y.-S. Lee and T. Whaley, Character- izations of bipartite Steinhaus graphs

Chang, G.J. and M.-J. Jou, The number of maximal independent sets in connected triangle-free graphs

Chartrand, G., F. Harary and B.Q. Yue, On the out- domination and in-domination numbers of a digraph

Chen, B.-L., L. Dong, Q.-Z. Liu and K.-C. Huang, Total colorings of equibipartite graphs

Chen, G., R.J. Gould and M.S. Jacobson, On 2-factors containing l-factors in bipartite graphs

7

191 (1998) 51- 56

193 (1998) 93-116 199 (1999) 201-205 199 (1999) l- 10

191 (1998) 57- 64

197/198 (1999) 143-155

196 (1999) 29- 50

197/198 (1999) 157-167 191 (1998) 149-158

196 (1999) 51- 64

194 (1999) 39- 58

192 (1998) ll- 26

193 (1998) 117-145

193 (1998) 147-177 197/198 (1999) 61- 75

196 (1999) 65- 95 194 (1999) 13- 37 196 (1999) 219-227

199 (1999) ll- 25

197/198 (1999) 169-178

197/198 (1999) 179-183

194 (1999) 59- 65

197/198 (1999) 185-194


Chen, G., A. Gyirfas and R.H. Schelp, Vertex colorings with a distance restriction

Chen, B. and S. Zhou, Domination number and neighbourhood conditions

Cheng, C.T. and L.J. Cowen, On the local distinguish- ing numbers of cycles

Chepoi, V. and S. Klaviar, Distances in benzenoid systems: Further developments

Choffrut, C. and M. Goldwurm, Determinants and Mobius functions in trace monoids (Note)

Chou, C.-C., C.-M. Fu and W.-C. Huang, Decom- position of K,, n into short cycles

Cochand, M. and G. Karolyi, On a graph colouring problem (Note)

Conder, M., Explicit definition of the binary reflected Gray codes (Note)

Conforti, M., G. Cornuejols and K. Vuskovic, Balanced cycles and holes in bipartite graphs

Cornuejols, G., see M. Conforti Cowen, L.J., see C.T. Cheng Csakany, R. and J. Komlos, The smallest Ramsey

numbers (Communication) Csizmadia, G., The multiplicity of the two smallest

distances among points Curtin, B., Distance-regular graphs which support

a spin model are thin

DasGupta, B., see G.J. Chang Daven, M. and C.A. Rodger, (k, g)-cages are 3-

connected (Note) Day, D.P., O.R. Oellermann and H.C. Swart, Bounds

on the size of graphs of given order and L- connectivity

Deleglise, M., P. Erdiis and J.-L. Nicolas, Sur les ensembles represent& par les partitions dun entier n

de Werra, D. and A. Hertz, On perfectness of sums of graphs

Deshouillers, J.-M., P. Erdijs and G. Melt?, On a question about sum-free sequences

Desrosiers, J., see 0. du Merle Deza, A., M. Deza and V. Grishukhin, Fullerenes

and coordination polyhedra versus half-cube embeddings

Deza, M., see A. Deza Diatta, J., Approximating dissimilarities by quasi-

ultrametrics

191

195

196

192

194

1971198

194

195

199 (1999) 27- 33 199 (1999) 27- 33 196 (1999) 97- 108

(1998)

(1999)

(1999)

(1998)

(1999)

(1999)

(1999)

(1999)

65- 82

81- 91

97-108

27- 39

239-247

195-203

249-252

245-249

199 (1999) 193-199

194 (1999) 67- 86

197/198 (1999) 205-216

199 (1999) ll- 25

199 (1999) 207-215

197/198 (1999) 217-223

200 (1999) 27- 48

195 (1999) 93-101

200 (1999) 49- 54 194 (1999) 229-237

192 (1998) 41- 80 192 (1998) 41- 80

192 (1998) 81- 86

Mastev index of volumes 191-200 9

Diatta, J. and B. Fichet, Quasi-ultrametrics and their 2-ball hypergraphs

Dinski, T. and X. Zhu, A bound for the game chromatic number of graphs

Dong, L., see B.-L. Chen Dougherty, S.T., T.A. Gulliver and M. Harada,

Optimal ternary formally self-dual codes Drake, D.A., G.H.J. van Rees and W.D. Wallis,

Maximal sets of mutually orthogonal Latin squares

Dror, M., G. Finke, S. Gravier and W. Kubiak, On the complexity of a restricted list-coloring probem

Dujella, A., A bijective proof of Riordan’s theorem on powers of Fibonacci numbers(iVote)

Dunbar, J., S. Hedetniemi, M.A. Henning and A. McRae, Minus domination in graphs

du Merle, O., D. Villeneuve, J. Desrosiers and P. Hansen, Stabilized column generation (Communication)

Dymacek, W.M., see G.J. Chang

Eckhoff, J., The maximum number of triangles in a &-free graph

Egawa, Y. and K. Ota, Vertex-disjoint claws in graphs ErdGs, P., R.J. Faudree, C.C. Rousseau and R.H.

Schelp, The number of cycle lengths in graphs of given minimum degree and girth

ErdGs, P., Z. Ftiredi, B.L. Rothschild and V.T. Sos, Induced subgraphs of given sizes

ErdGs, P. and A. Gyarfas, Split and balanced colorings of complete graphs

ErdGs, P. and R.R. Hall, On the angular distribution of Gaussian integers with fixed norm

ErdGs, P., G. Harcos and J. Path, Popular distances in 3-space

Erdiis, P. and G. Kolesnik, Prime power divisors of binomial coefficients

Erdiis, P., V. Lev, G. Rauzy, C. Sandor and A. Sarkozy, Greedy algorithm, arithmetic progres- sions, subset sums and divisibility

ErdGs, P., J.L. Malouf, J.L. Selfridge and E. Szekeres, Subsets of an interval whose product is a power

ErdGs, P., C. Mauduit and A. Sarkiizy, On arithmetic properties of integers with missing digits II: Prime factors

192 (1998) 87- 102

196 194

196

(1999) (1999)

(1999)

109-115 59- 65

117-135

194 (1999) 87- 94

195

199

199

194 (1999) 229-237 199 (1999) ll- 25

194 (1999) 95- 106 197/198 (1999) 225-246

200 (1999) 55- 60

200 (1999) 61- 77

200 (1999) 79- 86

200 (1999) 87- 94

200 (1999) 95- 99

200 (1999) 101-117

200

200

200 (1999) 149-164

(1999)

(1999)

(1999)

(1999)

(1999)

103- 109

217-220

35- 47

119-135

137- 147


ErdGs, P. and P. Palfy, On the orders of directly indecomposable groups

ErdGs, P. and G. Tenenbaum, Ensembles de multiples de suites finies

200 (1999) 165- 179

ErdGs, P., see B. Bollobas ErdGs, P., see J.A. Bondy ErdGs, P., see M. Deleglise Erdiis, P., see J.-M. Deshouillers Escott, A.E., see S. Perkins Evdokimov, S., M. Karpinski and I. Ponomarenko,

200 (1999) 181-203 200 (1999) 5- 19 200 (1999) 21- 25 200 (1999) 27- 48 200 (1999) 49- 54

1971198 (1999) 637-655

Compact cellular algebras and permutation groups 197/ 198 (1999) 247-267

Fabrega, J., see C. Balbuena Fabrici, I. and S. Jendrol’, Subgraphs with restricted

degrees of their vertices in planar graphs Fajtlowicz, S., see J.A. Bondy Faudree, R.J., see P. Erdos Favaron, O., see J. Brousek Favaron, 0. and J. Puech, Irredundant and perfect

neighborhood sets in graphs and claw-free graphs Fernandez-Merchant, S., see B. Abrego Ferrero, D. and C. Padre, Disjoint paths of bounded

length in large generalized cycles Fichet, B., see J. Diatta Finizio, N.J. and P.A. Leonard, Inductive extensions

of some Z-cyclic whist tournaments Finke, G., see M. Dror Fiol, M.A., see C. Balbuena Fischer, E., Cycle factors in dense graphs Fishburn, P.C. and W.T. Trotter, Split semiorders Fomin, S. and C. Greene, Noncommutative Schur

functions and their applications Fouche, W.L., L.M. Pretorius and C.J. Swanepoel,

Partition theorems for factorisations of ascending parameter words

Fouche, W.L., Symmetries and Ramsey properties of trees

Fricke, G.H., T.W. Haynes, S. Hedetniemi, S.T. Hedetniemi and M.A. Henning, On perfect neighborhood sets in graphs (Note)

Fripertinger, H., Enumeration of mosaics Fu, T.-S., Erdiis-Ko-Rado-type results over J,(n, d),

H,(n, d) and their designs Fu, C.-M., see C.-C. Chou Fiiredi, Z., see P. Erdiis Fiirer, M., see G.J. Chang

1971198 (1999) 61- 75

191 (1998) 83- 90 200 (1999) 21- 25 200 (1999) 55- 60 196 (1999) 29- 50

1971198 (1999) 269-284 194 (1999) l- 11

197/ 198 (1999) 285-298 192 (1998) 87- 102

1971198 (1999) 299-307 195 (1999) 103- 109

197/198 (1999) 61- 75 1971198 (1999) 309-323

195 (1999) 111-126

193 (1998) 179-200

197/198 (1999) 331-350

1971198 (1999) 325-330

199 (1999) 221-225 199 (1999) 49- 60

196 (1999) 137-151 1971198 (1999) 195-203

200 (1999) 61- 77 199 (1999) ll- 25

Master index of volumes 191-200 11

Gao, W., On the number of subsequences with given sum

Gibson, P. and R. Maltby, Posets in which every cutset meets every fibre

Gilbey, J.D. and L.H. Kalikow, Parking functions, valet functions and priority queues

Gillett, S., see D.W. Barnette Gimbert, J., On the existence of (d, k)-digraphs Goddard, W. and M.A. Henning, Real and integer

domination in graphs Goldwurm, M., see C. Choffrut Gould, R.J., see G. Chen Graf, A., Distance graphs and the T-coloring problem Grabiner, D.J., Posets in which every interval is

a product of chains, and natural local actions of the symmetric group

Gravier, S., see M. Dror Greene, C., see S. Fomin Grishukhin, V., see A. Deza Gropp, H., On configurations and the book of

Sainte-LaguC G&troche, A., Ordinal properties of tree distances Gulliver, T.A., see S.T. Dougherty Gulliver, T.A. and M. Harada, Extremal double

circulant Type II codes over Z4 and construction of 5-(24,10, 36) designs

Gupta, P., see B.D. Acharya Gutin, G., B. Sudakov and A. Yeo, Note on

alternating directed cycles Gyarfas, A., see G. Chen Gyarfas, A., see P. Erdiis

195 (1999) 127- 138

194 (1999) 107-127

1971198 (1999) 351-373 195 (1999) 239-243

197/198 (1999) 375-391

199 (1999) 61- 75 194 (1999) 239-247

197/198 (1999) 185-194 196 (1999) 153-166

199 (1999) 77- 84 195 (1999) 103-109 193 (1998) 179-200 192 (1998) 41- 80

191 (1998) 91- 99 192 (1998) 103-117 196 (1999) 117-135

194 195

(1999) 129- 137 (1999) l- 13

191 191 200

(1998) 101-107 (1998) 65- 82 (1999) 79- 86

Haemers, W.H., Minimum resolvable coverings with small parallel classes

Haggard, G. and T.R. Mathies, The computation of chromatic polynomials (Note)

Haiman, M., t, q-Catalan numbers and the Hilbert scheme

Hajiabolhassan, H., M.L. Mehrabadi, R. Tusserkani and M. Zaker, A characterization of uniquely vertex colorable graphs using minimal defining sets (Note)

Hall, R.R., see P. Erdds Han, R., Another cycle structure theorem for

hamiltonian graphs (Note) Hansen, P.. see 0. du Merle

1971198 (1999) 393-396

199 (1999) 227-231

193 (1998) 201-224

199 200

(1999) 233-236 (1999) 87- 94

199 194

(1999) 237-243 (1999) 229-237

12 Master index of volumes I91 -200

Harada, M., see ST. Dougherty Harada, M., see T.A. Gulliver Harant, J., see T. Bijhme Harant, J., see T. Bijhme Harary, F., see G. Chartrand Harborth, H. and S. Maasberg, All two-color Rado

numbers for a(x + y) = bz Harborth, H., Empty triangles in drawings of the

complete graph Harcos, G., see P. Erdas Hare, D.R., see H.L. Abbott Hartnell, B.L. and D.F. Rall, A bound on the size of

a graph with given order and bondage number Haxell, P.E., Packing and covering triangles in graphs

(Note) Haynes, T.W., see G.H. Fricke Hedetniemi, S., see J. Dunbar Hedetniemi, S., see G.H. Fricke Hedetniemi, S.T., see G.H. Fricke Helleseth, T., C. Rong and K. Yang, New infinite

families of 3-designs from preparata codes over Z4 Henning, M.A., see J. Dunbar Henning, M.A., see W. Goddard Henning, M.A., see G.H. Fricke Henning, M.A., Graphs with large restrained

domination number Hertz, A., see D. de Werra Hill, R., see E. Kolev Hirschhorn, M.D. and J.A. Sellers, On representations

of a number as a sum of three squares Hu, Z., A generalization of Fan’s condition and

forbidden subgraph conditions for hamiltonicity Huang, K.-C., see B.-L. Chen Huang, W.-C., see C-C. Chou Huang, Y., Maximum genus and girth of graphs (Note) Huang, Y. and Y. Liu, The maximum genus of graphs

with diameter three Huck, A., Independent branchings in acyclic digraphs

(Note) Hurley, S., see S.M. Allen Huybrechts, C., L . L*-geometries and D,-buildings

Idzik, A., see S. Bylka Ihrig, E., see H. Barcelo Imrich, W., Factoring cardinal product graphs in

polynomial time

196 (1999) 117-135 194 (1999) 129- 137 191 (1998) 25- 30 191 (1998) 31- 43

197/198 (1999) 179-183

197/198

191 (1998) 109-111 200 (1999) 95- 99

197/198 (1999) 3- 13

197/198

195 (1999) 251-254 199 (1999) 221-225 199 (1999) 35- 47 199 (1999) 221-225 199 (1999) 221-225

195 (1999) 139-156 199 (1999) 35- 47 199 (1999) 61- 75 199 (1999) 221-225

197/198 (1999) 415-429 195 (1999) 93- 101

197/198 (1999) 483-489

199 (1999) 85-101

196 (1999) 167- 175 194 (1999) 59- 65

1971198 (1999) 195-203 194 (1999) 253-259

194

199 (1999) 245-249 197/198 (1999) 41- 52 1971198 (1999) 431-451

194 (1999) 39- 58 193 (1998) 61- 78

192 (1998) 119-144

(1999) 397-407

(1999) 409-413

(1999) 139-149


Jacobson, M.S., see G. Chen Jendrol’, S., see I. Fabrici Jendrol’, S., T. Madaras, R. Sot&k and Z. Tuza, On

light cycles in plane triangulations Jendrol’, S., Triangles with restricted degrees of their

boundary vertices in plane triangulations Jiang, Z., see V. Linek Jou, M.-J., see G.J. Chang

1971198 (1999) 185-194 191 (1998) 83- 90

197/ 198 (1999) 453-467

196 (1999) 177- 196 196 (1999) 229-238

197/198 (1999) 169- 178

Kabil, M. and M. Pouzet, Injective envelope of graphs and transition systems

Kageyama, S., see Y. Miao Kalikow, L.H., see J.D. Gilbey Kgrolyi, G., see M. Cochand Karpinski, M., see S. Evdokimov Karzanov, A.V., On one maximum multiflow problem

and related metrics Kashiwagi, Y. and I. Kikumasa, Indecomposability of

cyclic codes (Note)

192 (1998) 145-186 195 (1999) 269-276

197/198 (1999) 351-373 194 (1999) 249-252

1971198 (1999) 247-267

192 (1998) 187-204

196 (1999) 277-280 Kelmans, A. and X. Yong, On the distribution of

eigenvalues of graphs (Note) Kemnitz, A. and H. Kolberg, Coloring of integer dis-

tance graphs KCzdy, A.E. and C. Wang, Alternating walks in par-

tially 2-edge-colored graphs and optimal strength of graph labeling (Note)

Kikumasa, I., see Y. Kashiwagi Kingan, S.R., Intersections of circuits and cocircuits in

binary matroids

199

191

194 (1999) 261-265 196 (1999) 277-280

195 (1999) 157- 165 192 (1998) 27- 39

(1999) 251-258

(1998) 113-123

Klaviar, S., see V. Chepoi Klazar, M., Extremal problems for colored trees and -

Davenport-Schinzel sequences Klin, M., see A. Betten Knopfmacher, A., On the degrees of irreducible factors

of polynomials over a finite field Koerlin, M., see G.J. Chang Kolberg, H., see A. Kemnitz Kolesnik, G., see P. Erdiis Kolev, E. and R. Hill, An improved lower bound on

the covering number K2 (9, 1) Komjith, P., Some remarks on universal graphs (Note) Koml6s, J., see R. Csbkiny Koolen, J., V. Moulton and U. Tiinges, The coherency

index Kordecki, W. and T. tuczak, On the connectivity of

random subsets of projective spaces

197/ 198 (1999) 469-482 197/198 (1999) 83-109

196 (1999) 197-206 199 (1999) ll- 25 191 (1998) 113-123 200 (1999) 101-117

197/ 198 (1999) 483-489 199 (1999) 259-265 199 (1999) 193- 199

192 (1998) 205-222

196 (1999) 207-217

14 Masier index of volumes I91 -200

Kostochka, A.V., see O.V. Borodin Kostochka, A.V. and M. Stiebitz, Colour-critical

graphs with few edges Kratochvil, J., Zs. Tuza and M. Voigt, Complexity of

choosing subsets from color sets Kubiak, W., see M. Dror Larrion, F. and V. Neumann-Lara, Clique divergent

graphs with unbounded sequence of diameters

191

191

191 (1998) 139- 148 195 (1999) 103-109

197/ 198

Laue, R., see A. Betten Laue, R., see A. Betten Laviolette, F. and N. Polat, Spanning trees of

countable graphs omitting sets of dominated ends

1971198 (1999) 83- 109 1971198 (1999) 111-121

194 Lazebnik, F., V.A. Ustimenko and A.J. Woldar,

Polarities and 2k-cycle-free graphs Leclerc, B. and V. Makarenkov, On some relations

between 2-trees and tree metrics Lee, Y.-S., see G.J. Chang Leo, J.W., Triads and triangles in 3-connected

matroids

1971198

192 (1998) 223-249 199 (1999) ll- 25

Leonard, P.A., see N.J. Finizio Lev, V., see P. ErdBs Levenshtein, V.I., Equivalence of Delsarte’s bounds

for codes and designs in symmetric association schemes, and some applications

Levenshtein, V., On designs in compact metric spaces and a universal bound on their size

Lewis, R.P., The number of spanning trees of a complete multipartite graph

Li, J.-S. and Z.-X. Song, On the potentially Pk-graphic sequences (Note)

Li, Y., see Z. Zhang Liaw, S.-C. and G.J. Chang, Rabin numbers of

Butterfly networks Linek, V. and Z. Jiang, Hooked k-extended Skolem

sequences

194 (1999) 173- 193 1971198 (1999) 299-307

200 (1999) 119-135

197/ 198

192

197/198

195 (1999) 255-262 195 (1999) 295-298

196

Liu, L., see Z. Zhang Liu, Q.-Z., see B.-L. Chen Liu, Y., see Y. Huang Lou, D., A local independence number condition for

196 (1999) 229-238 195 (1999) 295-298 194 (1999) 59- 65 194 (1999) 139-149

n-extendable graphs (Note) 195 tuczak, T., see W. Kordecki 196

Maasberg, S., see H. Harborth Madaras, T., see S. Jendrol’

197/ 198 (1999) 397-407 1971198 (1999) 453-467

(1998) 45- 49

(1998) 125-137

(1999) 491-501

(1999) 151-172

(1999) 503-513

(1999) 515-536

(1998) 251-271

(1999) 537-541

(1999) 219-227

(1999) 263-268 (1999) 207-217


Maehara, H., Embedding a set of rational points in lower dimensions

Mahmoodian, E.S. and E. Mendelsohn, On defining numbers of vertex colouring of regular graphs

Makarenkov, V., see B. Leclerc Malouf, J.L., see P. Erdiis Maltby, R., Every cutset meets every fibre in certain

poset products Maltby, R., see P. Gibson Malvenuto, C. and C. Reutenauer, Plethysm and con-

jugation of quasi-symmetric functions Marquez, A., see R. Ayala Mar&Fart%, J., Sets defining minimal vertex covers Martini, H. and P. Soltan, On convex partitions of

polygonal regions Mathies, T.R., see G. Haggard Mauduit, C., see P. Erdiis Maureso, M., see J.M. Brunat Mazoyer, J. and I. Rapaport, Global fixed point

attractors of circular cellular automata and periodic tilings of the plane: Undecidabihty results

McDiarmid, C. and B. Reed, Colouring proximity graphs in the plane

McRae, A., see J. Dunbar McSorley, J.P., Single-change circular covering

designs Mehrabadi, M.L., see H. Hajiabolhassan Melt?, G., see J.-M. Deshouillers Melter, R.A., see F. Rhodes Mendelsohn, E., see E.S. Mahamoodian Miao, Y. and S. Kageyama, Two classes of q-ary codes

based on group divisible association schemes (Note)

Michalak, D., see M. Borowiecki Mihok, P., J. Bucko and M. Voigt, On uniquely

partitionable planar graphs Miller, M., see M. Sutton Milne, S.C. and G. Bhatnagar, A characterization of

inverse relations Minoux, M., A generalization of the all minors matrix

tree theorem to semirings Monjardet, B., On the comparison of the Spearman

and Kendall metrics between linear orders Monson, S.D., see L.B. Beasley Mora, M., see J.M. Brunat Moulton, V., see J. Koolen

192 (1998) 273-279

1971198 (1999) 543-554 192 (1998) 223-249 200 (1999) 137- 147

194 (1999) 195-203 194 (1999) 107-127

193 (1998) 225-233 194 (1999) 13- 37

197/198 (1999) 555-559

195 (1999) 167- 180 199 (1999) 227-231 200 (1999) 149- 164

1971198 (1999) 157-167

199 (1999) 103-122

199 (1999) 123- 137 199 (1999) 35- 47

197/ 198 (1999) 561-588 199 (1999) 233-236 200 (1999) 49- 54 194 (1999) 267-279

197/198 (1999) 543-554

195 (1999) 269-276 191 (1998) 51- 56

191 (1998) 149- 158 195 (1999) 287-293

193

199

192 (1998) 281-292 195 (1999) 53- 66

197/ 198 (1999) 157- 167 192 (1998) 205-222

(1998) 235-245

(1999) 139-150


Muthusamy, A. and P. Paulraja, Path factorizations of complete multipartite graphs

Muzychuk, M., On the isomorphism problem for cyclic combinatorial objects

195 (1999) 181-201

1971198 (1999) 589-606

Nakamoto, A., Transformations in closed 2-cell embeddings on surfaces preserving specified properties

Neumann-Lara, V., The acyclic disconnection of a digraph

1971198

197/ 198 Neumann-Lara, V., E. Rivera-Campo and J. Urrutia,

A note on covering the edges of a graph with bonds 197/ 198 Neumann-Lara, V., see B. Abrego 194 Neumann-Lara, V., see F. Larrion 197/ 198 Nicolas, J.-L., see M. Deleglise 200

(1999) 607-615

(1999) 617-632

(1999) 633-636 (1999) l- 11 (1999) 491-501 (1999) 27- 48

1971198 (1999) 217-223 1971198 (1999) 137-141

195 (1999) 203-227 197/198 (1999) 225-246

Oellermann, O.R., see D.P. Day O’Keefe, C.M., see A. Blokhuis Oporowski, B., Minor-equivalence for infinite graphs Ota, K., see Y. Egawa

Path, J., see P. Erdiis Padre, C., see D. Ferrer0 Palfy, P., see P. ErdGs Panda, B.S., The forbidden subgraph characterization

of directed vertex graphs Paulraja, P., see A. Muthusamy Pavcevic, M.-O. and E. Spence, Some new symmetric

designs with /z = 10 having an automorphism of order 5

Perkins, S. and A.E. Escott, Synchronizing codewords of q-ary Huffman codes

Phillips, N.C.K. and D.A. Preece, Tight single-change covering designs with v = 12, k = 4

Plummer, M.D., see R.E.L. Aldred Polat, N. see F. Laviolette Ponomarenko, I., see S. Evdokimov Pouzet, M., A projection property and Arrow’s impos-

sibility theorem Pouzet, M., see M. Kabil Preece, D.A. and B.J. Vowden, Some series of cyclic

balanced hyper-Graeco-Latin superimpositions of three Youden squares

Preece, D.A., see N.C.K. Phillips Preece, D.A., see D.H. Rees Pretorius, L.M., see W.L. Fouche Pruchnewski, A., see T. Biihme

200 (1999) 95- 99 197/ 198 (1999) 285-298

200 (1999) 165- 179

196 (1999) 239-256 195 (1999) 181-201

196 (1999) 257-266

197/198 (1999) 637-655

197/ 198 (1999) 657-670 1971198 (1999) 29- 40

194 (1999) 151-172 1971198 (1999) 247-267

192 (1998) 293-308 192 (1998) 145- 186

197/ 198 (1999) 671-682 1971198 (1999) 657-670 197/198 (1999) 691-712 197/ 198 (1999) 331-350

191 (1998) 31- 43

Master index of volumes I91 - 200 17

Puech, J., see 0. Favaron Pullman, N.J., see L.B. Beasley

Qian, J., On the upper bound of the diameter of interchange graphs (Note)

Quilliot, A., On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties

Quintero, A., see R. Ayala

Rail, D.F., see B.L. Hartnell Randerath, B. and L. Volkmann, Characterization of

graphs with equal domination and covering number

Rapaport, I., see J. Mazoyer Rautenbach, D., The influence of special vertices on

strong domination Rauzy, G., see P. Erdiis Reed, B., see C. McDiarmid Rees, D.H. and D.A. Preece, Perfect Graeco-Latin

balanced incomplete block designs (pergolas) Reiner, E., Variation on a theme of Solomon Remmel, J.B. and M. Shimozono, A simple proof of

the Littlewood-Richardson rule and applications Remmel, J.B., see L. Carini Reutenauer, C., see C. Malvenuto Rhodes, F. and R.A. Melter, Geodetic metrizations of

graphs (Note) Riordan, O., see B. Bollobas Rivera-Campo, E., see V. Neumann-Lara Rodger, C.A., see M. Daven Rodriguez, J.A. and J.L.A. Yebra, Bounding the

diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods

Rong, C., see T. Helleseth Rota, G.-C., Combinatorics, representation theory

and invariant theory: The story of menage a trois (Inaugural address delivered at Taormina, Italy, 26 July, 1994)

Rothschild, B.L., see P. ErdGs Rousseau, C.C., see P. ErdGs Ryan, J., see M. Sutton Ryjacek, Z., see B. Bollobas Ryjacek, Z., see J. Brousek

197/198 (1999) 269-284 195 (1999) 53- 66

195 (1999) 277-285

192 (1998) 309-322 194 (1999) 13- 37

1971198

191 (1998) 159- 169 199 (1999) 103- 122

1971198 (1999) 683-690 200 (1999) 119-135 199 (1999) 123-137

1971198 (1999) 691-712 193 (1998) 247-255

193 (1998) 257-266 193 (1998) 147- 177 193 (1998) 225-233

194 (1999) 267-279 195 (1999) 67- 80

1971198 (1999) 633-636 199 (1999) 207-215

196 (1999) 267-275 195 (1999) 139-156

193 (1998) 5- 16 200 (1999) 61- 77 200 (1999) 55- 60 195 (1999) 287-293 195 (1999) 67- 80

1971198 (1999) 143- 155

(1999) 409-413


Ryjacek, Z. and I. Schiermeyer, 2-factors and hamiltonicity

Ryjacek, Z., see J. Brousek

Sachs, H., Preface Saito, A., see B. Bollobas Sandor, C., see P. ErdGs Sarkozy, A., see P. Erdiis Sarkiizy, A., see P. Erdiis Sarkar, A., see B. Bollobas Sarkozy, G.N., see A.C. Atkins Sarmiento, I., A characterisation of jointless Dowling

geometries

191 (1998) 171-177 196 (1999) 29- 50

191 (1998) l- 2 195 (1999) 67- 80 200 (1999) 119-135 200 (1999) 119-135 200 (1999) 149- 164 200 (1999) 5- 19 195 (1999) 235-237

197/ 198 Schelp, R.H., see B. Bollobas Schelp, R.H., see P. Erdas Schelp, R.H., see G. Chen Schelten, U., see A. Schelten Schelten, A. and I. Schiermeyer, Ramsey numbers

195 (1999) 200 (1999) 191 (1998) 191 (1998)

(1999) 713-731 67- 80 55- 60 65- 82

179-189

r(Ks,G)forG~K~-2P,andGgK,-3P2 Schelten, A. and U. Schelten, Neighborhood

191 (1998) 191-196

conditions for graphs with induced claws Schiermeyer, I., see T. Bohme Schiermeyer, I., see J. Brousek Schiermeyer, I., see Z. Ryjacek Schiermeyer, I., see A. Schelten Schmid, J., On maximal sublattices of finite lattices Schroth, A.E., How to draw a hexagon Selfridge, J.L., see P. ErdGs Selkow, S.M., see A.C. Atkins Sellers, J.A., see M.D. Hirschhorn Serfati, M., The lattice theory of r-ordered partitions Shaw, R., A property of AT, and a maximal 3-

dimensional linear section of GL(4, 2) Shimozono, M., see J.B. Remmel Shpectorov, S., Complementary II-graphs Slamin, see M. Sutton Smith, D.H., see S.M. Allen Smutny, P. and M. TkaTkac, On cubic polyhedral

graphs with prescribed adjacency properties of their faces

Sole, P. and J.-P. Tillich, On the dual distance and the gap of a binary code

Soltan, P., see H. Martini Song, Z.-X., see J.-S. Li Sonnino, A., Linear collineation groups preserving an

arc in a Mobius plane

191 (1998) 179-189 191 (1998) 31- 43

197/198 (1999) 143-155 191 (1998) 171-177 191 (1998) 191-196 199 (1999) 151-159 199 (1999) 161-171 200 (1999) 137- 147 195 (1999) 235-237 199 (1999) 85- 101 194 (1999) 205-227

1971198 (1999) 733-747 193 (1998) 257-266 192 (1998) 323-331 195 (1999) 287-293

197/198 (1999) 41- 52

191

192 (1998) 333-336 195 (1999) 167- 180 195 (1999) 255-262

197/198

(1998) 197-206

(1999) 749-757


Sos, V.T., see P. Erdijs Sotak, R., see S. Jendrol’ Spence, E., see M.-O. Pavcevic Stanley, R.P., Graph colorings and related symmetric

functions: ideas and applications A description of results, interesting applications, & notable open problems

Stiebitz, M., see A.V. Kostochka Sudakov, B., see G. Gutin Sutton, M., M. Miller, J. Ryan and Slamin, Connected

graphs which are not mod sum graphs (Note) Swanepoel, C.J., see W.L. Fouche Swanepoel, K.J., Cardinalities of k-distance sets in

Minkowski spaces Swart, H.C., see D.P. Day Szekeres, E., see P. ErdGs

Tenenbaum, G., see P. Erdiis Tewes, M. and L. Volkmann, Vertex deletion and

cycles in multipartite tournaments Thatte, B.D., A reconstruction problem related to

balance equations - II: The general case (Note) Tillich, J.-P., see P. Sole Tkac, M., see P. Smutnji Tonges, H., see J. Koolen Topp, J., P.D Vestergaard, Interpolation theorems for

domination numbers of a graph Treml, M., Some partitions of positive integers (Note) Trommel, H., H.J. Veldman and A. Verschut,

Pancyclicity of claw-free hamiltonian graphs Trotter, W.T., see P.C. Fishburn Tusserkani, R., see H. Hajiabolhassan Tuza, Z., see S. Bylka Tuza, Z., see S. Jendrol’ Tuza, Zs., see J. Kratochvil

Urrutia, J., see V. Neumann-Lara Ushio, K., $k-factorization of symmetric complete

tripartite digraphs Ushio, K., Cycle-factorization of symmetric complete

multipartite digraphs (Note) Ustimenko, V.A., see F. Lazebnik

van Rees, G.H.J., see D.A. Drake Varone, S.C., Trees related to realizations of distance

matrices

200 (1999) 61- 77 197/198 (1999) 453-467

196 (1999) 257-266

193 (1998) 267-286 191 (1998) 125-137 191 (1998) 101-107

195 (1999) 287-293 197/198 (1999) 331-350

197/198 (1999) 759-767 197/198 (1999) 217-223

200 (1999) 137-147

200 (1999) 181-203

197/198 (1999) 769-779

194 (1999) 281-284 192 (1998) 333-336 191 (1998) 197-206 192 (1998) 205-222

191 (1998) 207-221 199 (1999) 267-271

197/198 (1999) 781-789 195 (1999) 111-126 199 (1999) 233-236 194 (1999) 39- 58

197/198 (1999) 453-467 191 (1998) 139-148

197/198 (1999) 633-636

197/198 (1999) 791-797

199 (1999) 273-278 197/198 (1999) 503-513

194 (1999) 87- 94

192 (1998) 337-346


Veldman, H.J., see H. Trommel Verschut, A., see H. Trommel Vestergaard, P.D., see J. Topp Villeneuve, D., see 0. du Merle Voigt, M., see J. Kratochvil Voigt, M., see P. Mihok Volkmann, L., see B. Randerath Volkmann, L., see M. Tewes Volkmann, L., Longest paths in semicomplete

multipartite digraphs (Note)

1971198 (1999) 781-789 197/198 (1999) 781-789

191 (1998) 207-221 194 (1999) 229-237 191 (1998) 139- 148 191 (1998) 149- 158 191 (1998) 159-169

197/198 (1999) 769-779

199 Voss, H.-J., Sachs triangulations and infinite

sequences of regular maps on given type Vowden, B.J., see D.A. Preece Vuskovic, K., see M. Conforti

191 1971198

199

Wachs, M.L., On the (co)homology of the partition lattice and the free Lie algebra

Wallis, W.D., see D.A. Drake Wang, C., see A.E. Kezdy Wassermann, A., see A. Betten Wassermann, A., see A Betten Wei, R., see A.M. Assaf Wessel, W., A short solution of Heawood’s empire

193 (1998) 287-319 194 (1999) 87- 94 194 (1999) 261-265

1971198 (1999) 83- 109 1971198 (1999) 111-121

195 (1999) 15- 25

problem in the plane 191 Whaley, T., see G.J. Chang 199 Whitaker, R.M., see D. Bedford 1971198 Wojcik, P., Union-closed families of sets 199 Woldar, A.J., see F. Lazebnik 1971198 Woodall, D.R., see O.V. Borodin 191

Xu, B., On integral sum graphs (Note) Xu, B. and Z. Zhang, On mixed Ramsey numbers

194

(Note) Xu, B., see Z. Zhang

199 195

Xu, R., Some Ore-type conditions for the existence of connected [2, k]-factors in graphs 194

Yang, K., see T. Helleseth Yang, Z., On F-Hamiltonian graphs (Note) Yebra, J.L.A., see J.A. Rodriguez Yeo, A., see G. Gutin Yong, X., see A. Kelmans Yue, B.Q., see G. Chartrand

195 (1999) 139-156 196 (1999) 281-286 196 (1999) 267-275 191 (1998) 101-107 199 (1999) 251-258

197/198 (1999) 179- 183

Zaker, M., see H. Hajiabolhassan Zang, W., Acyclic digraphs with the Gallai-Milgram-

Linial property for clique-covers

199

199

(1999) 279-284

(1998) 223-240 (1999) 671-682 (1999) 27- 33

(1998) 241-245 (1999) ll- 25 (1999) 77- 81 (1999) 173-182 (1999) 503-513 (1998) 45- 49

(1999) 281-284

(1999) 285-289 (1999) 295-298

(1999) 295-298

(1999) 233-236

(1999) 183- 192


Zhang, Z., A kind of bionomial identity (Note) Zhang, Z., A binomial identity related to Calkin’s

(Note) Zhang, Z., B. Xu, Y. Li and L. Liu, A note on the lower

bounds of signed domination number of a graph (Note)

Zhang, Z., see B. Xu Zhou, S., A sequential coloring algorithm for finite

sets (Note) Zhou, S., see B. Chen Zhu, X., see T. Dinski

196 (1999) 291-298

196 (1999) 287-289

195 (1999) 295-298 199 (1999) 285-289

199 (1999) 291-297 195 (1999) 81- 91 196 (1999) 109-115

Documents

List of referees: volumes 191-200 - COnnecting REpositories · 2017-02-25 · List of referees: volumes 191-200 DISCRETE MATHEMATICS has continuously benefitted from the kind assistance