master index of volumes 91-100 - core

Master index of volumes 91-100

Abbott, H.L. and M. Katchalski, Further results on snakes in powers of complete graphs

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k- critical graphs

Abhyankar, S.S. and S.B. Joshi, Generalized rodeletive correspondence between multi- tableaux and multimonomials

Abhyankar, S.S. and S.R. Ghorpade, Young tableaux and linear independence of standard monomials in multiminors of a multimatrix

Abrham, J., Graceful 2-regular graphs and Skolem sequences

Acharya, B.D. and S.M. Hegde, Strongly index- able graphs

Aharoni, R., Infinite matching theory Alavi, Y., J. Liu, J. Wang and Z. Zhang, On

total covers of graphs Albertson, M.O., Turan theorems with repeated

degrees Alspach, B. and D. Hare, Edge-pancyclic block-

intersection graphs Arasu, K.T. and A. Pott, Some constructions of

group divisible designs with Singer groups Arasu, K.T., D. Jungnickel and A. Pott, Sym-

metric divisible designs with k - A, = 1 Archdeacon, D. and J.H. Dinitz, Constructing

indecomposable I-factorizations of the complete multigraph

Arora, S., see Srivastava, J. Atanassov, K.T., see Shannon, A.G.

Bandelt, H.J. and H.M. Mulder, Metric characterization of parity graphs

Elsevier Science Publishers B.V.

91 (1991) 111-120

992) 223-228

991) l- 17

991) l- 32

991) 11.5-121

991) 123-129 95 (1991) s- 22

100 (1992) 229-233

100 (1992) 235-241

97 (1991) 17- 24

97 (1991) 39- 45

97 (1991) 25- 28

92 (1991) 9- 19 98 (1991) 35- 56 92 (1991) 329-340

91 (1991) 221-230

brought to you by COREView metadata, citation and similar papers at core.ac.uk

provided by Elsevier - Publisher Connector

https://core.ac.uk/display/82618393?utm_source=pdf&utm_medium=banner&utm_campaign=pdf-decoration-v1

4 Master index of volumes 91-100

Bandelt, H.J. and H.M. Mulder, Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication

Bang-Jensen, J., On the structure of locally semicomplete digraphs

Bao, X., On a Mouyart’s conjecture (Note) Baranga, A., The contraction principle as a

particular case of Kleene’s fixed point theorem (Note)

Batten, L.M., An extension of Wagner’s theorem

Bauer, D., G. Fan and H.J. Veldman, Hamil- tonian properties of graphs with large neighborhood unions

Beck, I. and S. Krogdahl, On log concave sequences (Note)

Bennett, F.E. and H. Shen, On indecomposable pure Mendelsohn triple systems

Bergeron, N. and A.M. Garsia, Zonal polynomials and domino tableaux

Beutelspacher, A., A combinatorial characterization of geometric spreads

Bialostocki, A., P. Dierker and B. Voxman, Some notes on the Erdos-Szekeres theorem

Bialostocki, A. and P. Dierker, An isoperimetric lemma (Note)

Billington, E.J. and D.G. Hoffman, The number of repeated blocks in balanced ternary designs with block size three II

Biro, M., M. Hujter and Zs. Tuza, Precoloring extension. I. Interval graphs

Blokhuis, A., A. Brouwer and H. Wilbrink, Hermitian unitals are code words

Bloom, G.S.and Hsu, D.F., Foreword Borodin, O.V., Cyclic coloring of plane graphs Bressoud, D.M., Unimodality of Gaussian

polynomials Brochet, J.-M. and M. Pouzet, Gallai-Milgram

properties for infinite graphs Brooks, R.L., C.A.B. Smith, A.H. Stone and

W.T. Tutte, Determinants and current flows in electric networks

Brouwer, A., see Blokhuis, A.

94 (1991) 161-180

100 (1992) 243-265 98 (1991) 141-145

98 (1991) 75- 79

92 (1991) 21- 23

96 (1991) 33- 49

94 (1991) 141-145

97 (1991) 47- 57

99 (1992) 3- 15

97 (1991) 59- 62

91 (1991) 231-238

94 (1991) 221-228

92 (1991) 25- 37

100 (1992) 267-279

97 (1991) 63- 68 93 (1991) 111-113

100 (1992) 281-289

99 (1992) 17- 24

95 (1991) 23- 47

100 (1992) 291-301 97 (1991) 63- 68

Master index of volumes 91-100 5

Brown, J-1. and D.G. Corneil, Graph properties and hypergraph colourings

Brualdi, R.A. and B.L. Shader, Matrices of O’s and l’s with restricted permanental minors

Caccetta, L. and K. Vijayan, Long cycles in subgraphs with prescribed minimum degree

Caccetta, L. and K. Vijayan, Maximal cycles in graphs

Cai, M.-c., On some factor theorems of graphs (Note)

Cameron, P.J., The age of a relational structure Cameron, P.J., Covers of graphs and EGQs Canfield, E.R. and D.M. Jackson, A D-finiteness

result for products of permutations Casse, L.R.A., see Oxenham, M.G. Chamberlin, S.R. and D.A. Sprott, On a discrete

