master index of volumes 71-80 index of volumes 71-80 abhyankar, ... decomposability of irreducibles...

MASTER INDEX OF VOLUMES 71-80

Abhyankar, S.S. and D.M. Kulkarni, Bijection between indexed monomials and standard bi- tableaux (Invited Paper)

Abu-Sbeih, M.Z., Generalizing the duality theorem of graph embeddings

Aharoni, R., R. Manber and B. Wajnryb, Special parity of perfect matching graphs

Aigner, M.S., The double selection problem Akiyama, J., F. Nakada and S. Tokunaga, Pack-

ing smaller graphs into a graph Alavi, Y., F. Buckley, M. Shamula and S. Ruiz,

Highly irregular m-chromatic graphs Albertson, M.O., R.E. Jamison, S.T. Hedetniemi

and S.C. Locke, The subchromatic number of a

graph Aldous, D., The harmonic mean formula for

probabilities of unions: applications to sparse random graphs

Algor, I. and N. Alon, The star arboricity of graphs

Alon, N., Sums of subsequences modulo prime powers (Communication)

Alon, N., see Algor, I. Alon, N. and B. Bollobas, Graphs with a small

number of distinct induced subgraphs Alon, N. and F.R.K. Chung, Explicit construction

of linear sized tolerant networks Alspach, B., T.D. Parsons, List of publications Alspach, B., Lifting Hamilton cycles of quotient

graphs Arasu, K.T., Cyclic affine planes of even order Arnborg, S., A. Proskurowski and D.G. Corneil,

Forbidden minors characterization of partial 3-trees

Assaf, A.M. and A. Hartman, Resolvable group divisible designs with block size 3

79 (1989/90) 1

78 (1989) 11

79 (1989/90) 221 73 (1989) 3

75 (1989) 7

72 (1988) 3

74 (1989) 33

76 (1989) 167

75 (1989) 11

71(1988) 87 75 (1989) 11

75 (1989) 23

72 (1988) 15 78 (1989) 7

78 (1989) 25 76 (1989) 177

80 (1990) 1

77 (1989) 5

6 Master Index of Volumes 71-80

Assaf, A.M. and A. Hartman, On packing designs with block size 5 and index 4 79 (1989/90) 111

Atkinson, M.D., A. Negro and N. Santoro, Sums of lexicographically ordered sets 80 (1980) 115

Azzena, L. and F. Piras, Incidence algebras and coalgebras of decomposition structures 79 (1989/90) 123

Baartmans, A.H. and W.D. Wallis, Indecom- posable factorizations of multigraphs

BankoviC, D., Some remarks on the number of parameters of the solutions of Boolean equations

Barbut, E. and A. Bialostocki, A generalization of rotational tournaments

Barthelemy, J.P., From copair hypergraphs to median graphs with latent vertices

Batagelj, V., An inductive definition of the class of 3-connected quadrangulations of the plane

Batten, L.M., Minimally projectively embeddable Steiner systems

Bauer, D., A. Morgana and E.F. Schmeichel, A simple proof of a theorem of Jung

Bauer, D., H.J. Veldman, A. Morgana and E.F. Schmeichel, Long cycles in graphs with large degree sums

Beck, J., Balanced two-colorings of finite sets in the cube

Behrendt, G., Covering posets Ben-Arroyo Hartman, I., Variations on the

Gallai-Milgram theorem Bennett, F.E., The spectra of a variety of quasi-

groups and related combinatorial designs Bennett, M.K., Rectangular products of lattices Benzait, A. and B. Voigt, A combinatorial inter-

pretation of (l/k!) A9 Berardi, L., Constructing 3-designs from spreads

and lines (Note) Berge, C., Minimax relations for the partial q-

colorings of a graph Bermond, J.-C., K. Berrada and J. Bond, Exten-

sions of networks with given diameter Berrada, K., see Bermond, J.-C.

78 (1989) 37

79 (1989/90) 229

76 (1989) 81

76 (1989) 9

78 (1989) 45

77 (1989) 21

79 (1989/90) 147

79 (1989/90) 59

73 (1989) 13 71(1988) 189

71(1988) 95

77 (1989) 29 79 (1989/90) 235

73 (1989) 27

74 (1989) 331

74 (1989) 3

75 (1989) 31 75 (1989) 31

Master Index of Volumes 71-80

Berstel, J., M. Crochemore and J.E. Pin, Thue- Morse sequence and p-adic topology for the free monoid

Bialostocki, A., see Barbut, E. Biggs, N., Confluence of some presentations as-

sociated with graphs Biggs, N.L., A proof of Serre’s theorem Biliotti, M., On a construction of clay of BIB

designs from Frobenius groups (Note) Billington, E.J., New cyclic (61, 244, 40, 10, 6)

BIBDs (Note) Blokhuis, A., A.E. Brouwer and H.A. Wilbrink,

Heden’s bound on maximal partial spreads (Note)

Boicescu, V., Irredundant n-valued Moisil algebras

Bollobas, B., Sorting in rounds Bollobas, B., Preface Bollobas, B., Paul Erdos at Seventy-Five Bollobas, B., see Alon, N. Bollobas, B. and G. Brightwell, Long cycles in

graphs with no subgraphs of minimal degree 3 Bollobas, B. and H.R. Hind, A new upper bound

for the list chromatic number Bollobas, B. and S. Rasmussen, First cycles in

random directed graph processes Bond, J., see Bermond, J.-C. Bondy, A., Trigraphs Boros, E. and P.L. Hammer, On clustering prob-

lems with connected optima in Euclidean spaces Borwein, D., S. Rankin and L. Renner, Enume-

ration of injective partial transformations (Communication)

Bouchet, A., Maps and A-matroids Brand, N.E., Isomorphisms of cyclic com-

binatorial objects Brand, N.E., On the Bays-Lambossy Theorem Brawley, J.V. and L. Carlitz, A test for additive