distribution associated with the statistical as- sessment of nominal scale agreement

Chartrand, G., H. Hevia and R.J. Wilson, The ubiquitous Petersen graph

Chee, Y.M. and G.F. Royle, The 2-rotational Steiner triple systems of order 25

Chee, Y.M., Graphical t-designs with block sizes three and four (Note)

Chen, W. and T. Klove, Lower bounds on multiple difference sets

Chen, W.Y.C., Maximum (g,f)-factors of a genera1 graph

Chetwynd, A.G. and A.J.W. Hilton, Outline symmetric latin squares

Choudum, S.A., On forcibly connected graphic sequences

Christiansen, M., J. Liitzen, G. Sabidussi and B. Toft, Julius Petersen annotated bibliography

Cignoli, R., Quantifiers on distributive lattices Clark, W.E., Blocking sets in finite projective

spaces and uneven binary codes (Note) Clivio, A., Tilings of a torus with rectangular

boxes Colbourn, C.J., R.A. Mathon, A. Rosa and N.

Shalaby, The fine structure of threefold triple systems: u = 1 or 3 (mod 6)

98 (1991) 81- 93

96 (1991) 161-174

97 (1991) 69- 81

98 (1991) l- 7

98 (1991) 223-229 95 (1991) 49- 67 97 (1991) 83- 92

99 (1992) 25- 30 92 (1991) 251-259

92 (1991) 39- 47

100 (1992) 303-311

97 (1991) 93-100

91 (1991) 201-206

98 (1991) 9- 21

91 (1991) l- 7

97 (1991) 101-117

96 (1991) 175-181

100 (1992) 83- 97 96 (1991) 183-197

94 (1991) 65- 68

91 (1991) 121-139

92 (1991) 49- 64


Colbourn, C.J. and A. Hartman, Intersections and supports of quadruple systems

Colbourn, C. J., D.G. Hoffman and C.A. Rodger, Directed star decompositions of directed multigraphs

Cooper, C., Pancyclic Hamilton cycles in random graphs

Corneil, D.G., see Brown, J.I.

De Caen, D., D.L. Kreher, S.P. Radziszowski and W.H. Mills, On the covering of t-sets with (t + 1)-sets: C(9,5,4) and C(10,6,5)

Decoste, H., G. Labelle and P. Leroux, The functorial composition of species, a forgotten operation

de Resmini, M.J., Some naive constructions of S(2, 3, v) and S(2, 4, v)

Desarmenien, J. and D. Foata, The signed Eulerian numbers

de Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance

de Vroedt, C., fiber einen Satz von Kiihler Deza, M., see Hamada, N. Dierker, P., see Bialostocki, A. Dierker, P., see Bialostocki, A. Diestel, R., Decomposing infinite graphs Diestel, R., The end structure of a graph: recent

results and open problems Dinitz, J.H., see Archdeacon, D. Donovan, D. and S. Oates-Williams, Single laws

for sloops and squags Du, B., see Zhu, L.

Ebert, G., J. Hemmeter, F. Lazebnik and A. Woldar, On the number of irregular assign- ments on a graph

Edelman, P.H., R. Simion and D. White, Partition statistics on permutations

El-Zahar, M. and N.W. Sauer, Ramsey-type properties of relational structures

Engel, P., The enumeration of four-dimensional polytopes

97 (1991) 119-137

97 (1991) 139-148

91 (1991) 141-148 98 (1991) 81- 93

92 (1991) 6% 77

99 (1992) 31- 48

97 (1991) 149-153

99 (1992) 49- 58

97 (1991) 155-160 97 (1991) 161-165 93 (1991) 19- 33 91 (1991) 231-238 94 (1991) 221-228 95 (1991) 69- 89

100 (1992) 313-327 92 (1991) 9- 19

92 (1991) 79- 83 97 (1991) 409-417

93 (1991) 131-142

99 (1992) 63- 68

94 (1991) l- 10

91 (1991) 9- 31


Eppstein, D., J. Feigenbaum and C.-L. Li, Equipartitions of graphs

Erdiis, P. and J.A. Larson, Matchings from a set below to a set above

Erdiis, P., S. Fajtlowicz and W. Staton, Degree sequences in triangle-free graphs

Erdiis, P., Z. Fiiredi and Z. Tuza, Saturated r-uniform hypergraphs

Eswarathasan, A. and E. Levine, p-Integral harmonic sums

Etzion, T., Combinatorial designs with Costas arrays properties

Etzion, T., Hamiltonian decomposition of K,*, patterns with distinct differences, and Tuscan squares

Fajtlowicz, S., see Erdiis, P. Fan, G., see Bauer, D. Faudree, R.J., R.J. Gould and L.M. Lesniak,

Neighborhood conditions and edge-disjoint perfect matchings

Faudree, R.J., M.S. Jacobson, L. Kinch and J. Lehel, Irregularity strength of dense graphs

Favaron, O., M.C. Heydemann, J.C. Meyer and D. Sotteau, A parameter linked with G-factors and the binding number (Note)

Feigenbaum, J., see Eppstein, D. Fishburn, P.C., J.C. Lagarias, J.A. Reeds and

L.A. Shepp, Sets uniquely determined by projections on axes II Discrete case