decomposability of irreducibles over a finite field (Note)

Bressoud, D.M., Problems on the Z-statistic Brigham, R.C., see Dutton, R.D.

76 (1989) 89 76 (1989) 81

75 (1989) 41 78 (1989) 55

74 (1989) 333

77 (1989) 51

74 (1989) 335

71(1988) 197 72 (1988) 21 75 (1989) 1 75 (1989) 3 75 (1989) 23

75 (1989) 47

74 (1989) 65

75 (1989) 55 75 (1989) 31 75 (1989) 69

75 (1989) 81

73 (1989) 291 78 (1989) 59

78 (1989) 73 78 (1989) 217

76 (1989) 61 73 (1989) 37 76 (1989) 191


Brightwell, G., see Bollobas, B. Brouwer, A.E., A unital in the Hughes plane of

order nine (Note) Brouwer, A.E., see Blokhuis, A. Brown, J.I., D. Kelly, J. Schonheim and R.E.

Woodrow, Graph coloring satisfying restraints Brualdi, R.A. and R. Manber, On strong digraphs

with a unique minimally strong subdigraph Buckley, F., see Alavi, Y. Bussemaker, F.C. and V.D. Tonchev, New ex-

tremal doubly-even codes of length 56 derived from Hadamard matrices of order 28 (Communication)

Cameron, J., Some sequence of integers Cameron, K., A min-max relation for the partial

q-colourings of a graph. Part II: Box perfection Cammack, L., see Schrag, G. Carlitz, L., see Brawley, J.V. Catlin, P.A., Spanning Eulerian subgraphs and

matchings CepuliC, V. and M. Essert, Biplanes (56, 11, 2)

with automorphisms of order 4 fixing some point Chan, T-H., Nondecreasing subsequences of t-

sequences (Note) Chandrasekaran, R. and S.N. Kabadi, Pseudo-

matroids Charpin, P., Codes cycliques Ctendus affines-

invariants et antichaines d’un ensemble par- tiellement ordonne

Chen, C.C., On edge-hamiltonian property of Cayley graphs

Chen, R-S., see Zhang Fu-ji Chen, Y-C., A short proof of Kundu’s k-factor

theorem (Note) Chetwynd, A.G. and A.J.W. Hilton, l-Factorizing

regular graphs of high degree - an improved bound

Chung, F.R.K., see Alon, N. Chung, F.R.K. and P.D. Seymour, Graphs with

small bandwidth and cutwidth Clark, W.E., L.A. Dunning and D.G. Rogers,

Binarv set functions and naritv check matrices

75 (1989) 47

77 (1989) 55 74 (1989) 335

80 (1990) 123

71(1988) 1 72 (1988) 3

76 (1989) 45

75 (1989) 89

74 (1989) 15 78 (1989) 169 76 (1989) 61

76 (1989) 95

71(1988) 9

79 (1989/90) 215

71(1988) 205

80 (1990) 229

72 (1988) 29 72 (1988) 405

71(1988) 177

75 (1989) 103 72 (1988) 15

75 (1989) 113

80 (1990) 249

Master Index of Volumes 71-80 9

Cockayne, E.J., S.T. Hedetniemi and R. Laskar, Gallai theorems for graphs, hypergraphs, and set systems

Cockayne, E.J. and C.M. Mynhardt, On the product of upper irredundance numbers of a graph and its complement

Colbourn, C.J., Edge-packings of graphs and network reliability

Colbourn, C.J., see El-Mallah, E.S. Colbourn, C.J. and V. Riidl, Percentages in pair-

wise balanced designs Cordova, J., see Dejter, I.J. Cordovil, R. and P. Duchet, On sign-invariance

graphs of uniform oriented matroids Corneil, D.G., see Arnborg, S. Crochemore, M., see Berstel, J. Curran, D.J. and S.A. Vanstone, Doubly resolv-

able designs from generalized Bhaskar Rao designs

Damerell, R.M., C. Roos and A.J. van Zanten, On the existence of certain generalized Moore geometries, V

Danzer, L., Three-dimensional analogs of the planar Penrose tilings and quasicrystals (Invited Paper)

Dehnhardt, K. and H. Harborth, Universal tilings of the plane by O-l-matrices

Dejter, I.J., J. Cordova and J.A. Quintana, Two hamilton cycles in bipartite reflective Kneser graphs

Deng, C-L. and C-K. Lim, A result on generalized Latin rectangles

de Resmini, M.J., On complete arcs in Steiner systems S(2, 3~) and S(2, 4~)

De Simone, C., The cut polytope and the Boolean quadric polytope

de Werra, D., see Hertz, A. Deza, M., see Hamada, N. Deza, M., see Hamada, N. Deza, M., see Laurent, M. Diestel, R., Tree-decompositions, tree-represent-

ability and chordal graphs (Note)

72 (1988) 35

76 (1989) 117

72 (1988) 49 80 (1990) 21

77 (1989) 57 72 (1988) 63

79 (1989/90) 251 80 (1990) 1 76 (1989) 89

73 (1989) 49

76 (1989) 183

76 (1989) 1

73 (1989) 65

72 (1988) 63

72 (1988) 71

77 (1989) 65

79 (1989/90) 71 74 (1989) 51 71(1988) 219 77 (1989) 75 75 (1989) 279

71(1988) 181


Diestel, R., Simplicial decompositions of graphs: A survey of applications

Dietrich, B.L., Matroids and antimatroids - A survey

Duchamp, G. and J.Y. Thibon, Le support de l’algebre de Lie libre

Duchet, P., On locally-perfect colorings Duchet, P., see Cordovil, R. Dunning, L.A., see Clark, W.E. Dutton, R.D. and R.C. Brigham, On the size of

graphs of a given bandwidth Duvdevani, N. and A.S. Fraenkel, Properties of

K-Welter’s game

Eidswick, J.A., Short factorizations of permutations into transpositions

Eliad-Badt, E., Decomposition of the complete hypergraph into stars

El-Mallah, E.S. and C.J. Colbourn, On two dual classes of planar graphs

Emamy-K., M.R. and L. Lazarte, On the cut- complexes of the 5-cube

Engelhardt, E., V. Klee, K. Li and H. Quaife, Minimum graphs of specified diameter, connectivity and valence. II

ErdBs, P., Problems and results in combinatorial analysis and graph theory

Erdiis, P. and A. Hajnal, On the number of distinct induced subgraphs of a graph

Erdos, P., R.J. Faudree and E.T. Ordman, Clique partitions and clique coverings

ErdBs, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, Extremal theory and bipartite graph- tree Ramsey numbers

Erdiis, P., J.L. Nicolas and A. Sarkozy, On the number of partitions of n without a given subsum (I)

Essert, M., see CepuliC, V. Exoo, G. and D.F. Reynolds, Ramsey numbers

based on CS-decompositions

75 (1989) 121

78 (1989) 223

76 (1989) 123 74 (1989) 29

79 (1989/90) 251 80 (1990) 249

76 (1989) 191

76 (1989) 197

73 (1989) 239

71(1988) 107

80 (1990) 21

78 (1989) 239

78 (1989) 257

72 (1988) 81

75 (1989) 145

72 (1988) 93

72 (1988) 103

75 (1989) 155 71(1988) 9

71(1988) 119

Fajtlowicz, S., On conjectures of Graffiti 72 (1988) 113


Farber, M., Basis pair graphs of transversal matroids are connected

Farber, M., On diameters and radii of bridged graphs

Farr, G., The subgraph homeomorphism problem for small wheels

Faudree, R.J., A. Gyarfas, R.H. Schelp and Z. Tuza, Induced matchings in bipartite graphs

Faudree, R.J., M.S. Jacobson, R.H. Schelp and J. Lehel, Irregular networks, regular graphs and integer matrices with distinct row and column sums

Faudree, R.J., C.C. Rousseau and R.H. Schelp, Small order graph-tree Ramsey numbers

Faudree, R.J., see Erdiis, P. Faudree, R.J., see Erd&, P. Fellows, M., see Kleitman, D.J. Fishburn, P.C. and W.V. Gehrlein, The three-

permutations problem Fishburn, P.C. and N.J.A. Sloane, The solution to

Berlekamp’s switching game Fisher, P.H., T. Penttila and G.F. Royle, Sym-

metric designs, polarities and sub-designs Flach, P. and L. Volkmann, Estimations for the

domination number of a graph Flajolet, P., D.E. Knuth and B. Pittel, The first

cycles in an evolving graph Foo, M.F., see Teh, H.H. Foulds, L.R. and R.W. Robinson, Enumerating

phylogenetic trees with multiple labels Fouquet, J-L. and H. Thuillier, On some conjec-

tures on cubic 3-connected graphs Fraenkel, A.S., see Duvdevani, N. Fraisse, P., A note on distance-dominating cycles

(Note) Fraisse, P. and 0. Ordaz, A Chvatal-Erdiis con-

dition for (t, t)-factors in digraphs using given arcs

Frank, O., Triad count statistics Frankl, P., A lower bound on the size of a

complex generated by an antichain (Communication)

Fuji-Hara, R., S. Kuriki and M. Jimbo, On

73 (1989) 245

73 (1989) 249

71(1988) 129

78 (1989) 83

76 (1989) 223

72 (1988) 119 72 (1988) 93 72 (1988) 103 73 (1989) 119

79 (1989/90) 259

74 (1989) 263

71(1988) 19

80 (1990) 145

75 (1989) 167 72 (1988) 347

72 (1988) 129

80 (1990) 41 76 (1989) 197

71(1988) 89

71(1988) 143 72 (1988) 141

76 (1989) 51


balanced complementation for regular t-wise balanced designs

Fiiredi, Z., A projective plane is an outstanding 2-cover (Communication)

Fiiredi, Z., Covering the complete graph by partitions

Fiiredi, Z. and I.G. Rosenberg, Multicolored lines in a finite geometry

Furstenberg, H. and Y. Katznelson, A density version of the Hales-Jewett theorem for k = 3

76 (1989) 29

74 (1989) 321

75 (1989) 217

71(1988) 149

75 (1989) 227

Gehrlein, W.V., see Fishburn, P.C. Gernert, D., Inequalities between the domination

number and the chromatic number of a graph (Communication)

Gervacio, S.V., Score sequences: lexicographic enumeration and tournament construction

Gluck, D., A note on permutation polynomials and finite geometries (Note)

Godsil, C. D., Polynomial spaces Goldman, A.J., see Robinson, A.G. Goldreich, 0.) On the number of monochromatic

close pairs of beads in a rosary Goldstein, R.Z. and E.C. Turner, Counting orbits

of a product of permutations Gotoh, S., see Ueno, S. Goupil, A., On products of conjugacy classes of

the symmetric group (Invited Paper) Grassal, R.M. and A.P. Mullhaupt, Hook and

shifted hook numbers Griggs, J.R., Problems on chain partitions Guo, X., see Zhang Fu-ji Gyarfas, A., The irregularity strength of Km, m is

4 for odd 1?1 (Note) Gyarfas, A., see Faudree, R.J. Gyarfas, A., J. Lehel and Z. Tuza, Clumsy

packing of dominoes

79 (1989/90) 259

76 (1989) 151

72 (1988) 151

80 (1990) 97 73 (1989) 71 80 (1990) 297

80 (1990) 59

80 (1990) 267 72 (1988) 355

79 (1989/90) 49

79 (1989/90) 153 72 (1988) 157 72 (1988) 405

71(1988) 273 78 (1989) 83

71(1988) 33

Haggkvist, R., On the path-complete bipartite Ramsey number

Haggkvist, R., Towards a solution of the Dinitz problem?

75 (1989) 243