Fishburn, P.C. and L.A. Shepp, On the FKB conjecture for disjoint intersections

Foata, D., see Desarmenien, J. Fuji-Hara, R. and S. Kuriki, Mutually balanced

nested designs Ftiredi, Z., see Erdos, P. Furino, S., Difference families from rings

Galeana-SBnchez, H. and V. Neumann-Lara, Extending kernel perfect digraphs to kernel perfect critical digraphs

Gani, J., A note on a stochastic model for the incubation of transfusion-associated AIDS

91 (1991) 239-248

95 (1991) 169-182

92 (1991) 8% 88

98 (1991) 95-104

91 (1991) 249-257

93 (1991) 143-154

91 (1991) 259-276

92 (1991) 85- 88 96 (1991) 33- 49

91 (1991) 33- 43

91 (1991) 45- 59

91 (1991) 311-316 91 (1991) 239-248

91 (1991) 149-159

98 (1991) 105-122 99 (1992) 49- 58

97 (1991) 167-176 98 (1991) 95-104 97 (1991) 177-190

94 (1991) 181-187

92 (1991) 89- 94


Garsia, A.M., Orthogonality of Milne’s polynomials and raising operators

Garsia, A.M., see Bergeron, N. Ghorpade, S.R., see Abhyankar, S.S. Gibbs, R.A. and P.J. Slater, Distinct distance sets

in a graph Gionfriddo, M., F. Milazzo and V. Vacirca,

Transitive multipermutation graphs: case 4 d ndrn

Goddard, W., Acyclic colorings of planar graphs (Note)

Goulden, I.P., A linear operator for symmetric functions and tableaux in a strip with given trace

Gould, R.J., see Faudree, R.J. Grannell, M.J., T.S. Griggs and J.S. Phelan, On

infinite Steiner systems Granville, A., On a paper of Agur, Fraenkel and

Klein (Note) Griggs, T.S., see Grannell, M.J. Gupta, S., see Mukerjee, R.

Haiman, M.D. and D. Kim, A characterization of generalized staircases

Haiman, M.D., Dual equivalence with applications, including a conjecture of Proctor

Halin, R., Bounded graphs Halin, R., Tree-partitions of infinite graphs Hamada, N. and M. Deza, A characterization of

{2u,+1+ 2%+1, 2v, + 2vp; t, q}-minihypers in PG(t,q)(t>2,q>5andO<a<P<t) and its applications to error-correcting codes

Hamm, R.C., see Sarvate, D.G. Hanlon, P., A Markov chain on the symmetric

group and Jack symmetric functions

Hansen, P. and J. Kuplinsky, The smallest hard-to-color graph

Harborth, H., Plane four-regular graphs with vertex-to-vertex unit triangles

Hare, D., see Alspach, B. Harper, L.H., On a problem of Kleitman and

West Hartman, A., see Colbourn, C.J.

99 (1992) 247-264 99 (1992) 3- 15 96 (1991) l- 32

93 (1991) 155-165

97 (1991) 191-198

91 (1991) 91- 94

99 (1992) 69- 77 91 (1991) 33- 43

97 (1991) 199-202

94 (1991) 147-151 97 (1991) 199-202 91 (1991) 105-108

99 (1992) 115-122

99 (1992) 79-113 95 (1991) 91- 99 97 (1991) 203-217

93 (1991) 19- 33 92 (1991) 321-328

99 (1992) 123-140

96 (1991) 199-212

97 (1991) 219-222 97 (1991) 17- 24

93 (1991) 169-182 97 (1991) 119-137

Master index of volum& 91-100

Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs

Hartvigsen, D. and R. Mardon, Cycle bases from orderings and coverings

Haviland, J., On minimum maximal independent sets of a graph

Hegde, S.M., see Acharya, B.D. Heinrich, K., M. Kobayashi and G. Nakamura,

Dudeney’s round table problem Heinrich, K., Simple direct constructions for

hybrid triple designs Hemmeter, J., see Ebert, G. Hendy, M.D., A combinatorial description of the

closest tree algorithm for finding evolutionary trees

Hevia, H., see Chartrand, G. Heydemann, M.C., see Favaron, 0. Hilton, A.J.W., see Chetwynd, A.G. Hirschfeld, J.W.P. and T. Szonyi, Sets in a finite

plane with few intersection numbers and a distinguished point

Hoang, C.T., F. Maffray and M. Preissmann, New properties of perfectly orderable graphs and strongly perfect graphs

Hobart, S.A., On designs related to coherent configurations of type (’ 2)

Hoffman, D.G., see Billington, E.J. Hoffman, D.G., see Colbourn, C.J. Hoffman, D.G. and P.J. Schellenberg, The

existence of C,-factorizations of K,, - F Hofmeister, M., Isomorphisms and automorph-

isms of graph coverings Holton, D.A., D. Lou and M.D. Plummer, On

the 2-extendability of planar graphs Honkala, I., All binary codes with covering radius

one are subnormal (Note) Horak, P., Extending partial systems of distinct

representatives (Note) Horton, J.D., A hyperfactorization of order 8,

index 2 Horton, J.D. and G.M. Nonay, Self-orthogonal