75 (1989) 247


Haggkvist , R., A note on Latin squares with restricted support

Hajnal, A., see Erdiis, P. Hamada, N. and M. Deza, Characterization of

{2(q + 1) + 2, 2; t, q} - min-hypers in PG (t, q) (t 2 3, q 3 5) and its applications to error- correcting codes

Hamada, N. and M. Deza, A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min-hyper in a finite projective geometry

Hamidoune, Y.O., Sur les atomes d’un graphe de Cayley infini (Communication)

Hamidoune, Y .O. and M. Las Vergnas, A solution to the Misere Shannon switching game

Hammer, P.L., see Boros, E. Hanni, H., BIBDs with block-size seven Harborth, H., see Dehnhardt, K. Harborth, H. and I. Mengersen, All Ramsey

numbers for 5 vertices and seven or eight edges Harborth, H., P. Oertel and T. Prellberg, No-

three-in-line for seventeen and nineteen Hartman, A., Combinatorial designs - A tribute

to Haim Hanani Hartman, A., see Assaf, A.M. Hartman, A., see Assaf, A.M. Hartsfield, N.A., B. W. Jackson and G. Ringel,

Hamilton surfaces for the complete even symmetric bipartite graph

Hasan, Z., Intersections of the Steiner systems of M24

Haviland, J. and A. Thomason, Pseudo-random hypergraphs

Hedetniemi, S.T., see Albertson, M.O. Hedetniemi, S.T., see Cockayne, E.J. Heinrich, K., P. Horak and A. Rosa, On

Alspach’s conjecture Hendry, G.R.T., Scattering number and extremal

non-hamiltonian graphs Hertz, A., Skeletal graphs - A new class of perfect

graphs Hertz, A. and D. de Werra, Connected sequential

colorings

75 (1989) 253 75 (1989) 145

71(1988) 219

77 (1989) 75

73 (1989) 297

72 (1988) 163 75 (1989) 81 77 (1989) 89 73 (1989) 65

73 (1989) 91

73 (1989) 89

77 (1989) 1 77 (1989) 5

79 (1989/90) 111

78 (1989) 89

78 (1989) 267

75 (1989) 255 74 (1989) 33 72 (1988) 35

77 (1989) 97

71(1988) 165

78 (1989) 291

74 (1989) 51


Hibi, T., H. Narushima, M. Tsuchiya and K. Watanabe, A graph theoretical characterization of the order complexes on the 2-sphere

Hilton, A.J.W., Two conjectures on edge- colouring

Hilton, A.J.W., A total-chromatic number ana- logue of Plantholt’s theorem

Hilton, A.J.W., see Chetwynd, A.G. Hind, H.R., see Bollobas, B. Hindman, N., On creating sets with large lower

density Hoang, C.T. and N.V.R. Mahadev, A note on

perfect orders Hoang, C.T. and B.A. Reed, &comparability

graphs Hoede, C., Hard graphs for the maximum clique

problem Homobono, N. and C. Peyrat, Graphs such that

every two edges are contained in a shortest cycle Horak, P., see Heinrich, K. Horton, J.D., Orthogonal starters in finite Abelian

groups Huang, H. and N.L. Johnson, 8 semifield planes

of order 8* Hurkens, C.A.J., A. Schrijver and E. Tardos, On

fractional multicommodity flows and distance functions

72 (1988) 167

74 (1989) 61

79 (1989/90) 169 75 (1989) 103 74 (1989) 65

80 (1990) 153

74 (1989) 77

74 (1989) 173

72 (1988) 175

76 (1989) 37 77 (1989) 97

79 (1989/90) 265

80 (1990) 69

73 (1989) 99

Ikeda, H., see Kitagawa, F. Imrich, W. and N. Seifter, A note on the growth

of transitive graphs Ito, N., Doubly regular asymetric digraphs

72 (1988) 195

73 (1989) 111 72 (1988) 181

Jackson, B.W., see Hartsfield, N.A. 78 (1989) 89 Jacobson, M.S., see Faudree, R.J. 76 (1989) 223 Jaeger, F., On the Penrose number of cubic

diagrams 74 (1989) 85 Jamison, R.E., On the edge achromatic numbers

of complete graphs 74 (1989) 99 Jamison, R.E., Alternating Whitney sums and

matchings in trees, Part II 79 (1989/90) 177 Jamison, R.E., see Albertson, M.O. 74 (1989) 33


Jendrol, S., A non-involutory self-duality (Communication)

Jendrol, S. and E. JucoviE, On quadrangular convex 3-polytopes with at most two types of edges

Jendrol, S. and P. Mihok, On a class of Hamil- tonian polytopes

Jimbo, M., see Fuji-Hara, R. Johnson, N.L., see Huang, H. Johnson, Jr., P.D., Two-colorings of a dense

subgroup of Q” that forbid many distances Joichi, J.T. and D. Stanton, An involution for

Jacobi’s identity Jucovic, E., see Jendroi, S. Jungnickel, D., Some self-blocking block designs Jungreis, D.S., Hamiltonian paths in Cayley

digraphs of finitely-generated infinite Abelian groups

Kabadi, S.N., see Chandrasekaran, R. Kajitani, Y., S. Ueno and H. Miyano, Ordering of

the elements of a matroid such that its consecu- tive w elements are independent

Kajitani, Y., see Ueno, S. Kano, M., Sufficient conditions for a graph to have

factors Katerinis, P., Toughness of graphs and the exist-

ence of factors Katznelson, Y., see Furstenberg, H. Kelly, D., see Brown, J.I. Kierstead, H.A., Applications of edge coloring of

multigraphs to vertex coloring of graphs Kitagawa, F. and H. Ikeda, An existential prob-

lem of a weight-controlled subset and its ap- plication to school timetable construction

Klee, V., see Engelhardt, E. Kleitman, D.J. and M. Fellows, Radius and dia-

meter in Manhattan lattices Kloks, T., An infinite sequence of rA-regular

graphs Knickerbocker, C.J., P.F. Lock and M. Sheard,

The minimum size of graphs Hamiltonian- connected from a vertex (Note)

74 (1989) 325

78 (1989) 297

71(1988) 233 76 (1989) 29 80 (1990) 69

79 (1989/90) 191

73 (1989) 261 78 (1989) 297 77 (1989) 123

78 (1989) 95

71(1988) 205

72 (1988) 187 72 (1988) 355

80 (1990) 159

80 (1990) 81 75 (1989) 227 80 (1990) 123

74 (1989) 117

72 (1988) 195 78 (1989) 257

73 (1989) 119

73 (1989) 127

76 (1989) 277


Knuth, D.E., see Flajolet, P. Ko, C.W. and F. Ruskey, Solution of some

multi-dimensional lattice path parity difference recurrence relations

Kocay, W.L. and Z.M. Lui, More non- reconstructible hypergraphs

Koh, K.M. and K.S. Poh, Constructions of sensitive graphs which are not strongly sensitive

Kohler, E., Allgemeine Schnittzahlen in t-designs Korte, B. and L. Lovasz, The intersection of

matroids and antimatroids Kouider, M. and D. Sotteau, On the existence of a

matching orthogonal to a 2-factorization (Communication)

Kramer, E.S., S.S. Magliveras and R. Mathon, The Steiner systems S(2, 4, 25) with nontrivial automorphism group

Kubale, M., Interval vertex-coloring of a graph with forbidden colors

Kulkarni, D.M., see Abhyankar, S.S. Kuriki, S., see Fuji-Hara, R.

Labelle, G., DCrivCes directionnelles et devel- oppements de Taylor combinatoires

Labelle, J. and Y.N. Yeh, Combinatorial proofs of some limit formulas involving orthogonal polynomials

Lachaud, G., Distribution of the weights of the dual of the Melas code (Communication)

Lamken, E.R. and S.A. Vanstone, Balanced tournament designs and related topics

Landgev, I. and V.D. Tonchev, Automorphisms of 2-(22, 8, 4) designs

Laskar, R., see Cockayne, E.J. Las Vergnas, M., see Hamidoune, Y.0 Laurent, M. and M. Deza, Bouquets of geometric

lattices: Some algebraic and topological aspects Leader, I., A short proof of a theorem of Vamos

on matroid representations Leclerc, M., Optimizing over a slice of the bipart-

ite matching polytope

75 (1989) 167

71(1988) 47

72 (1988) 213

72 (1988) 225 73 (1989) 133

73 (1989) 143

73 (1989) 301

77 (1989) 137

74 (1989) 125 79 (1989/90) 1

76 (1989) 29

79 (1989/90) 279

79 (1989/90) 77

79 (1989/90) 103

77 (1989) 159

77 (1989) 177 72 (1988) 35 72 (1988) 163

75 (1989) 279

75 (1989) 315

73 (1989) 159 Leclerc, M., see Rend& F. 73 (1989) 207


Lehel, J., F.R. McMorris and D.D. Scott, M- chain graphs of posets (Note) 74 (1989) 341

Lehel, J., see Faudree, R.J. 76 (1989) 223 Lehel, J., see Gyarfas, A. 71(1988) 33 Lemos, M., On 3-connected matroids 73 (1989) 273 Leroux, P. and G.X. Viennot, Combinatorial

resolution of systems of differential equations. IV. Separation of variables 72 (1988) 237

Li, C.-K., On certain convex matrix sets (Note) 79 (1989/90) 323 Lim, C.-K., see Deng, C.-L. Lindner, C.C., C.A. Rodger and D.R. Stinson,

Nesting of cycle systems of odd length Lindner, C.C., C.A. Rodger and D.R. Stinson,

Small embeddings for partial cycle systems of odd length

Linek, V., Bipartite graphs can have any number of independent sets

Lock, P.F., see Knickerbocker, C.J. Locke, S.C., see Albertson, M.O. Locke, S.C. and D. Witte, Flows in circulant

graphs of odd order are sums of Hamilton cycles Loebl, M. and S. Poljak, A hierarchy of totally

unimodular matrices Longyear, J.Q., A peculiar partition formula Loupekine, F. and J.J. Watkins, Labeling angles

of planar graphs Lovasz, L., see Korte, B. Lovasz, L., M. Saks and W.T. Trotter, An on-line

graph coloring algorithm with sublinear perfor- mance ratio

Luczak, T. and Z. Palka, Maximal induced trees in sparse random graphs

Lui, Z.M., see Kocay, W.L.

Mader, W., Generalizations of critical connectivity of graphs

Maehara, H., On the euclidean dimension of a complete multipartite graph

Magliveras, S.S., see Kramer, E.S. Mahadev, N.V.R., see Hoang, C.T.

72

79 (1989/90) 221

(1988) 71

71(1988) 1

77 (1989) 191

80 (1990) 273

76 (1989) 131 76 (1989) 277 74 (1989) 33

78 (1989) 105

76 (1989) 241 78 (1989) 115

72 (1988) 251 73 (1989) 143

75 (1989) 319

72 (1988) 257 72 (1988) 213

72 (1988) 267

72 (1988) 285 77 (1989) 137 74 (1989) 77

Manber, R., see Aharoni, R. Manber, R., see Brualdi, R.A.


MaruSiE, D., Strong regularity and circulant graphs

MaruSiE, D., Hamiltonicity of tree-like graphs Mathon, R. and A. Rosa, On the (15,5, il)-family

of BIBDs

78 (1989) 119 80 (1990) 167

Mathon, R., see Kramer, E.S. Mayer, J., Hadwiger’s conjecture (k = 6): Neigh-

bour configurations of 6-vertices in contraction- critical graphs

77 (1989) 205 77 (1989) 137

McBeth, R., Partitions and normal trees McCuaig, W., Existence of graphs with specified