Hamilton path decompositions Hovey, M., A-cordial graphs

9

95-105 92 (199 1)

94 (199

94 93

1)

(1991) (1991)

81- 94

95-101 123-129

92 (1991) 107-125

97 (1991) 223-227 93 (1991) 131-142

96 (1991) 51- 58 100 (1992) 303-3 11 91 (1991) 311-316 97 (1991) 101-l 17

97 (1991) 229-242

98 (1991) 161-174

94 (1991) 103-127 92 (1991) 25- 37 97 (1991) 139-148

97 (1991) 243-250

98 (1991) 175-183

96 (1991) 81- 99

94 (1991) 229-232

91 (1991) 95- 98

92 (1991) 127- 129

97 (1991) 251-264 93 (1991) 183-194


Hsu, D.F., see Bloom, G.S. Hujter, M., see Biro, M. Hwang, S.G., Doubly stochastic circulant matri-

ces (Note) Hwang, S.G., The monotonicity of the permanent

function (Note)

Imrich, W. and N. Seifter, A survey on graphs with polynomial growth

Jackson, D.M., see Canfield, E.R. Jackson, W.-A., F. Piper and P. Wild, Non-

embedding of non prime-power unitals with point-regular group

Jacobson, M.S., see Faudree, R.J. Janko, Z. and V.D. Tonchev, Cyclic 2-(91,6,1)

designs with multiplier automorphisms Joshi, S.B., see Abhyankar, S.S. Juhasz, F., The asymptotic behaviour of Fiedler’s

algebraic connectivity for random graphs Jung, H.A., Some results on ends and auto-

morphisms of graphs Jungnickel, D. and S. Vanstone, Triple systems in

PG (2, s) Jungnickel, D., see Arasu, K.T. Jungnickel, D., R.C. Mullin and S.A. Vanstone,

The spectrum of a-resolvable block designs with block size 3

Kageyama, S. and K. Sinha, Constructions of partially balanced bipartite block designs

Katchalski, M., see Abbott, H.L. Kim, A.C. and B.H. Neumann, Laws in a class of

groupoids Kim, D., see Haiman, M.D. Kinch, L. and J. Lehel, The irregularity strength

of tP3 (Note)

Kinch, L., see Faudree, R.J. Kltive, T., see Chen, W. Kobayashi, M., see Heinrich, K. Kocay, W. and G.H.J. van Rees, Some non-

isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + l)- BIBD’s

93 (1991) 111-113 100 (1992) 267-279

94 (1991) 69- 74

91 (1991) 99-104

95 (1991) 101-117

99 (1992) 25- 30

98 (1991) 23- 28 91 (1991) 45- 59

97 (1991) 265-268 93 (1991) l- 17

96 (1991) 59- 63

95 (1991) 119-133

92 (1991) 131-135 97 (1991) 25- 38

97 (1991) 269-277

92 (1991) 137-144 91 (1991) 111-120

92 (1991) 145-158 99 (1992) 115-122

94 (1991) 75- 79 91 (1991) 45- 59 98 (1991) 9- 21 92 (1991) 107-125

92 (1991) 159-172


Kocay, W., see Hartnell, B.L. Koester, G., On 4-critical planar graphs with high

edge

t

Krasikov, I., On a tree-cutting problem of P. Ash Kreher, D.L., see De Caen, D. Ki;ii, I. and R. Thomas, Analyzing Nash-

Williams’ partition theorem by means of or- dinal types

Krogdahl, S., see Beck, I. Kuplinsky, J.. see Hansen, P. Kuriki, S., see Fuji-Hara, R.

Labelle, G., On asymmetric structures Labelle, G., see Decoste, H. Lagarias, J.C., see Fishburn, P.C. Lai, H.-J., Graph whose edges are in small cycles Lam, C. W.H., G. Kolesova and L. Thiel, A

computer search for finite projective planes of order 9

Lamken, E.R., On near generalized balanced tournament designs

Lamken, E., R. Rees and S. Vanstone, Class- uniformly resolvable pairwise balanced designs with block sizes two and three

Larson, J.A., see Erdiis, P. Lascoux, A. et M.-P. Schutzenberger,

92 (1991) 95-105

98 (1991) 147-151

96 (1991) 65- 69 92 (1991) 187-195

95 (1991) 255-270

93 (1991) 35- 53

92 (1991) 173-176 92 (1991) 177-185

92 (1991) 177-185

96 (1991) 101-110 93 (1991) 55- 61 92 (1991) 65- 77

95 (1991) 135-167 94 (1991) 141-145 96 (1991) 199-212 97 (1991) 167-176

99 (1992) 141-164 99 (1992) 31- 48 91 (1991) 149-159 94 (1991) ll- 22

92 (1991) 187-195

97 (1991) 279-294

92 (1991) 197-209 95 (1991) 169-182


Decompositions dans l’algebre des differences divisees

Lazebnik, F., see Ebert, G. Lee, S.M. and S.C. Shee, On Skolem graceful

graphs Lee, S.M., E. Schmeichel and S.C. Shee, On

felicitous graphs Lehel, J., see Faudree, R.J. Lehel, J., see Kinch, L. Lenz, H. and G. Ringel, A brief review on