cycle lengths

74 (1989) 137 79 (1989/90) 95

McMorris, F.R., see Lehel, J. Mengersen, I., see Harborth, H. Mercier, A., Identities containing Gaussian bino-

mial coefficients (Note) Meyniel, H., About colorings, stability and paths

in directed graphs

78 (1989) 127 74 (1989) 341 73 (1989) 91

76 (1989) 67

74 (1989) 149 Middendorf, M. and F. Pfeiffer, On the com-

plexity of recognizing perfectly orderable graphs (Communication)

Mihok, P., see Jendrol, S. Mitchem, J., On the harmonious chromatic num-

ber of a graph Miyamoto, I., Computation of some Cayley

diagrams

80 (1990) 327 71(1988) 233

74 (1989) 151

Miyano, H., see Kajitani, Y. Mohar, B., An obstruction to embedding graphs

in surfaces

72 (1988) 291 72 (1988) 187

78 (1989) 135 Monjardet, B. and R. Wille, On finite lattices

generated by their doubly irreducible elements Morgana, A., see Bauer, D. Morgana, A., see Bauer, D. Mouyart, A.-F., Decomposition of the complete

hypergraph into hyperclaws Mullhaupt, A.P., see Grassl, R.M. Mullin R.C., Finite bases for some PBD-closed

sets

73 (1989) 163 79 (1989/90) 59 79 (1989/90) 147

Mynhardt, C.M., see Cockayne, E.J.

76 (1989) 137 79 (1989/90) 153

77 (1989) 217 76 (1989) 117

Nakada, F., see Akiyama, J. 75 (1989) 7 Narushima, H., see Hibi, T. 72 (1988) 167


Nathanson, M.B., Simultaneous systems of repre- sentatives and combinatorial number theory 79 (1989)/90) 197

78 (1989) 179 80 (1990) 115

Nedela, R., see Skoviera, M. Negro, A., see Atkinson, M.D. NeSetfil, J. and Rodl, V., The Partite construction

and Ramsey set systems Nicolas, J.L., see Erdiis, P. Nishimura, T., Short cycles in digraphs Nowicki, K. and J.C. Wierman, Subgraph counts

in random graphs using incomplete U-statistics methods

Oertel, P., see Harborth, H. Olariu, S. Weak bipolarizable graphs Olariu, S., Wings and perfect graphs Ordaz, O., see Fraisse, P. Ordman, E.T., see Erdiis, P. Oxley, J.G., A note on Negami’s polynomial

invariants for graphs (Note)

Path, J. and J.H. Spencer, Note on vertex- partitions of finite graphs (Note)

Palasti, I,, A distance problem of P. Erdo”s with some further restrictions (Note)

Palka, Z., see Luczak, T. Parsons, T.D. and T. Pisanski, Vector repre-

sentations of graphs Penttila, T., see Fisher, P.H. Petford, A.D. and D.J.A. Welsh, A randomised

3-colouring algorithm Petrenjuk, A.J., On the constructive enumeration

of packings and coverings of index one Peyrat, C., see Homobono, N. Pfeiffer, F., see Middendorf, M. Phelps, K. i D.R. Stinson and S.A. Vanstone, The

existence of simple S,(3, 4, v) Pickert, G., Differenzmengen und Ovale Pin, J.E., see Berstel, J. Piras, F., see Azzena, L. Pisanski, T., Universal commutator graphs Pisanski, T., see Parsons, T.D. Pisanski, T. and T. W. Tucker, The genus of low

rank hamiltonian grouus

75 (1989) 327 75 (1989) 155 72 (1988).295

72 (1988) 299

73 (1989) 89 74 (1989) 159 80 (1990) 281 71(1988) 143 72 (1988) 93

76 (1989) 279

79 (1989/90) 107

76 (1989) 155 72 (1988) 257

78 (1989) 143 71(1988) 19

74 (1989) 253

77 (1989) 237 76 (1989) 37 80 (1990) 327

77 (1989) 255 73 (1989) 165

76 (1989) 89 79 (1989/90) 123

78 (1989) 155 78 (1989) 143

78 (1989) 157


Pittel, B., see Flajolet, P. Plummer, M.D., Toughness and matching exten-

sion in graphs Poh, K.S., see Koh, K.M. Poljak, S., see Loebl, M. Pott, A., A note on self-orthogonal codes (Note) Pouzet, M. and I. Rival, Is there a diagram

invariant? Prellberg, T., see Harborth, H. Prince, A.R., The commutative ring of a sym-

metric design (Note) Prisner, E., A characterization of interval catch

digraphs Promel, H.J., Some remarks on natural orders for

combinatorial cubes Proskurowski, A., see Arnborg, S.

Quaife, H., see Engelhardt, E. Quintana, J.A., see Dejter, I.J.

Rankin, S., see Borwein, D. Rasmussen, S., see Bollobas, B. Recski, A., Bracing cubic grids - a necessary

condition Reed, B.A., see Hoang, C.T. Rees, R., Frames and the g/c(v) problem Rees, R. and D.R. Stinson, On combinatorial

designs with subdesigns Reid, K.B., Bipartite graphs obtained from ad-

jacency matrices of orientations of graphs Reiterman, J., V. Rod1 and E. Siiiajova, Ge-

ometrical embeddings of graphs Rendl, F. and M. Leclerc, A multiply constrained

matroid optimization problem Renner, L., see Borwein, D. Reynolds, D.F., see Exoo, G. Ringel, G., see Hartsfield, N.A. Rival, I., see Pouzet, M. Robinson, A.G. and A.J. Goldman, On

Ringeisen’s isolation game Robinson, R.W., see Foulds, L.R. Rodger, C.A., see Lindner, C.C. Rodger, C.A., see Lindner, C.C.

75 (1989) 167

72 (1988) 311 72 (1988) 225 76 (1989) 241 76 (1989) 283

73 (1989) 181 73 (1989) 89

80 (1990) 101

73 (1989) 285

73 (1989) 189 80 (1990) 1

78 (1989) 257 72 (1988) 63

73 (1989) 291 75 (1989) 55

73 (1989) 199 74 (1989) 173 71(1988) 243

77 (1989) 259

72 (1988) 321

74 (1989) 291

73 (1989) 207 73 (1989) 291 71(1988) 119 78 (1989) 89 73 (1989) 181

80 (1990) 297 72 (1988) 129 77 (1989) 191 80 (1990) 273


Rddl, V., see Colbourn, C.J. Rodl, V., see NeSetiil, J. Rodl, V., see Reiterman, J. Rogers, D.G., see Clark, W.E. Roos, C., see Damerell, R.M. Rosa, A., see Heinrich, K. Rosa, A., see Mathon, R. Rosenberg, I.G., see Ftiredi, Z. Rosenstiehl, P., Scaffold permutations Ross, N.J., Remarks on the Mobius function of a

subposet (Communication) Rousseau, C.C., see ErdBs, P. Rousseau, C.C., see Faudree, R.J. Royle, G.F., see Fisher, P.H. Ruiz, M.-J.P., C,-factors of group graphs Ruiz, S., see Alavi, Y. Ruskey, F., see Ko, C.W.

Sachs, H. and M. Stiebitz, On constructive methods in the theory of colour-critical graphs

Saks, M., see Lovasz, L. Sampathkumar, E. and C.V. Venkatachalam,

Chromatic partitions of a graph Sanchez-Arroyo, A., Determining the total col-

ouring number is NP-hard (Communication) Santoro, N., see Atkinson, M.D. Sarkozy, A., see ErdBs, P. Scapellato, R., On F-geodetic graphs Schelp, R.H., see Erdiis, P. Schelp, R.H., see Faudree, R.J. Schelp, R.H., see Faudree, R.J. Schmeigel, E.F., see Bauer, D. Schmeigel, E.F., see Bauer, D. Schonheim, J., see Brown, J.I. Schrag, G. and L. Cammack, On the 2-

extendability of the generalized Petersen graphs Schreiber, S., Cyclical Steiner Triple Systems or-

thogonal to their opposites Schreiber, S., Symmetric quasigroups of odd order Schrijver, A., see Hurkens, C.A.J. Scott, D.D., see Lehel, J. Seifter, N., see Imrich, W. Seymour, P.D., see Chung, F.R.K.

21

77 (1989) 57 75 (1989) 327 74 (1989) 291 80 (1990) 249 76 (1989) 183 77 (1989) 97

77 (1989) 205 71(1988) 149 75 (1989) 335

73 (1989) 305 72 (1988) 103 72 (1988) 119 71(1988) 19 72 (1988) 331 72 (1988) 3 71(1988) 47

74 (1989) 201 75 (1989) 319

74 (1989) 227

78 (1989) 315 80 (1990) 115 75 (1989) 155 80 (1990) 313 72 (1988) 103 72 (1988) 119 76 (1989) 223

79 (1989/90) 59 79 (1989/90) 147

80 (1990) 123

78 (1989) 169

77 (1989) 281 77 (1989) 285 73 (1989) 99 74 (1989) 341 73 (1989) 111 75 (1989) 113


Shamula, M., see Alavi, Y. Sharry, M.J. and Street, A.P., Partitioning sets of

quadruples into designs I Sheard, M., see Knickerbocker, C. J. Shi, Y., On maximum cycle-distributed graphs Shrikhande, M.S. and N.M. Singhi, An elemen-

tary derivation of the annihilator polynomial for extremal (2,s + 1)-designs

Siemon, H., Infinite families of strictly cyclic Steiner quadruple systems

Simdes-Pereira, J.M.S., An algorithm and its role in the study of optimal graph realizations of distance matrices

Sinajova, E., see Reiterman, J. Singhi, N.M., see Shrikhande, M.S. Skoviera, M. and Nedela, R., The maximum

genus of vertex-transitive graphs Sloane, N.J.A., see Fishburn, P.C. Sotteau, D., see Kouider, M. Spencer, J., Coloring the projective plane Spencer, J.H., see Path, J. Stahl, S., A duality for permutations Stanton, D., see Joichi, J.T. Stanton, R.G., Minimal pairwise balanced designs Stein, S.K., The notched cube tiles R

(Communication) Steiner, G., Minimizing bumps in ordered sets by

substitution decomposition (Note) Stiebitz, M., see Sachs, H. Stinson, D.R., see Lindner, C.C. Stinson, D.R., see Phelps, K. Stinson, D.R., see Rees, R. Stinson, D.R., see Rodger, C.A. Street, A.P., see Sharry, M.J. Street, D.J., Combinatorial problems in repeated

measurements designs Strehl, V., Combinatorics of Jacobi-configurations

III: The Srivastava-Singhal generating function revisited

Stueckle, S., Chromatic automorphisms and sym- metries of some graphs

SysIo, M.M., An algorithm for solving the jump number problem

72 (1988) 3

77 (1989) 299 76 (1989) 277 71(1988) 57

80 (1990) 93

77 (1989) 307

79 (1989/90) 299 74 (1989) 291

80 (1990) 93

78 (1989) 179 74 (1989) 263 73 (1989) 301 73 (1989) 213

79 (1989/90) 107 71(1988) 257 73 (1989) 216 77 (1989) 317

80 (1990) 335

76 (1989) 285 74 (1989) 201 77 (1989) 191 77 (1989) 255 77 (1989) 259 80 (1990) 273 77 (1989) 299

77 (1989) 323

73 (1989) 221

80 (1990) 175

72 (1988) 337


Sysio, M.M., Sequential coloring versus Welsh- Powell bound 74 (1989) 241