Egmont Kohler’s mathematical work Leroux, P., see Decoste, H. Lesniak, L.M., see Faudree, R.J. Levine, E., see Eswarathasan, A. Liang, K. and M.L. Wachs, Mahonian statistics

on labeled forests Li, Chung-Lun, see Eppstein, D. Lidl, R. and W .B. Miiller, Generalizations of the

Fibonacci pseudoprimes test Liu, J., see Alavi, Y. Li, X. and F. Zhang, On the numbers of spanning

trees and Eulerian tours in generalized de Bruijn graphs

Lorenzini, D.J., A finite group attached to the laplacian of a graph

Lou, D., see Holton, D.A. Luczak, T., Cycles in random graphs (Note) Euczak, T., Size and connectivity of the k-core of

a random graph Lutzen, J., G. Sabidussi and B. Toft, Julius

Petersen 1839-1910. A biography Lutzen, J., see Christiansen, M. Lu, X., A matching game

99 (1992) 165-179 93 (1991) 131-142

93 (1991) 195-200

93 (1991) 201-209 91 (1991) 45- 59 94 (1991) 75- 79

97 (1991) 3- 16 99 (1992) 31- 48 91 (1991) 33- 43 91 (1991) 249-257

99 (1992) 181-197 91 (1991) 239-248

92 (1991) 211-220 100 (1992) 229-233

94 (1991) 189-197

91 (1991) 277-282 96 (1991) 81- 99 98 (1991) 231-236

91 (1991) 61- 68

100 (1992) 9- 82 100 (1992) 83- 97

94 (1991) 199-207

Maffray, F., see Hoang, C.T. Magliveras, S.S., see Kramer, E.S. Manvel, B., A. Meyerowitz, A. Schwenk, K.

Smith and P. Stockmeyer, Reconstruction of sequences

Marczyk, A. and Z. Skupien, Maximum non- hamiltonian tough graphs

Mardon, R., see Hartvigsen, D.

98 (1991) 161-174 96 (1991) 101-110

94 (1991) 209-219

96 (1991) 213-220 94 (1991) 81- 94


Marino, M.C. and R.S. Rees, On parallelism in Steiner systems

Mathon, R.A., see Colbourn, C.J. McMullen, P., Regular polyhedra related to

projective linear groups Mendelsohn, E. and N. Shalaby, Skolem labelled

graphs Meyer, J.C., see Favaron, 0. Meyerowitz, A., see Manvel, B. Milazzo, F., see Gionfriddo, M. Miller, Z. and D. Pritikin, The harmonious

coloring number of a graph Mills, W.H., see De Caen, D. Milner, E.C. and K. Prikry, A partition relation

for triples using a model of Todorcevic Milne, S.C., Classical partition functions and the

U(n + 1) Rogers-Selberg identity Mohar, B., Some relations between analytic and

geometric properties of infinite graphs Mollard, M., Two characterizations of general-

ized hypercube Mukerjee, R. and S. Gupta, Geometric con-

struction of balanced block designs with nested rows and columns (Note)

Mulder, H.M., Julius Petersen’s theory of regular graphs

Mulder, H.M., see Bandelt, H.J. Mulder, H.M., see IBandelt, H.J.

Miiller, W.B., see Lidl, R. Mullin, R.C. and D. Wevrick, Singular points in

pair covers and their relation to Hadamard designs

Mullin, R.C., see Jungnickel, D. Mynhardt, C.M., Lower Ramsey numbers for

graphs

Nakamura, G., see Heinrich, K. Narendran, P., C. G’Ddnlaing and F. Otto, It is

undecidable whether a finite special string- rewriting system presents a group (Note)

Nash-Williams, C.St.J.A., Reconstruction of locally finite connected graphs with two infinite wings

97 (1991) 295-300 92 (1991) 49- 64

91 (1991) 161-170

97 (1991) 301-317 91 (1991) 311-316 94 (1991) 209-219 97 (1991) 191-198

93 (1991) 211-228 92 (1991) 65- 77

95 (1991) 183-191

99 (1992) 199-246

95 (1991) 193-219

93 (1991) 63- 74

91 (1991) 105-108

100 (1992) 157-175 91 (1991) 221-230 94 (1991) 161-180 92 (1991) 211-220

92 (1991) 221-225 97 (1991) 269-277

91 (1991) 69- 75

92 (1991) 107-125

98 (1991) 153-159

92 (1991) 227-249


Nash-Williams, C.St.J.A., Reconstruction of infinite graphs

Neumann, B.H., see Kim, A.C. Neumann-Lara, V., see Galeana-Sanchez, H. Niederhausen, H., Initial value problems in the

logarithmic algebra Niedermeyer, F., f-Optimal factors of infinite

graphs Niederreiter, H., A combinatorial problem for

vector spaces over finite fields Nilli, A., On the second eigenvalue of a graph

(Note) Nonay, G.M., see Horton, J.D.

95 (1991) 221-229 92 (1991) 14.5-158 94 (1991) 181-187

94 (1991) 23- 37

95 (1991) 231-254

96 (1991) 221-228

91 (1991) 207-210 97 (1991) 251-264

92 (1991) 79- 83 98 (1991) 153-159 98 (1991) 153-159

Oates-Williams, S., see Donovan, D. O’Dtinlaing, C., see Narendran, P. Otto, F., see Narendran, P. Oxenham, M.G. and L.R.A. Casse, On a

geometric representation of the subgroups of index 6 in S,

Oxley, J.G., Ternary paving matroids 92 (1991) 251-259 91 (1991) 77- 86

(1991) Path, J., see Komjath, P. Pawale, R.M. and S.S. Sane, A short proof of a

conjecture on quasi-symmetric 3-designs (Note) Peile, R.E., Inclusion transformations: (n, m)-

graphs and their classification Peng, Y.H., On the chromatic uniqueness of

certain bipartite graphs Petrovic, V. and C. Thomassen, Kings in k-

partite tournaments (Note) Pfaff, 0.) On the simplicity of -2 and -3 Phelan, J.S., see Grannell, M.J. Phelps, K.T., A class of 2-chromatic SQS(22) Piotrowski, W.L., The solution of the bipartite

analogue of the Oberwolfach problem Piper, F., see Jackson, W.-A. Pless, V., Codes and designs-xistence and

uniqueness Plummer, M.D. see Holton, D.A. Plummer, M.D., Matching theory-a sampler:

from D&es Konig to the present

95 255-270

96 (1991) 71- 74

96 (1991) 111-129

94 (1991) 129-140

98 97 97 97

(1991) (1991)

;:;;:;

237-238 319-331 199-202 333-338

97 (1991) 339-356 98 (1991) 23- 28

92 96

(1991) (1991)

261-274 81- 99

100 (1992) 177-219


Polat, N. and G. Sabidussi, Asymmetrising sets in trees

Polat, N., Asymmetrization of infinite trees Pott, A., see Arasu, K.T. Pott, A., see Arasu, K.T. Pouzet, M., see Brochet, J.-M. Praeger, C.E., Balanced directed cycle designs

based on groups Preissmann, M., see Hoang, C.T. Prikry, K., see Milner, E.C. Pritikin, D., see Miller, Z. Promel, H.J., W. Thumser and B. Voigt, Fast

growing functions based on Ramsey theorems

Quebbemann, H.-G., On even codes Quilliot, A., Une condition pour qu’une famille

de triangles soit orientable en un ordre cyclique

Radziszowski, S.P., see De Caen, D. Rahilly, A., On the line structure of designs Redish, K.A. and W.F. Smyth, Closed form

expressions for the iterated floor function (Note)

Reeds, J.A., see Fishburn, P.C. Rees, R. and W.D. Wallis, The spectrum of

maximal sets of one-factors Rees, R., see Lamken, E. Rees, R.S., see Marino, M.C. Rees, R., The spectrum of restricted resolvable

designs with r = 2 Reid, T. J., A note on roundedness in 4-connected

matroids (Note) Remmel, J.B., Formulas for the expansion of the

Kronecker products SC,_) @I Sopmr,rj and ,&~) @ +m’,r)

Reverdy-Vilotitch, F., La reconstruction au sens de Ulam de certaines multirelations binaires (Note)

Ringel, G., see Lenz, H. Roberts, F.S., T-colorings of graphs: recent

results and open problems Robertson, N., P. Seymour and R. Thomas,

Excluding infinite minors

95 (1991) 271-289 95 (1991) 291-301 97 (1991) 25- 38 97 (1991) 39- 45 95 (1991) 23- 47

92 (1991) 275-290 98 (1991) 161-174 95 (1991) 183-191 93 (1991) 211-228

95 (1991) 341-358

98 (1991) 29- 34

91 (1991) 171-182

92 (1991) 65- 77 92 (1991) 291-303

91 (1991) 317-321 91 (1991) 149-159

97 (1991) 357-369 92 (1991) 197-209 97 (1991) 295-300

92 (1991) 305-320

91 (1991) 211-214

99 (1992) 265-287

93 (1991) 89- 95 97 (1991) 3- 16

93 (1991) 229-245

95 (1991) 303-319


Rodger, C.A., see Colbourn, C.J. Rosa, A., see Colbourn, C.J. Roudneff, J.-P., Cells with many facets in

arrangements of hyperplanes Royle, G.F., see Chee, Y.M.

Sabidussi, G., see Polat, N. Sabidussi, G., Correspondence between Sylves-

ter, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891

Sabidussi, G., see Christiansen, M. Sabidussi, G., see Lutzen, J. Sagan, B.E., Inductive proofs of q-log concavity Saito, A., One-factors and k-factors (Note) Sane, S.S., see Pawale, R.M. Sarvate, D.G. and R.C. Hamm, Row-column

directed block designs Sauer, N.W., see El-Zahar, M. Schellenberg, P.J., see Hoffman, D.G. Schindler, C., Constructible hypergraphs Schmeichel, E., see Lee, S.M. Schmidt, W., Greedoids and searches in directed

graphs Schulz, R.-H., A note on check character systems

using Latin squares Schtitzenberger, M.-P., see Lascoux, A. Schwarzler, W., Being Hamiltonian is not a Tutte