Szekely, L.A. and N.C. Wormald, Bounds on the measurable chromatic number of [w” 75 (1989) 343

Tardos, E., see Hurkens, C.A.J. 73 (1989) 99 Taylor, R., Reconstructing degree sequences from

k-vertex-deleted subgraphs 79 (1989/90) 207 Teh, H.H. and M.F. Foo, Large scale network

analysis with applications to transportation, communication and inference networks

Teirlinck, L., Locally trivial t-designs and t-designs without repeated blocks

Thibon, J.Y., see Duchamp, G. Thomason, A., A simple linear expected time

algorithm for finding a hamilton path Thomason, A., Dense expanders and pseudo-

random bipartite graphs Thomason, A., see Haviland, J. Thomassen, C., Arc reversals in tournaments Thuillier, H., see Fouget, J.-L. Tonchev, V.D., see Bussemaker F.C. Tonchev, V.D., see Landgev, I. Torriani, H.H., Constructive implict function

theorems Tipnis, S.K. and L.E. Trotter, Jr., A generaliza-

tion of Robacker’s theorem Tokunaga, S., see Akiyama, J. Trotter, L.E., Jr., see Tipnis, S.K. Trotter, W.T., see Lovasz, L. Tsuchiya, M., see Hibi, T. Tucker, T.W., see Pisanski, T. Turner, E.C., see Goldstein, R.Z. Tuza, Z., see Faudree, R.J. Tuza, Z., see Gyarfas, A.

Ueno, S., Y. Kajitani and S. Gotoh, On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three

Ueno, S., see Kajitani, Y. Ushio, K., P3-factorization of complete bipartite

graphs

72 (1988) 347

77 (1989) 345 76 (1989) 123

75 (1989) 373

75 (1989) 381 75 (1989) 255 71(1988) 73

80 (1990) 41 76 (1989) 45

77 (1989) 177

76 (1989) 247

74 (1989) 245 75 (1989) 7 74 (1989) 245 75 (1989) 319 72 (1988) 167 78 (1989) 157 80 (1990) 267 78 (1989) 83 71(1988) 33

72 (1988) 355 72 (1988) 187

72 (1988) 361


Valette, G., A better packing of ten equal circles in a square (Communication)

van Rees, G.H.J., A new family of BIBD’s and 76 (1989) 57

non-embeddable (16, 24, 9, 6, 3)-designs Vanstone, S.A., see Curran, D.J. Vanstone, S.A., see Lamken, E.R. Vanstone, S.A., see Phelps, K. van Zanten, A.J., see Damerell, R.M. van Zanten, A.J., A short proof of a theorem of

77 (1989) 357 73 (1989) 49

77 (1989) 159 77 (1989) 255 76 (1989) 183

Bannai and Ito (Note) 78 (1989) 321 Venkatachalam, C.V., see Sampathkumar, E. 74 (1989) 227 Viennot, G.X., see Leroux, P. 72 (1988) 237 Vince, A., n-graphs 72 (1988) 367 Voigt, B., see Benzait, A. 73 (1989) 27 Volkmann, L., see Flach, P. 80 (1990) 145

Wajnrby, B., see Aharoni, R. i Wallis, W.D., see Baartmans, A.H. Wang, J., On point-linear arboricity of planar

graphs Watanabe, K., see Hibi, T. Watanabe, T., On the Littlewood-Richardson

rule in terms of lattice path combinatorics Watkins, J.J., see Loupekine, F. Welsh, D.J.A., see Petford, A.D. West, D.B., A short proof of the degree bound for

interval number (Note) White, D.E., Hybrid tableaux and the

Littlewood-Richardson rule Whitehead, E.G., Jr., Chromatic polynomials of

generalized trees Wierman, J.C., see Nowicki, K. Wilbrink, H.A., see Blokhuis, A. Wille, R., see Monjardet, B. Witte, D., see Locke, S.C. Wojtas, M., Some new matrices-minus-diagonal

and MOLS (Note) Wolfmann, J., The weights of the dual code of the

Melas code over GF(3) (Communication) Woodall, D.R., Forbidden graphs for degree and

neighbourhood conditions Woodburn, R.L., A 4-color theorem for the Klein

bottle

‘9 (1989/90) 221 78 (1989) 37

72 (1988) 381 72 (1988) 167

72 (1988) 385 72 (1988) 251 74 (1989) 253

73 (1989) 309

80 (1990) 183

72 (1988) 391 72 (1988) 299 74 (1989) 335 73 (1989) 163 78 (1989) 105

76 (1989) 291

74 (1989) 327

75 (1989) 387

76 (1989) 271


Woodrow, R.E., see Brown, J.I. 80 (1990) 123 Wormald, N.C., see Szekely, L.A. 75 (1989) 343

Yang, Y., On a conjecture about monochromatic flats (Note) 80 (1990) 213

Yap, H.P., Packing of graphs-a survey 72 (1988) 395 Yap, H.P., Corrigendum to: On graphs critical

with respect to edge-colourings 80 (1990) 223 Yeh, Y.N., see Labelle, J. 79 (1989/90) 77

Zaks, J., Parsons graphs of matrices Zeilberger, D., A Stembridge-Stanton sytle elem-

entary proof of the Habsieger-Kadell q-Morris identity

Zeilberger, D., A fast algorithm for proving terminating hypergeometric identities (Communication)

Zeitler, H., Modifications of the ‘central-method’ to construct Steiner triple systems

Zhang, C.-Q., Bridges of longest cycles Zhang, C.-Q., Cycles of given length in some

K,,,-free graphs Zhang, Fu-ji, X. Guo and R.-S. Chen, Z-

transformation graphs of perfect matchings of hexagonal systems

Ziegler, G.M., The face lattice of hyperplane arrangements

78 (1989) 187

79 (1989/90) 313

80 (1990) 207

77 (1989) 367 78 (1989) 195

78 (1989) 307

72 (1988) 405

73 (1989) 233

master index of volumes 71-80 index of volumes 71-80 abhyankar, ... decomposability of irreducibles...

Documents