invariant (Communication) Schwenk, A., see Manvel, B. Seberry, J., see Koukouvinos, C. Seifter, N., see Imrich, W. Seymour, P. and R. Thomas, An end-faithful

spanning tree counterexample Seymour, P., see Robertson, N. Shader, B.L., see Brualdi, R.A. Shalaby, N., see Colbourn, C.J. Shalaby, N., see Mendelsohn E. Shannon, A.G., J.C. Turner and K.T. Atanassov,

A generalized tableau associated with colored convolution trees

Sharry, M.J. and A.P. Street, Partitioning sets of quadruples into designs III

Shee, S.C., see Lee, S.M.

97 (1991) 139-148 92 (1991) 49- 64

98 (1991) 185-191 97 (1991) 93-100

95 (1991) 271-289

100 (1992) 99-155 100 (1992) 83- 97 100 (1992) 9- 82 99 (1992) 289-306 91 (1991) 323-326 96 (1991) 71- 74

92 (1991) 321-328 94 (1991) l- 10 97 (1991) 243-250 91 (1991) 183-191 93 (1991) 201-209

93 (1991) 75- 88

97 (1991) 371-375 99 (1992) 165-179

91 (1991) 87- 89 94 (1991) 209-219 92 (1991) 173-176 95 (1991) 101-117

95 (1991) 321-330 95 (1991) 303-319 96 (1991) 161-174 92 (1991) 49- 64 97 (1991) 301-317

92 (1991) 329-340

92 (1991) 341-359 93 (1991) 195-200

Master index of volumes 91-1W 17

Shee, S.C., see Lee, S.M. Shen, H., see Bennett, F.E. Shepp, L.A., see Fishburn, P.C. Shepp, L.A., see Fishburn, P.C. Sidorenko, A.F., Triangle-free regular graphs

(Note) Siemon, H., On the existence of cyclic Steiner

Quadruple Systems SQS(2p) Simion, R. and D. Ullman, On the structure of

the lattice of noncrossing partitions Simion, R., see Edelman, P.H. Simmons, H., Generalized deviations of posets Simpson, R.J., Disjoint covering systems of

rational Beatty sequences Sinha, K., see Kageyama, S. Sir&A, J., Characterization of signed graphs which

are cellularly embeddable in no more than one surface

Sit-an, J., Duke’s theorem does not extend to signed graph embeddings (Note)

&ran, J., End-faithful forests and spanning trees in infinite graphs

Skupien, Z., see Marczyk, A. Slater, P.J., see Gibbs, R.A. Smith, C.A.B., see Brooks, R.L. Smith, K., see Manvel, B. Smyth, W.F., see Redish, K.A. Snover, S.L., C. Waiveris and J.K. Williams,

Rep-tiling for triangles Sotirakoglou, K., see Kounias, S. Sotteau, D., see Favaron, 0. Sprott, D.A., see Chamberlin, S.R. Srivastava, J. and S. Arora, An infinite series of

resolution III.2 designs for the 2” factorial experiment

Staton, W., see Erdas, P. Stembridge, J.R., Eulerian numbers, tableaux,

and the Betti numbers of a toric variety Stern, M., Dually atomistic lattices (Note) Stinson, D.R., A survey of Kirkman triple

systems and related designs Stinson, D.R., Designs constructed from maximal

arcs

93 (1991) 201-209 97 (1991) 47- 57 91 (1991) 149-159 98 (1991) 105-122

91 (1991) 215-217

97 (1991) 377-385

98 (1991) 193-206 99 (1992) 63- 68 98 (1991) 123-139

92 (1991) 361-369 92 (1991) 137-144

94 (1991) 39- 44

94 (1991) 233-238

95 (1991) 331-340 96 (1991) 213-220 93 (1991) 155-165

100 (1992) 291-301 94 (1991) 209-219 91 (1991) 317-321

91 (1991) 193-200 92 (1991) 177-185 91 (1991) 311-316 92 (1991) 39- 47

98 (1991) 35- 56 92 (1991) 85- 88

99 (1992) 307-320 93 (1991) 97-100

92 (1991) 371-393

97 (1991) 387-393


Stockmeyer, P., see Manvel, B. Stone, A.H., see Brooks, R.L. Street, A.P., see Sharry, M.J. Strehl, V., Identities of Rothe-Abel-Schlafli-

Hurwitz-type Suen, W.C.S., On the largest strong components

in m-out digraphs Sved, M., The geometry of the binomial array

modulo p2 and p3

Szonyi, T., see Hirschfeld, J.W.P.

Taylor, H., A distinct distance set of 9 nodes in a tree of diameter 36

Taylor, II., Florentine rows or left-right shifted permutation matrices with cross-correlation values cl

Teo, C.P., see Koh, K.M. Thiel, L., see Lam, C.W.H. Thomas, R., see Kiii, I. Thomas, R., see Robertson, N. Thomas, R., see Seymour, P. Thomassen, C., see Petrovic, V. Thumser, W., see Promel, H.J. Toft, B., see Christiansen, M. Toft, B., see Lutzen, J. Tonchev, V.D., see Janko, Z. Topp, J. and L. Volkmann, On graphs with

equal domination and independent domination numbers (Note)

Topp, J. and L. Volkmann, On packing and covering numbers of graphs

Traldi, L., Generalized activities and K-terminal reliability

Truszczynski, M., Decompositions of graphs into forests with bounded maximum degree

Turner, J.C., see Shannon, A.G. Tutte, W.T., On the Birkhoff-Lewis equations Tutte, W.T., see Brooks, R.L. Tuza, Z., see Erdos, P. Tuza, Zs., see Biro, M.

94 (1991) 209-219 100 (1992) 291-301

92 (1991) 341-359

99 (1992) 321-340

94 (1991) 45- 52

92 (1991) 395-416 97 (1991) 229-242

93 (1991) 167-168

93 96 92 95 95 95 98 95

100 100 -97

(1991) (1991)

I:;;:; (1991) (1991) (1991) (1991) (1992) (1992) (1991)

247-260 65- 69

187-195 135-167 303-319 321-330 237-238 341-358

83- 97 9- 82

265-268

96 (1991) 75- 80

96 (1991) 229-238

96 (1991) 131-149

98 (1991) 207-222 92 (1991) 329-340 92 (1991) 417-425

100 (1992) 291-301 98 (1991) 95-104

100 (1992) 267-279

Ullman, D., see Simion, R. 98 (1991) 193-206


Vacirca, V., see Gionfriddo, M. Van Rees, G.H.J., see Kocay, W. Vanstone, S., see Jungnickel, D. Vanstone, S., see Lamken, E. Vanstone, S.A., see Jungnickel, D. van Trung, T. , see Kramer, E.S. Veldman, H.J., see Bauer, D. Versmissen, K., Monohedral periodic tilings of

the plane with any number of aspects (Note) Vijayan, K., see Caccetta, L. Vijayan, K., see Caccetta, L. Voigt, B., see Promel, H.J. Voigt, M. and H. Walther, On the chromatic

number of special distance graphs Volkmann, L., see Topp, J. Volkmann, L., see Topp, J. Voxman, B., see Bialostocki, A.

Wachs, M.L., An involution for signed Eulerian numbers

Wachs, M.L., see Liang, K. Wachs, M.L., The major index polynomial for

conjugacy classes of permutations Wagneur, E., Moduldids and pseudomodules 1.

Dimension theory Waiveris, C., see Snover, S.L. Wallis, W.D. and J. Wu, On clique partitions of

split graphs Wallis, W.D., see Rees, R. Walther, H., see Voigt, M. Wang, J., see Alavi, Y. Watanabe, M., Arrow relations on families of

finite sets Watkins, M.E., Edge-transitive strips Wevrick, D., see Mullin, R.C. White, D., see Edelman, P.H. Wilbrink, H., see Blokhuis, A. Wild, P., see Jackson, W.-A. Williams, H.C., Some formulas concerning the

fundamental unit of a real quadratic field Williams, J.K., see Snover, S.L. Wilson, B.J., Minimax arcs Wilson, R.J., see Chartrand, G.

97 (1991) 191-198 92 (1991) 159-172 92 (1991) 131-135 92 (1991) 197-209 97 (1991) 269-277 96 (1991) 101-110 96 (1991) 33- 49

93 (1991) 101-108 97 (1991) 69- 81 98 (1991) l- 7 95 (1991) 341-358

97 (1991) 395-397 96 (1991) 75- 80 96 (1991) 229-238 91 (1991) 231-238

99 (1992) 59- 62 99 (1992) 181-197

91 (1991) 283-293

98 (1991) 57- 73 91 (1991) 193-200

92 (1991) 427-429 97 (1991) 357-369 97 (1991) 395-397

100 (1992) 229-233

94 (1991) 53- 64 95 (1991) 359-372 92 (1991) 221-225 99 (1992) 63- 68 97 (1991) 63- 68 98 (1991) 23- 28

92 (1991) 431-440 91 (1991) 193-200 92 (1991) 441-450

100 (1992) 303-311

20 Maser index of volumes 91- 100

Woess, W., Topological groups and infinite graphs

Woldar, A., see Ebert, G. Wu, J., see Walk, W.D. Wu, Q.-R., see Kramer, E.S.

Xu, S., The chromatic uniqueness of complete bipartite graphs (Note)

Yu, X., On neighbourhood line graphs

Zeitler, H., About special classes of Steiner systems S(2, 4, 21)

Zhang, C.-Q. and Y.-J. Zhu, Long path connectivity of regular graphs

Zhang, F., see Li, X. Zhang, X., see Zhu, L. Zhang, Z., see Alavi, Y. Zhou, B., see Abbott, H.L. Zhu, L., B. Du and X. Zhang, A few more

RBIBDs with k = 5 and A = 1 Zhu, Y.-J., see Zhang, C.-Q.

95 (1991) 373-384 93 (1991) 131-142 92 (1991) 427-429 96 (1991) 101-110

94 (1991) 153-159

91 (1991) 295-309

97 (1991) 399-407

96 (1991) 151-160 94 (1991) 189-197 97 (1991) 409-417

100 (1992) 229-233 100 (1992) 223-228

97 (1991) 409-417 96 (1991) 151-160

master index of volumes 91-100 - core

Documents