author index volumes 1–200 - connecting repositories · 2017-02-25 · author index volumes...

Discrete Mathematics 227/228 (2001) 449–648

Author Index Volumes 1–200

(For the sake of simplicity and uniformity, all names beginning with articles or prepositions are listed asif written as single words.)

Aaltonen, M., A new upper bound on nonbinary block codes83 (1990) 139–160Aaron Gulliver, T.,seeM. Harada 188(1-3) (1998) 127–136Aarts, E.H.L. and P.J.M. van Laarhoven, Local search in coding theory106/107(1992) 11–18Abad, M.,seeL.F. Monteiro 189(1-3) (1998) 177–189Abbott, H. and M. Katchalski, A Turán type problem for interval graphs (Note) 25 (1979) 85–88Abbott, H.L., Lower bounds for some Ramsey numbers2 (1972) 289–293Abbott, H.L. and D. Hanson, On finite1-systems 8 (1974) 1–12Abbott, H.L., Some results in combinatorial geometry9 (1974) 199–204Abbott, H.L. and D. Hanson, On a combinatorial problem in geometry (Note) 12 (1975) 389–392Abbott, H.L. and A.C. Liu, Ramsey numbers for triples13 (1975) 299–305Abbott, H.L. and D. Hanson, On finite1-systems II 17 (1977) 121–126Abbott, H.L. and A.C. Liu, Bounds for the covering number of a graph (Note) 25 (1979) 281–284Abbott, H.L. and A.C. Liu, On propertyB(s), II 37 (1981) 135–141Abbott, H.L. and A. Liu, Remarks on a paper of Hirschfeld concerning Ramsey numbers (Note) 39 (1982)

327–328Abbott, H.L. and M. Katchalski, Further results on snakes in powers of complete graphs91 (1991) 111–120Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs ofk-critical graphs 100

(1992) 223–228Abbott, H.L., M. Katchalski and B. Zhou, Proof of a conjecture of Dirac concerning 4-critical planar graphs132

(1-3) (1994) 367–371Abbott, H.L., D.R. Hare and B. Zhou, Color-critical graphs and hypergraphs with few edges and no short cycles

182(1-3) (1998) 3–11Abbott, H.L. and D.R. Hare, Square critically 3-chromatic hypergraphs197-198(1-3) (1999) 3–13Abbout, H.L. and M. Katchalski, Snakes and pseudo-snakes in powers of complete graphs68 (1988) 1–8Abbw-Jackson, D.,seeS. Fisk 32 (1980) 19–25Abe, G., Unsolved problems on magic squares127(1-3) (1994) 3–13Abel, R.J.R. and H. Zhang, Direct constructions for certain types of HMOLS181(1-3) (1998) 1–17Abel, R.J.R. and F.E. Bennett, The existence of perfect Mendelsohn designs with block size 7190(1-3) (1998)

1–14Abels, H., A projection property for buildings192(1-3) (1998) 3–10Abhyankar, S.S. and D.M. Kulkarni, Bijection between indexed monomials and standard bitableaux (Invited

paper) 79 (1989/90) 1–48Abhyankar, S.S. and D.M. Kulkarni, Coinsertion and standard bitableaux85 (1990) 115–166Abhyankar, S.S. and S.B. Joshi, Generalized roinsertive correspondence between multitableaux and multimono-

mials 90 (1991) 111–135

Elsevier Science B.V.

450 Author Index Volumes 1–200 / Discrete Mathematics 227/228 (2001) 449–648

Abhyankar, S.S. and S.B. Joshi, Generalized rodeletive correspondence between multitableaux and multimono-mials 93 (1991) 1–17

Abhyankar, S.S. and S.R. Ghorpade, Young tableaux and linear independence of standard monomials inmultiminors of multimatrix 96 (1991) 1–32

Abhyankar, S.S., Wreath products and enlargements of groups120(1993) 1–12Abhyankar, S.S. and I. Yie, Small degree coverings of the affine line in characteristic two133(1-3) (1994) 1–23Abhyankar, S.S., J. Ou and A. Sathaye, Alternating group coverings of the affine line for characteristic two133

(1-3) (1994) 25–46Abramov, S.A., P. Paule and M. Petkovšek,q-Hypergeometric solutions ofq-difference equations 180 (1-3)

(1998) 3–22Abrams, A., Thekth upper chromatic number of the line169(1-3) (1997) 157–162Abramson, M. and W.O.J. Moser, Arrays with fixed row and column sums6 (1973) 1–14Abramson, M., Enumeration of sequences by levels and rises12 (1975) 101–112Ábrego, B., J.L. Arocha, S. Fernández-Merchant and V. Neumann-Lara, Tightness problems in the plane194

(1-3) (1999) 1–11Abrham, J. and A. Kotzig, Skolem sequences and additive permutations37 (1981) 143–146Abrham, J. and A. Kotzig, Inequalities for perfect systems of difference sets (Note) 52 (1984) 287–291Abrham, J., Graceful 2-regular graphs and Skolem sequences93 (1991) 115–121Abrham, J. and A. Kotzig, All 2-regular graphs consisting of 4-cycles are graceful135(1-3) (1994) 1–14Abrham, J. and A. Kotzig, Graceful valuations of 2-regular graphs with two components150(1-3) (1996) 3–15Abu-Sbeih, M.Z., Generalizing the duality theorem of graph embeddings78 (1989) 11–23Abu-Sbeih, M.Z., On the number of spanning trees ofKn andKm,n (Note) 84 (1990) 205–207Acenjian, T.,seeX.-r. Yong 169(1-3) (1997) 293–298Achache, A. and A.A.L. Sangalli, Préordres, résiduation et espaces de fermeture130(1-3) (1994) 3–7Acharya, B.D., On the cyclomatic number of a hypergraph27 (1979) 111–116Acharya, B.D., Connected graphs switching equivalent to their iterated line graphs41 (1982) 115–122Acharya, B.D. and S.M. Hegde, Strongly indexable graphs93 (1991) 123–129Acharya, B.D. and P. Gupta, On point-set domination in graphs IV: Separable graphs with unique minimum

psd-sets 195(1-3) (1999) 1–13Achlioptas, D., The complexity ofG-free colourability 165-166(1-3) (1997) 21–30Achlioptas, D., J.I. Brown, D.G. Corneil and M.S.O. Molloy, The existence of uniquely -G colourable graphs

179(1-3) (1998) 1–11Achuthan, N., N.R. Achuthan and L. Caccetta, On mixed Ramsey numbers151(1-3) (1996) 3–13Achuthan, N.R.,seeN. Achuthan 151(1-3) (1996) 3–13Acketa, D.M., On binary paving matroids (Note) 70 (1988) 109–110Acketa, D.M.,seeS. Matic-Kekic 150(1-3) (1996) 303–313Acketa, D.M. and V. Mudrinski, Two 5-designs on 32 points (Note) 163(1-3) (1997) 209–210Adamec, R., M. Klazar and P. Valtr, Generalized Davenport–Schinzel sequences with linear upper bound108

(1992) 219–229Adámek, J. and J. Rosický, On orthogonal subcategories of locally presentable categories108(1992) 133–137Adams, M.E. and H.A. Priestley, De Morgan algebras are universal66 (1987) 1–13Adams, M.E. and W. Dziobiak, Quasivarieties of distributive lattices with a quantifier135(1-3) (1994) 15–28Adams, P., E.J. Billington and D.E. Bryant, Partitionable perfect cycle systems with cycle lengths 6 and 8149

(1-3) (1996) 1–9Adelberg, A., A finite difference approach to degenerate Bernoulli and Stirling polynomials140 (1-3) (1995)

1–21Adelgren, T., Triangle-free eulerian tours in graphs with maximum degree at most 4138(1-3) (1995) 5–14Adin, R.M., A new cubicalh-vector 157(1-3) (1996) 3–14Adleman, L., Short permutation strings10 (1974) 197–200Aït Haddadène, H., S. Gravier and F. Maffray, An algorithm for coloring some perfect graphs183(1-3) (1998)

1–16Ageev, A.A., A triangle-free circle graph with chromatic number 5152(1-3) (1996) 295–298Ageev, A.A., Every circle graph of girth at least 5 is 3-colourable195(1-3) (1999) 229–233Aguiló, F.,seeP. Esqué 114(1993) 147–157Aguiló, F. and M.A. Fiol, An efficient algorithm to find optimal double loop networks138(1-3) (1995) 15–29

Author Index Volumes 1–200 / Discrete Mathematics 227/228 (2001) 449–648 451

Aguiló, F., M.A. Fiol and C. Garcia, Triple loop networks with small transmission delay167-168(1-3) (1997)3–16

Aguiló-Gost, F., New dense families of triple loop networks197-198(1-3) (1999) 15–27Agur, Z., A.S. Fraenkel and S.T. Klein, The number of fixed points of the majority rule70 (1988) 295–302Aharoni, R., A problem in rearrangements of (0, 1) matrices30 (1980) 191–201Aharoni, R., A principle of symmetry in networks 44 (1983) 1–11Aharoni, R., B. Wajnryb and R. Manber, Special parity of perfect matchings in bipartite graphs79 (1989/90)

221–228Aharoni, R. and O. Kessler, On a possible extension of Hall’s theorem to bipartite hypergraphs (Note) 84(1990)

309–313Aharoni, R., Infinite matching theory95 (1991) 5–22Aharoni, R. and I. Ben-Arroyo Hartman, On Greene–Kleitman’s theorem for general digraphs120(1993) 13–

24Aharoni, R. and V. Korman, Strong LP duality in weighted infinite bipartite graphs131(1-3) (1994) 1–7Aharoni, R. and U. Keich, A generalization of the Ahlswede–Daykin inequality152(1-3) (1996) 1–12Aharoni, R., G.T. Herman and A. Kuba, Binary vectors partially determined by linear equation systems171

(1-3) (1997) 1–16Ahlswede, R. and G.O.H. Katona, Contributions to the geometry of Hamming spaces17 (1977) 1–22Ahlswede, R. and K.U. Koschnick, Note on an extremal problem arising for unreliable networks in parallel

computing 47 (1983) 137–152Ahlswede, R., A. El Gamal and K.F. Pang, A two-family extremal problem in Hamming space49 (1984) 1–5Ahlswede, R. and Z. Zhang, On cloud-antichains and related configurations85 (1990) 225–245Ahlswede, R. and G. Simonyi, On the optimal structure of recovering set pairs in lattices: the sandglass conjecture

128(1-3) (1994) 389–394Ahlswede, R. and L.H. Khachatrian, The maximal length of cloud-antichains131(1-3) (1994) 9–15Ahlswede, R. and L.H. Khachatrian, A counterexample to Aharoni’s strongly maximal matching conjecture149

(1-3) (1996) 289Ahlswede, R. and Z. Zhang, Code pairs with specified parity of the Hamming distances188(1-3) (1998) 1–11Aigner, M., Producing posets35 (1981) 1–15Aigner, M., D. Duffus and D.J. Kleitman, Partitioning a power set into union-free classes88 (1991) 113–119Aigner, M. and E. Triesch, Realizability and uniqueness in graphs136(1-3) (1994) 3–20Aigner, M., E. Triesch and Z. Tuza, Searching for acyclic orientations of graphs144(1-3) (1995) 3–10Aigner, M.S., The double selection problem73 (1988/89) 3–12Ainouche, A., Four sufficient conditions for hamiltonian graphs (Communication) 89 (1991) 195–200Ainouche, A., A common generalization of Chvátal–Erdos’ and Fraisse’s sufficient conditions for hamiltonian

graphs 142(1-3) (1995) 1–19Ainouche, A., Quasi-claw-free graphs179(1-3) (1998) 13–26Ainouche, A., O. Favaron and H. Li, Global insertion and hamiltonicity in DCT-graphs184(1-3) (1998) 1–13Ait Haddadene, H. and S. Gravier, On weakly diamond-free Berge graphs159(1-3) (1996) 237–240Ajoodani-Namini, S. and G.B. Khosrovashahi, More on halving the complete designs135(1-3) (1994) 29–37Ajoodani-Namini, S., All block designs withb = (v

k)/2 exist 179(1-3) (1998) 27–35

Akemann, C.A. and J. Anderson, The continuous Beck–Fiala theorem is optimal146(1-3) (1995) 1–9Akiyama, J. and T. Hamada, The decompositions of line graphs, middle graphs and total graphs of complete

graphs into forests 26 (1979) 203–208Akiyama, J., H. Era and G. Exoo, Further results on graph equations for line graphs andn-th power graphs 34

(1981) 209–218Akiyama, J., K. Ando and D. Avis, Eccentric graphs56 (1985) 1–6Akiyama, J., F. Nakada and S. Tokunaga, Packing smaller graphs into a graph75 (1989) 7–9Akiyama, J. and J. Urrutia, A note on balanced colourings for lattice points (Note) 83 (1990) 123–126Akiyama, J. and J. Urrutia, Simple alternating path problem (Note) 84 (1990) 101–103Akiyama, J. and V. Chvátal, Packing paths perfectly85 (1990) 247–255Akiyama, J., K. Hosono and M. Urabe, Some combinatorial problems116(1993) 291–298Akiyama, J., Y. Ishigami, M. Urabe and J. Urrutia, On circles containing the maximum number of points151

(1-3) (1996) 15–18Akkari, S., A minimal 3-connectedness result for matroids103(1992) 221–232


Akkari, S., Random packing by matroid bases and triangles145(1-3) (1995) 1–9Aksionov, V.A., On uniquely 3-colorable planar graphs20 (1977) 209–216Alarcon, E., An extremal result on convex lattice polygons190(1-3) (1998) 227–234Alavi, Y., G. Chartrand, O.R. Oellermann and L. Lesniak, Bipartite regulation numbers62 (1986) 113–118Alavi, Y., F. Buckley, M. Shamula and S. Ruiz, Highly irregularm-chromatic graph 72 (1988) 3–13Alavi, Y., J. Liu, J. Wang and Z. Zhang, On total covers of graphs100(1992) 229–233Alavi, Y., J. Liu and J. Wang, Highly irregular digraphs111(1993) 3–10Albert, M.H. and A.M. Frieze, Occupancy problems and random algebras87 (1991) 1–8Albertson, M.O., A case of Hadwiger’s Conjecture4 (1973) 197–199Albertson, M.O. and J.P. Hutchinson, Hadwiger’s conjecture for graphs on the Klein bottle29 (1980) 1–11Albertson, M.O. and D.M. Berman, Critical graphs for chromatic difference sequences31 (1980) 225–233Albertson, M.O. and K.L. Collins, Homomorphisms of 3-chromatic graphs54 (1985) 127–132Albertson, M.O., R.E. Jamison, S.T. Hedetniemi and S.C. Locke, The subchromatic number of a graph74

(1989) 33–49Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree (Note) 89

(1991) 97–100Albertson, M.O., Turán theorems with repeated degrees100(1992) 235–241Albertson, M.O. and D.L. Boutin, Lower bounds for constant degree independent sets127(1-3) (1994) 15–21Albertson, M.O. and R. Haas, Parsimonious edge coloring148(1-3) (1996) 1–7Albertson, M.O. and R. Haas, The edge chromatic difference sequence of a cubic graph177(1-3) (1997) 1–8Albu, T., Classes of lattices (co)generated by a lattice and their global (dual) Krull dimension185(1-3) (1998)

1–18Aldous, D., The harmonic mean formula for probabilities of unions: Applications to sparse random graphs76

(1989) 167–176Aldred, R.E.L., B. Jackson, D. Lou and A. Saito, Partitioning regular graphs into equicardinal linear forests88

(1991) 1–9Aldred, R.E.L., D.A. Holton and Z. Ke Min, A degree characterisation of pancyclicity127(1-3) (1994) 23–29Aldred, R.E.L. and R.P. Anstee, On the density of sets of divisors137(1-3) (1995) 345–349Aldred, R.E.L. and M.D. Plummer, On matching extensions with prescribed and proscribed edge sets II197-

198(1-3) (1999) 29–40Alekseyevskaya, T.V., Combinatorial bases in systems of simplices and chambers157(1-3) (1996) 15–37Alekseyevskaya, T.V. and I.M. Gelfand, Incidence matrices, geometrical bases, combinatorial prebases and

matroids 180(1-3) (1998) 23–44Alevras, D., Order preserving assignments without contiguity163(1-3) (1997) 1–11Alexanderson, G.L. and J.E. Wetzel, Arrangements of planes in space34 (1981) 219–240Alexanderson, G.L. and J.E. Wetzel, A simplicial 3-arrangement of 21 planes60 (1986) 67–73Alexanderson, G.L. and J.E. Wetzel, Ond-arrangements associated with a simplex (Note) 62 (1986) 325–328Alfano, J., A basis for theY1 subspace of diagonal harmonic polynomials193(1-3) (1998) 17–31Alfonsin, J.R.,seeC.J.H. McDiarmid 125(1994) 279–287Algor, I. and N. Alon, The star Arboricity of craphs75 (1989) 11–22Alladi, K., P. Erdös and V.E. Hoggatt Jr., On additive partitions of integers22 (1978) 201–211Alladi, K., A variation on a theme of Sylvester — a smoother road to Göllnitz’s (Big) theorem196(1-3) (1999)

1–11Allan, R.B. and R. Laskar, On domination and independent domination numbers of a graph23 (1978) 73–76Allan, R.B., R. Laskar and S. Hedetniemi, A note on total domination49 (1984) 7–13Allen, E.E., A conjecture of a basis for the diagonal harmonic alternants193(1-3) (1998) 33–42Allen, S.M., D.H. Smith and S. Hurley, Lower bounding techniques for frequency assignment197-198(1-3)

(1999) 41–52Alles, P., The dimension of sums of graphs (Note) 54 (1985) 229–233Allouche, J.-P., A. Arnold, J. Berstel, S. Brlek, W. Jockusch, S. Plouffe and B.E. Sagan, A relative of the Thue–

Morse sequence139(1-3) (1995) 455–461Alon, N., On the density of sets of vectors (Note) 46 (1983) 199–202Alon, N., A note on subdigraphs of digraphs with large outdegrees (Communication) 49 (1984) 321–322Alon, N., Explicit construction of exponential sized families ofk-independent sets (Note) 58 (1986) 191–193Alon, N. and M.A. Perles, On the intersection of edges of a geometric graph by straight lines60 (1986) 75–90


Alon, N., Sums of subsequences modulo prime powers (Communication) 71 (1988) 87–88Alon, N. and F.R.K. Chung, Explicit construction of linear sized tolerant networks72 (1988) 15–19Alon, N., seeI. Algor 75 (1989) 11–22Alon, N. and B. Bollobás, Graphs with a small number of distinct induced subgraphs75 (1989) 23–30Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles103(1992) 111–119Alon, N., Y. Caro and I. Krasikov, Bisection of trees and sequences114(1993) 3–7Alon, N., Probabilistic methods in coloring and decomposition problems127(1-3) (1994) 31–46Alon, N. and E. Fischer, 2-factors in dense graphs152(1-3) (1996) 13–23Alon, N., Zs. Tuza and M. Voigt, Choosability and fractional chromatic numbers165-166(1-3) (1997) 31–38Alon, N., Packings with large minimum kissing numbers175(1-3) (1997) 249–251Alon, N. and E. Halperin, Bipartite subgraphs of integer weighted graphs181(1-3) (1998) 19–29Alperin, J.L., Trees and Brauer trees (Note) 83 (1990) 127–128Alpin, J. and R. Mubarakzianow, The bases of weighted graphs175(1-3) (1997) 1–11Alsardary, S.Y. and J. Wojciechowski, The basis number of the powers of the complete graph188(1-3) (1998)

13–25Alspach, B., L.T. Ollmann and K.B. Reid, Mutually disjoint families of 0–1 sequences12 (1975) 205–209Alspach, B. and M. Rosenfeld, On embedding triangle-free graphs in unit spheres19 (1977) 103–111Alspach, B. and T.D. Parsons, Isomorphism of circulant graphs and digraphs25 (1979) 97–108Alspach, B. and M. Rosenfeld, Realization of certain generalized paths in tournaments (Note) 34 (1981) 199–

202Alspach, B., Lifting Hamilton cycles of quotient graphs78 (1989) 25–36Alspach, B., S.C. Locke and D. Witte, The Hamilton spaces of Cayley graphs on abelian groups82 (1990)

113–126Alspach, B. and D. Hare, Edge-pancyclic block-intersection graphs97 (1991) 17–24Alspach, B. and C.-Q. Zhang, Cycle covers of cubic multigraphs111(1993) 11–17Alspach, B., C.C. Chen and K. McAvaney, On a class of Hamiltonian laceable 3-regular graphs151(1-3) (1996)

19–38Alspach, B., Research problems162(1-3) (1996) 325–328Alspach, B., Research problems186(1-3) (1998) 297–298Alter, R. and Chung.C. Wang, Uniquely intersectable graphs18 (1977) 217–226Althöfer, I. and E. Triesch, Edge search in graphs and hypergraphs of bounded rank115(1993) 1–9Althöfer, I. and M. Löwe, Edge search in hypergraphs162(1-3) (1996) 267–271Altshuler, A., Polyhedral realization inR3 of triangulations of the torus and 2-manifolds in cyclic 4-polytopes

1 (1971) 211–238Altshuler, A., Hamiltonian circuits in some maps on the torus1 (1972) 299–314Altshuler, A., Construction and enumeration of regular maps on the torus4 (1973) 201–217Altshuler, A. and L. Steinberg, Neighborly combinatorial 3-manifolds with 9 vertices8 (1974) 113–137Altshuler, A. and L. Steinberg, An enumeration of combinatorial 3-manifolds with nine vertices16 (1976)

91–108Altshuler, A., J. Bokowski and L. Steinberg, The classification of simplicial 3-spheres with nine vertices into

polytopes and nonpolytopes31 (1980) 115–124Aluffi, P., A blow-up construction and graph coloring145(1-3) (1995) 11–35Alzer, H., An inequality for increasing sequences and its integral analogue133(1-3) (1994) 279–283Alzer, H., Refinement of an inequality of G. Bennett135(1-3) (1994) 39–46Amahashi, A. and M. Kano, On factors with given components42 (1982) 1–6Amar, D., E. Flandrin, I. Fournier and A. Germa, Hamiltonian pancyclic graphs (Communication) 46 (1983)

327Amar, D., Partition of a bipartite hamiltonian graph into two cycles58 (1986) 1–10Amar, D. and A. Raspaud, Covering the vertices of a digraph by cycles of prescribed length87 (1991) 111–118Amar, D., E. Flandrin, I. Fournier and A. Germa, Pancyclism in hamiltonian graphs89 (1991) 111–131Amar, D., A condition for a hamiltonian bipartite graph to be bipancyclic102(1992) 221–227Amar, D.,seeY. Manoussakis 105(1992) 157–172Amar, D., Applying a condition for a hamiltonian bipartite graph to be bipancyclic111(1993) 19–25Amar, D., Irregularity strength of regular graphs of large degree114(1993) 9–17Amar, D.,seeO. Ordaz 161(1-3) (1996) 207–215


Amar, D., S. Brandt, D. Brito and O. Ordaz, Neighborhood conditions for balanced independent sets in bipartitegraphs 181(1-3) (1998) 31–36

Amar, D. and O. Togni, Irregularity strength of trees190(1-3) (1998) 15–38Amin, A.T., L.H. Clark and P.J. Slater, Parity dimension for graphs187(1-3) (1998) 1–17Anacker, S.E., The reconstruction of separable graphs with 2-connected trunks that are series-parallel networks

70 (1988) 257–275Ananchuen, N. and L. Caccetta, Matching extension and minimum degree170(1-3) (1997) 1–13Andersen, L.D., Lower bounds on the cover-index of a graph25 (1979) 199–210Andersen, L.D. and A.J.W. Hilton, Generalized latin rectangles I: Construction and decomposition31 (1980)

125–152Andersen, L.D. and A.J.W. Hilton, Generalized latin rectangles II: Embedding31 (1980) 235–260Andersen, L.D., The strong chromatic index of a cubic graph is at most 10108(1992) 231–252Andersen, L.D. and P.D. Vestergaard, Graphs with all spanning trees nonisomorphic155(1-3) (1996) 3–12Andersen, L.D. and A.J.W. Hilton, Triangulations of 3-way regular tripartite graphs of degree 4, with applications

to orthogonal latin squares167-168(1-3) (1997) 17–34Anderson, B.A., Symmetry groups of some perfect 1-factorizations of complete graphs18 (1977) 227–234Anderson, B.A., K.B. Gross and P.A. Leonard, Some Howell Designs of prime side28 (1979) 113–134Anderson, B.A. and P.A. Leonard, Some Howell Designs of prime side II37 (1981) 1–18Anderson, B.A., A product theorem for 2-sequencings87 (1991) 221–236Anderson, I., Intersection theorems and a lemma of Kleitman16 (1976) 181–185Anderson, I., An Erdös–Ko–Rado theorem for multisets69 (1988) 1–9Anderson, I. and N.J. Finizio, Cyclic Whist tournaments125(1994) 5–10Anderson, I., S.D. Cohen and N.J. Finizio, An existence theorem for cyclic triplewhist tournaments138 (1-3)

(1995) 31–41Anderson, I., On the construction of balanced Room squares197-198(1-3) (1999) 53–60Anderson, J.,seeC.A. Akemann 146(1-3) (1995) 1–9Anderson, M.R.,seeR.B. Hughes 117(1993) 253–256Anderson, M.R.,seeR.B. Hughes 158(1-3) (1996) 99–150Ando, K.,seeJ. Akiyama 56 (1985) 1–6Ando, K., Y. Egawa and H. Mizuno, GraphsG for which G and G are both semidecomposable65 (1987)

109–114Ando, K. and Y. Usami, Critically(k, k)-connected graphs66 (1987) 15–20Ando, K., S. Gervacio and M. Kano, Disjoint subsets of integers having a constant sum82 (1990) 7–11Ando, K., An upper bound for orders of certain (k, k)-connected graphs135(1-3) (1994) 371–375Ando, K., S. Fujishige and T. Naitoh, A characterization of bisubmodular functions148(1-3) (1996) 299–303Ando, K., A. Kaneko and S. Gervacio, The bandwidth of a tree withk leaves is at mostd k2e 150 (1-3) (1996)

403–406Ando, K. and A. Kaneko, A remark on the connectivity of the complement of a 3-connected graph151 (1-3)

(1996) 39–47Ando, K. and Y. Egawa, The minimum number of edges in a vertex diameter-2-critical graph167-168(1-3)

(1997) 35–63Andrásfai, B., P. Erdös and V.T. Sós, On the connection between chromatic number, maximal clique and minimal

degree of a graph 8 (1974) 205–218Andreae, T., On a problem of R. Halin concerning infinite graphs23 (1978) 1–15Andreae, T., On a problem of R. Halin concerning infinite graphs II29 (1980) 219–227Andreae, T., Reconstructing the degree sequence and the number of components of an infinite graph39 (1982)

1–7Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs

88 (1991) 11–20Andreae, T., A search problem on graphs which generalizes some group testing problems with two defectives

88 (1991) 121–127Andreae, T., On independent cycles and edges in graphs149(1-3) (1996) 291–297Andreae, T. and C. Flotow, On covering all cliques of a chordal graph149(1-3) (1996) 299–302Andreae, T., On the clique-transversal number of chordal graphs191(1-3) (1998) 3–11


Andresen, E. and K. Kjeldsen, On certain subgraphs of a complete transitively directed graph14 (1976) 103–119

Andrews, G.E., Identities in combinatorics, I: On sorting two ordered sets11 (1975) 97–106Andrews, G.E. and D.M. Bressoud, Identities in combinatorics III: Further aspects of ordered set sorting49

(1984) 223–236Andrews, G.E., Pfaff’s method (I): The Mills–Robbins–Rumsey determinant193(1-3) (1998) 43–60Andrzejak, A., An algorithm for the Tutte polynomials of graphs of bounded treewidth190(1-3) (1998) 39–54Anstee, R.P., Triangular (0,1)-matrices with prescribed row and column sums40 (1982) 1–10Anstee, R.P., The network flows approach for matrices with given row and column sums44 (1983) 125–138Anstee, R.P. and U.S.R. Murty, Matrices with forbidden subconfigurations (Note) 54 (1985) 113–116Anstee, R.P. and Z. Füredi, Forbidden submatrices62 (1986) 225–243Anstee, R.P.,seeR.E.L. Aldred 137(1-3) (1995) 345–349Anstee, R.P. and J.R. Griggs, An application of matching theory of edge-colourings156(1-3) (1996) 253–256Anstee, R.P. and A. Sali, Sperner families of bounded VC-dimension175(1-3) (1997) 13–21Anstee, R.P. and L. Caccetta, Orthogonal matchings179(1-3) (1998) 37–47Anstee, R.P. and Y. Nam, More sufficient conditions for a graph to have factors184(1-3) (1998) 15–24Anthony, M. and N. Biggs, The mean chromatic number of paths and cycles (Note) 120(1993) 227–231Anthony, M., On the mean chromatic number125(1994) 11–14Anthony, M., G. Brightwell and C. Cooper, The Vapnik–Chervonenkis Dimension of a Random Graph138

(1-3) (1995) 43–56Aoki, Y., The star-arboricity of the complete regular multipartite graphs81 (1990) 115–122Apartsin, A., E. Ferapontova and V. Gurvich, A circular graph — counterexample to the Duchet kernel conjecture

178(1-3) (1998) 229–231Appel, K. and W. Haken, A proof of the four color theorem (Special announcement) 16 (1976) 179–180Arasu, K.T., Number theoretic consequences on the parameters of a symmetric design65 (1987) 1–4Arasu, K.T., Cyclic affine planes of even order76 (1989) 177–181Arasu, K.T., D. Jungnickel and A. Pott, Symmetric divisible designs withk− λ1= 1 97 (1991) 25–38Arasu, K.T. and A. Pott, Some constructions of group divisible designs with Singer groups97 (1991) 39–45Arasu, K.T. and A. Pott, Cyclic affine planes and Paley difference sets106/107(1992) 19–23Arasu, K.T., D. Jungnickel, S.L. Ma and A. Pott, Relative difference sets withn= 2 147(1-3) (1995) 1–17Aravamudhan, R. and B. Rajendran, On antipodal graphs (Note) 49 (1984) 193–195Aravamudhan, R. and B. Rajendran, A note on ‘On antipodal graphs’ (Note) 58 (1986) 303–305Arbouz, P., Permutations representatives d’un graphe a seuil (Communication) 50 (1984) 109–112Archdeacon, D. and J.H. Dinitz, Constructing indecomposable 1-factorizations of the complete multigraph92

(1991) 9–19Archdeacon, D., The medial graph and voltage-current duality104(1992) 111–141Archdeacon, D. and J. Dinitz, Indecomposable triple systems exist for all lambda113(1993) 1–6Archdeacon, D. and D.A. Grable, The genus of a random graph142(1-3) (1995) 21–37Archdeacon, D.,seeJ. Chen 149(1-3) (1996) 19–29Arditti, J.-C., Denombrement des arborescences dont le graphe de comparabilite est hamiltonien5 (1973) 189–

200Arkin, E.M. and R. Hassin, Graph partitions with minimum degree constraints190(1-3) (1998) 55–65Armanious, M.H., Construction of nilpotent sloops of classn 171(1-3) (1997) 17–25Arnborg, S., A. Proskurowski and D.G. Corneil, Forbidden minors characterization of partial 3-trees80 (1990)

1–19Arnold, A., seeJ.-P. Allouche 139(1-3) (1995) 455–461Arocha, J.L.,seeB. Ábrego 194(1-3) (1999) 1–11Arora, S.,seeJ. Srivastava 98 (1991) 35–56Arques, D., Les hypercartes planaires sont des arbres tres bien etiquetes58 (1986) 11–24Arrowsmith, D.K., M.A.A. Cox and J.W. Essam, The family ofD-weights for a two-rooted graph27 (1979)

215–223Arugay, E.B. and S.V. Gervacio, On path-chromatically unique graphs151(1-3) (1996) 49–53Arumugam, S. and K.A. Germina, On indexable graphs161(1-3) (1996) 285–289Arumugam, S. and J.S. Suseela, Acyclic graphoidal covers and path partitions in a graph190 (1-3) (1998)

67–77


Asano, T., N. Saito, G. Exoo and F. Harary, The smallest 2-connected cubic bipartite planar nonhamiltonian graph38 (1982) 1–6

Ash, P., The maximum number of diagonals of a cycle in a block (Note) 55 (1985) 305–309Aslam, M.,seeQ. Mushtaq 179(1-3) (1998) 145–154Asmerom, G.A., Imbeddings of the tensor product of graphs where the second factor is a complete graph182

(1-3) (1998) 13–19Assaf, A.M., On the covering of pairs by quadruples61 (1986) 119–132Assaf, A.M. and A. Hartman, Resolvable group divisible designs with block size 377 (1989) 5–20Assaf, A.M. and A. Hartman, On packing designs with block size 5 and index 479 (1989/90) 111–121Assaf, A.M., The packing of pairs by quadruples90 (1991) 221–231Assaf, A.M., A. Hartman and N. Shalaby, Packing designs with block size 6 and index 5103(1992) 121–128Assaf, A.M. and L.P.S. Singh, Packing pairs by quintuples with index 2:v odd,v 6≡ 13 (mod 20) 126 (1994)

1–12Assaf, A.M., Bipacking pairs by quintuples: The caseν ≡ 13 (mod 20) 133(1-3) (1994) 47–54Assaf, A.M., Directed covering with block size 5 and index even188(1-3) (1998) 27–40Assaf, A.M. and R. Wei, Modified group divisible designs with block size 4 andλ= 1 195(1-3) (1999) 15–25Assmus Jr., E.F. and H.F. Mattson Jr., On weights quadratic-residue codes3 (1972) 1–20Assmus Jr., E.F. and H.F. Mattson Jr., Contractions of self-orthogonal codes3 (1972) 21–32Assmus Jr., E.F. and J.D. Key, Affine and projective planes83 (1990) 161–187Assmus Jr., E.F., On the Reed–Muller codes106/107(1992) 25–33Assouad, P., Binary contraction of graphs (Note) 47 (1983) 315–319Assous, R. and M. Pouzet, Une caracterisation des mots periodiques25 (1979) 1–5Assous, R., Enchainabilite et seuil de monomorphie des tournoisn-aires 62 (1986) 119–125Astie, A., Groupes de permutations primitifs d’ordre impair et denombrement de tournois sommet-primitifs14

(1976) 1–15Astie-Vidal, A., Factor group of the automorphism group of a matroid basis graph with respect to the

automorphism group of the matroid32 (1980) 217–224Astié-Vidal, A. and V. Dugat, Near-homogeneous tournaments and permutation groups102(1992) 111–120Astié-Vidal, A. and V. Dugat, Autonomous parts and decomposition of regular tournaments111(1993) 27–36Atanassov, K.T.,seeA.G. Shannon 92 (1991) 329–340Atkins, A.C., G.N. Sarkozy and S.M. Selkow, Counting irregular multigraphs195(1-3) (1999) 235–237Atkinson, M.D., N. Santoro and A. Negro, Sums of lexicographically ordered sets80 (1990) 115–122Atkinson, M.D., Restricted permutations195(1-3) (1999) 27–38Aubert, J. and B. Schneider, Decomposition deKm +Kn en cycles hamiltoniens 37 (1981) 19–27Aubert, J. and B. Schneider, Decomposition de la somme cartesienne d’un cycle et de l’union de deux cycles

hamiltoniens en cycles hamiltoniens38 (1982) 7–16Auerbach, B.,seeR. Laskar 14 (1976) 265–268Auerbach, B.,seeR. Laskar 24 (1978) 113–118Aurenhammer, F. and J. Hagauer, Computing equivalence classes among the edges of a graph with applications

109(1992) 3–12Avis, D., seeJ. Akiyama 56 (1985) 1–6Avis, D. and H. Maehara, Metric extensions and theL1 hierarchy 131(1-3) (1994) 17–28Axenovich, M., D. Fon-Der-Flaass and A. Kostochka, On set systems without weak 3-1-subsystems 138(1-3)

(1995) 57–62Ayala, R., M.J. Chávez, A. Márquez and A. Quintero, On the connectivity of infinite graphs and 2-complexes

194(1-3) (1999) 13–37Ayel, J., Longest paths in bipartite digraphs (Note) 40 (1982) 115–118Azzena, L. and F. Piras, Incidence algebras and coalgebras of decomposition structures79 (1989/90) 123–146Baartmans, A. and K.J. Danhof, Block designs admitting regular automorphisms10 (1974) 1–8Baartmans, A., K. Danhof and S.-t. Tan, Quasi-residual quasi-symmetric designs30 (1980) 69–81Baartmans, A. and M. Shrikhande, Designs with no three mutually disjoint blocks40 (1982) 129–139Baartmans, A. and M.S. Shrikhande, A characterization of the extensions of symmetric designs (Note) 57(1985)

301–305Baartmans, A., W. Wallis and J. Yucas, A geometric construction of the Steiner systemS(4,7,23) 102(1992)

177–186


Baartmans, A.H. and W.D. Wallis, Indecomposable factorizations of multigraphs78 (1989) 37–43Babai, L., Automorphism groups of planar graphs, I2 (1972) 295–307Babai, L. and W. Imrich, On groups of polyhedral graphs (Note) 5 (1973) 101–103Babai, L., Automorphism groups of graphs and edge-contraction8 (1974) 13–20Babai, L., Vector representable matroids of given rank with given automorphism group24 (1978) 119–125Babai, L., On the Nonuniform Fisher Inequality (Note) 66 (1987) 303–307Babel, L., Tree-likeP4-connected graphs191(1-3) (1998) 13–23Baca, M., On magic labelings of honeycomb (Note) 105(1992) 305–311Bachem, A. and W. Kern, On sticky matroids69 (1988) 11–18Bachem, A. and A. Wanka, Separation theorems for oriented matroids70 (1988) 303–310Bacsó, G. and Z. Tuza, Domination properties and induced subgraphs111(1993) 37–40Bacsó, G., On a conjecture about uniquely colorable perfect graphs176(1-3) (1997) 1–19Bae, J., An extremal problem for subset-sum-distinct sequences with congruence conditions189 (1-3) (1998)

1–20Bagchi, B. and N.S.N. Sastry, Minimum weight words of binary codes associated with finite projective geometries

(Note) 57 (1985) 307–310Bagchi, B. and B. Datta, A structure theorem for pseudomanifolds188(1-3) (1998) 41–60Bagga, K.S., L.W. Beineke, M.J. Lipman and R.E. Pippert, On the honesty of graph complements122 (1993)

1–6Bagga, K.S., L.W. Beineke, M.J. Lipman and R.E. Pippert, Edge-integrity: a survey124(1994) 3–12Baggen, C.P.M.J.,seeL.M.G.M. Tolhuizen 106/107(1992) 483–488Bagiatis, C.,seeS. Kounias 46 (1983) 21–31Baica, M., Some new combinatorial identities derived from units in algebraic number fields54 (1985) 133–141Bailey, R.A., A Howell design admittingA5 167-168(1-3) (1997) 65–71Bailey, R.A. and P.E. Chigbu, Enumeration of semi-Latin squares167-168(1-3) (1997) 73–84Baker, B. and R. Shostak, Gossips and telephones2 (1972) 191–193Baker, R.D., Partitioning the planes of AG2m(2) into 2-designs 15 (1976) 205–211Baker, R.D., Resolvable BIBD and SOLS44 (1983) 13–29Balaji, K., seeM.R. Sridharan 188(1-3) (1998) 279–283Balakrishnan, R. and R. Sampathkumar, Decompositions of regular graphs intoKcn ∨ 2K2 156 (1-3) (1996)

19–28Balakrishnan, R. and P. Paulraja, Hamilton cycles in tensor product of graphs186(1-3) (1998) 1–13Balakrishnan, R., R. Sampathkumar and V. Yegnanarayanan, Extremal graphs in some coloring problems186

(1-3) (1998) 15–24Balas, E., Ranking the facets of the octahedron2 (1972) 1–15Balbuena, C., A. Carmona, J. Fàbrega and M.A. Fiol, Extraconnectivity of graphs with large minimum degree

and girth 167-168(1-3) (1997) 85–100Balbuena, C., Extraconnectivity ofs-geodetic digraphs and graphs195(1-3) (1999) 39–52Balbuena, C., A. Carmona, J. Fàbrega and M.A. Fiol, Superconnectivity of bipartite digraphs and graphs197-

198(1-3) (1999) 61–75Balbuena, M.C., A. Carmona, J. Fàbrega and M.A. Fiol, Connectivity of large bipartite digraphs and graphs174

(1-3) (1997) 3–17Balbuena, M.C., A. Carmona, J. Fàbrega and M.A. Fiol, On the order and size ofs-geodetic digraphs with given

connectivity 174(1-3) (1997) 19–27Balcar, B. and P. Simon, Reaping number andπ -character of Boolean algebras108(1992) 5–12Balcer, Y. and A.F. Veinott Jr., Computing a graph’s period quadratically by node condensation4 (1973) 295–

303Balcza, L., Sum of lengths of inversions in permutations111(1993) 41–48Baldwin, S., Generalizations of a theorem of Sarkovskii on orbits of continuous real-valued functions67(1987)

111–127Balinska, K.T. and L.V. Quintas, The sequential generation of randomf -graphs. Distributions and predominant

types of edge maximalf -graphs withf > 4 114(1993) 19–22Balinska, K.T. and L.V. Quintas, Degrees in a digraph whose nodes are graphs150(1-3) (1996) 17–29Bálint, V., Two packing problems 178(1-3) (1998) 233–236Ball, S., On small complete arcs in a finite plane174(1-3) (1997) 29–34


Balmaceda, J.M.P., A note on multiplicity-free permutation characters151(1-3) (1996) 55–58Bammel, S.E. and J. Rothstein, The number of 9× 9 Latin squares (Note) 11 (1975) 93–95Banaszczyk, W.,seeS. Sevast’janov 169(1-3) (1997) 145–152Bandelt, H.-J. and J. Hedlíková, Median algebras45 (1983) 1–30Bandelt, H.-J. and H.M. Mulder, Interval-regular graphs of diameter two50 (1984) 117–134Bandelt, H.-J. and H.M. Mulder, Pseudo-modular graphs62 (1986) 245–260Bandelt, H.-J. and E. Wilkeit, Dwarf, brick, and triangulation of the torus67 (1987) 1–14Bandelt, H.-J. and M. van de Vel, A fixed cube theorem for median graphs67 (1987) 129–137Bandelt, H.-J. and H.M. Mulder, Metric characterization of parity graphs91 (1991) 221–230Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs: decomposition via amalgamation and Cartesian

multiplication 94 (1991) 161–180Bandelt, H.-J., Graphs with edge-preserving majority functions103(1992) 1–5Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs are join spaces109(1992) 13–26Bandelt, H.-J. and A.W.M. Dress, An order theoretic framework for overlapping clustering136 (1-3) (1994)

21–37Bandelt, H.-J., A. Henkmann and F. Nicolai, Powers of distance-hereditary graphs145(1-3) (1995) 37–60Bandelt, H.-J. and V. Chepoi, A Helly theorem in weakly modular space160(1-3) (1996) 25–39Bandieri, P., Contractedk-tessellations of closed surfaces122(1993) 7–13Bang, C., H. Sharp Jr. and P. Winkler, On families of finite sets with bounds on unions and intersections (Note)

45 (1983) 123–126Bange, D.W., A.E. Barkauskas and P.J. Slater, Sequentially additive graphs44 (1983) 235–241Bange, D.W., A.E. Barkauskas, L.H. Host and P.J. Slater, Generalized domination and efficient domination in

graphs 159(1-3) (1996) 1–11Bange, D.W., A.E. Barkauskas, L.H. Host and L.H. Clark, Efficient domination of the orientations of a graph

178(1-3) (1998) 1–14Bang-Jensen, J., P. Hell and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs

92 (1992) 27–44Bang-Jensen, J., On the structure of locally semicomplete digraphs100(1992) 243–265Bang-Jensen, J. and B. Toft, Unsolved problems presented at the Julius Petersen Graph Theory Conference101

(1992) 351–360Bang-Jensen, J. and P. Hell, On chordal proper circular arc graphs128(1-3) (1994) 395–398Bang-Jensen, J., G. Gutin and J. Huang, Weakly Hamiltonian-connected ordinary multipartite tournaments138

(1-3) (1995) 63–74Bang-Jensen, J., P. Hell and G. MacGillivray, Hereditarily hardH -colouring problems 138(1-3) (1995) 75–92Bang-Jensen, J., G. Gutin and J. Huang, A sufficient condition for a semicomplete multipartite digraph to be

Hamiltonian 161(1-3) (1996) 1–12Bang-Jensen, J., G. Gutin and A. Yeo, Onk-strong andk-cyclic digraphs 162(1-3) (1996) 1–11Bang-Jensen, J. and G. Gutin, Vertex heaviest paths and cycles in quasi-transitive digraphs163 (1-3) (1997)

217–223Bang-Jensen, J. and G. Gutin, Paths and cycles in extended and decomposable digraphs164(1-3) (1997) 5–19Bang-Jensen, J. and G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: A survey165-166

(1-3) (1997) 39–60Bang-Jensen, J., Y. Guo, G. Gutin and L. Volkmann, A classification of locally semicomplete digraphs167-168

(1-3) (1997) 101–114Bang-Jensen, J. and J. Huang, Kings in quasi-transitive digraphs185(1-3) (1998) 19–27Bang-Jensen, J. and G. Gutin, Alternating cycles and trails in 2-edge-coloured complete multigraphs188(1-3)

(1998) 61–72Bang-Jensen, J., Linkages in locally semicomplete digraphs and quasi-transitive digraphs196(1-3) (1999) 13–

27Bankovic, D., Solving systems of arbitrary equations (Note) 46 (1983) 305–309Bankovic, D., Some remarks on number of parameters of the solutions of Boolean equations79 (1989/90)

229–234Bankovic, D., All solutions of finite equations 137(1-3) (1995) 1–6Bankovic, D., Formulas of general solutions of Boolean equations152(1-3) (1996) 25–32Bankovic, D., General reproductive solutions of Postian equations169(1-3) (1997) 163–168


Bankovic, D., Horn sentences in Post algebras173(1-3) (1997) 269–275Bannai, E., Examples of groups which have a graphical regular representation (Note) 19 (1977) 287–288Bannai, E. and T. Ito, Regular graphs with excess one37 (1981) 147–158Bao, X., On a Mouyart’s conjecture (Note) 98 (1991) 141–145Bao, X., A constructing method of a class of SIDS(n) (Note) 120(1993) 233–239Bao, X., Two new symmetric inseparable double squares141(1-3) (1995) 275–277Bao, X.,seeC. Ye 172(1-3) (1997) 155–162Bao, X.-W.,seeN.-Z. Li 172(1-3) (1997) 79–84Baogen, X. and Z. Zhongfu, A note on mixed Ramsey numbers199(1-3) (1999) 285–289Barahona, F. and M. Conforti, A construction for binary matroids66 (1987) 213–218Barahona, F. and A.R. Mahjoub, On two-connected subgraph polytopes147(1-3) (1995) 19–34Baranga, A., The contraction principle as a particular case of Kleene’s fixed point theorem (Note) 98 (1991)

75–79Baranga, A.,Z-continuous posets152(1-3) (1996) 33–45Bárány, I., A generalization of Carathéodory’s theorem40 (1982) 141–152Bárány, I.,seeK. Böröczky 60 (1986) 101–120Barbut, E. and A. Bialostocki, A generalization of rotational tournaments76 (1989) 81–87Barcelo, H. and E. Ihrig, Modular elements in the latticeL(A) whenA is a real reflection arrangement193

(1-3) (1998) 61–68Barcia, P.,seeJ.O. Cerdeira 154(1-3) (1996) 255–261Barcucci, E. and M.C. Verri, Some more properties of Catalan numbers102(1992) 229–237Barcucci, E., R. Pinzani and R. Sprugnoli, The random generation of underdiagonal walks139 (1-3) (1995)

3–18Barcucci, E., A. Del Lungo, S. Fezzi and R. Pinzani, Nondecreasing Dyck paths andq-Fibonacci numbers 170

(1-3) (1997) 211–217Barcucci, E., A. Del Lungo, E. Pergola and R. Pinzani, A methodology for plane tree enumeration180 (1-3)

(1998) 45–64Barcucci, E., A. Del Lungo, J.M. Fédou and R. Pinzani, Steep polyominoes,q-Motzkin numbers andq-Bessel

functions 189(1-3) (1998) 21–42Barcucci, E., S. Brunetti, A. Del Lungo and F. Del Ristoro, A combinatorial interpretation of the recurrencefn+1= 6fn − fn−1 190(1-3) (1998) 235–240

Barefoot, C., K. Casey, D. Fisher, K. Fraughnaugh and F. Harary, Size in maximal triangle-free graphs andminimal graphs of diameter 2138(1-3) (1995) 93–99

Barefoot, C.A., Interpolation theorem for the number of pendant vertices of connected spanning subgraphs ofequal size 49 (1984) 109–112

Barefoot, C.A., L.H. Clark, A.J. Depew, R.C. Entringer and L.A. Székely, Subdivision thresholds for two classesof graphs 125(1994) 15–30

Barefoot, C.A., L.H. Clark, R.C. Entringer, T.D. Porter, L.A. Székely and Z. Tuza, Cycle-saturated graphs ofminimum size 150(1-3) (1996) 31–48

Barg, A., A large family of sequences with low periodic correlation176(1-3) (1997) 21–27Barkauskas, A.E.,seeD.W. Bange 44 (1983) 235–241Barkauskas, A.E.,seeD.W. Bange 159(1-3) (1996) 1–11Barkauskas, A.E.,seeD.W. Bange 178(1-3) (1998) 1–14Barlotti, A., A. Bichara, P.V. Ceccherini and F. Eugeni, Foreword174(1-3) (1997) 1Barnabei, M. and A. Brini, A class of PBIB-designs obtained from projective geometries29 (1980) 13–17Barnabei, M. and A. Brini, Some properties of characteristics polynomials and applications to T-lattices31

(1980) 261–270Barnes, F.W., Packing the maximum number ofm× n tiles in a largep× q restangle 26 (1979) 93–100Barnes, F.W., Algebraic theory of brick packing I42 (1982) 7–26Barnes, F.W., Algebraic theory of brick packing II42 (1982) 129–144Barnes, F.W., How many 1×2×4 bricks can you get into an odd box?133(1-3) (1994) 55–78Barnes, F.W., Best packing of rods into boxes142(1-3) (1995) 271–275Barnette, D.,seeM. Rosenfeld 5 (1973) 389–394Barnette, D., On generating planar graphs7 (1974) 199–208Barnette, D., An upper bound for the diameter of a polytope10 (1974) 9–13


Barnette, D., The projection of thef -vectors of 4-polytopes onto the(E,S)-plane 10 (1974) 201–216Barnette, D. and D. Gannon, Manifolds with few vertices16 (1976) 291–298Barnette, D., Nonconvex vertices of polyhedral 2-manifolds41 (1982) 123–130Barnette, D.W., Every simple 3-polytype with 34 vertices is Hamiltonian62 (1986) 1–20Barnette, D.W.,Wv paths in the projective plane62 (1986) 127–131Barnette, D.W., Two “simple” 3-spheres (Communication) 67 (1987) 97–99Barnette, D.W., Decomposition theorems for the torus, projective plane and Klein bottle70 (1988) 1–16Barnette, D.W., Generating the 4-connected and strongly 4-connected triangulations on the torus and projective

plane 85 (1990) 1–16Barnette, D.W.,seeA. Riskin 131(1-3) (1994) 211–219Barnette, D.W., A short proof of thed-connectedness ofd-polytypes 137(1-3) (1995) 351–352Barnette, D.W., Contractible circuits in 3-connected graphs187(1-3) (1998) 19–29Barnette, D.W. and S. Gillett, Paths and circuits in partially directed graphs195(1-3) (1999) 239–243Barr, O., On extremal graphs without compatible triangles or quadrilaterals125(1994) 31–43Barraez, D., E. Flandrin, H. Li and O. Ordaz, Dominating cycles in bipartite biclaw-free graphs146(1-3) (1995)

11–18Barrett, A.J.,seeC. Domb 9 (1974) 341–358Barrett, W.W.,seeC.R. Johnson 119(1993) 97–106Barthelemy, J.P., An asymptotic equivalent for the number of total preorders on a finite set (Note) 29 (1980)

311–313Barthelemy, J.-P., About the shorterst chain between two vertices in a quasi strongly connected digraph with a

potential (Communication) 34 (1981) 321–324Barthelemy, J.P., From copair hypergraphs to median graphs with latent vertices76 (1989) 9–28Barthélemy, J.-P. and J. Constantin, Median graphs, parallelism and posets111(1993) 49–63Basu, S.K.,seeV.G. Kane 14 (1976) 63–67Batagelj, V. and T. Pisanski, Hamiltonian cycles in the Cartesian product of a tree and a cycle (Communication)

38 (1982) 311–312Batagelj, V., Inductive definition of two restricted classes of triangulations52 (1984) 113–121Batagelj, V., An inductive definition of the class of 3-connected quadrangulations of the plane78 (1989) 45–53Batagelj, V., Inductive classes of bipartite cubic graphs134(1-3) (1994) 3–8Batbedat, A., Two representations of finite ordered sets135(1-3) (1994) 47–59Bate, N.G., Complete graphs without polychromatic circuits46 (1983) 1–8Batten, L.M., Rank functions of closure spaces of finite rank49 (1984) 113–116Batten, L.M., Embedding the complement of a minimal blocking set in a projective plane52 (1984) 1–5Batten, L.M., Minimally projectively embeddable Steiner systems77 (1989) 21–27Batten, L.M., An extension of Wagner’s theorem92 (1991) 21–23Batten, L.M., The nonexistence of finite linear spaces withv = n2 points andb = n2+ n+ 2 lines 115(1993)

11–15Batten, L.M., A characterization of finite linear spaces onv points,n26 v < (n+ 1)2, andb= n2+ n+ 3 lines,n> 10 118(1993) 1–9

Bauer, D. and R. Tindell, Graphs isomorphic to subgraphs of their line-graphs41 (1982) 1–6Bauer, D., F. Harary, J. Nieminen and C.L. Suffel, Domination alteration sets in graphs47 (1983) 153–161Bauer, D., H.J. Veldman, A. Morgana and E.F. Schmeichel, Long cycles in graphs with large degree sums79

(1989/90) 59–70Bauer, D., A. Morgana and E.F. Schmeichel, A simple proof of a theorem of Jung79 (1989/90) 147–152Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions96

(1991) 33–49Bauer, D., A. Morgana and E. Schmeichel, On the complexity of recognizing tough graphs124(1994) 13–17Bauer, D., H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness

and minimum degree 141(1-3) (1995) 1–10Bauer, D., E. Schmeichel and H.J. Veldman, A note on dominating cycles in 2-connected graphs155 (1-3)

(1996) 13–18Bauer, M. and C. Itzykson, Triangulations156(1-3) (1996) 29–81Baumann, U., Automorphism groups of graphs with 1-factorizations158(1-3) (1996) 1–10Baumgartner, J.E. and K. Prikry, On a theorem of Silver14 (1976) 17–21


Bauslaugh, B., Core-like properties of infinite graphs and structures138(1-3) (1995) 101–111Bauslaugh, B.L., Compactness and finite equivalence of infinite digraphs167-168(1-3) (1997) 115–126Baybars, I.,seeT. Nishizeki 28 (1979) 255–267Baybars,I., On k-path hamiltonian maximal planar graphs (Note) 40 (1982) 119–121Bayoumi, B.I., M.H. El-Zahar and S.M. Khamis, Counting two-dimensional posets131(1-3) (1994) 29–37Beasley, L.B. and N.J. Pullman, Linear operators that strongly preserve graphical properties of matrices104

(1992) 143–157Beasley, L.B., S.D. Monson and N.J. Pullman, Linear operators that strongly preserve graphical properties of

matrices — II 195(1-3) (1999) 53–66Beck, D.A., J.B. Remmel and T. Whitehead, The combinatorics of transition matrices between the bases of the

symmetric functions and theBn analogues 153(1-3) (1996) 3–27Beck, D.A., The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral

group 163(1-3) (1997) 13–45Beck, I. and S. Krogdahl, On log concave sequences (Note) 94 (1991) 141–145Beck, J., On a combinatorial problem of P. Erdös and L. Lovász17 (1977) 127–131Beck, J., On 3-chromatic hypergraphs24 (1978) 127–137Beck, J., On a generalization of Kaplansky’s game42 (1982) 27–35Beck, J., A ‘large deviation’ phenomenon in discrete geometry, I60 (1986) 91–99Beck, J., Balanced two-colorings of finite sets in the cube73 (1988/89) 13–25Bedford, D., Construction of orthogonal latin squares using left neofields115(1993) 17–38Bedford, D. and R.M. Whitaker, Enumeration of transversals in the Cayley tables of the non-cyclic groups of

order 8 197-198(1-3) (1999) 77–81Bednarek, A.R. and E.L. Sanders, A characterization of bivariegated trees5 (1973) 1–14Bednarek, A.R., Whitney’s theorem for infinite graphs (Communication) 56 (1985) 83–85Bednarek, A.R. and R.E. Osteen, A characterization of graphical covers (Communication) 57 (1985) 155–158Beeler, M.D. and P.E. O’Neil, Some new Van der Waerden numbers28 (1979) 135–146Beezer, R.A., Orbit polynomial graphs of prime order67 (1987) 139–147Beezer, R.A. and E.J. Farrell, The matching polynomial of a regular graph137(1-3) (1995) 7–18Behr, A. and L. Camarinopoulos, On the domination of hypergraphs by their edges187(1-3) (1998) 31–38Behrendt, G., Sharply transitive partially ordered sets61 (1986) 133–139Behrendt, G., Covering posets71 (1988) 189–195Behrendt, G., The lattice of antichain cutsets of a partially ordered set (Note) 89 (1991) 201–202Behrendt, G., Automorphism groups of posets with forbidden subposets105(1992) 1–11Behzad, M. and J.E. Simpson, Eccentric sequences and eccentric sets in graphs16 (1976) 187–193Behzad, M. and E.S. Mahmoodian, Eccentric sequences and triangle sequences of block designs127 (1-3)

(1994) 47–56Beineke, L., R. Ringeisen and H.J. Straight, The cochromatic index of a graph31 (1980) 153–159Beineke, L.W. and R.J. Wilson, On the edge-chromatic number of a graph5 (1973) 15–20Beineke, L.W. and S. Fiorini, On small graphs critical with respect to edge colourings16 (1976) 109–121Beineke, L.W. and C.M. Zamfirescu, Connection digraphs and second-order line digraphs39 (1982) 237–254Beineke, L.W.,seeK.S. Bagga 122(1993) 1–6Beineke, L.W.,seeK.S. Bagga 124(1994) 3–12Beineke, L.W., P. Hamburger and W.D. Goddard, Random packings of graphs125(1994) 45–54Beineke, L.W., P. Hamburger and W.D. Weakley, Random packing byρ-connectedρ-regular graphs 160(1-3)

(1996) 41–47Beineke, L.W. and M.A. Henning, Opinion functions on trees167-168(1-3) (1997) 127–139Beissinger, J.S., Similar constructions for Young tableaux and involutions, and their application to shiftable

tableaux 67 (1987) 149–163Békéssy, A. and J. Demetrovics, Contribution to the theory of data base relations27 (1979) 1–10Békéssy, A., J. Demetrovics, L. Hannák, P. Frankl and Gy. Katona, On the number of maximal dependencies in a

data base relation of fixed order30 (1980) 83–88Bekkali, M. and R. Bonnet, On Fodor’s theorem: A topological version53 (1985) 3–19Bélanger, M.-F., J. Constantin and G. Fournier, Graphes et ordonnés démontables, propriété de la clique fixe

130(1-3) (1994) 9–17Belding, R., Structures characterizing partially ordered sets, and their automorphism groups27 (1979) 117–126


Belfer, A. and M.C. Golumbic, Counting endpoint sequences for interval orders and interval graphs114(1993)23–39

Bellantoni, S., I.B.-A. Hartman, T. Przytycka and S. Whitesides, Grid intersection graphs and boxicity114(1993) 41–49

Beltrametti, E.G., Note on thep-adic generalization of Lorentz transformations1 (1971) 239–246Benadé, G., I. Broere, B. Jonck and M. Frick, Uniquely(m,k)τ -colourable graphs andk-τ -saturated graphs162

(1-3) (1996) 13–22Benard, D., A. Bouchet and J.-L. Fouquet, (m)-covering of a triangulation 62 (1986) 261–270Ben-Arroyo Hartman, I.,seeR. Aharoni 120(1993) 13–24Benchekroun, S. and P. Moszkowski, A bijective proof of an enumerative property of legal bracketings176

(1-3) (1997) 273–277Bencherif Ait-Djafer, H., On cycle lengths in graphs of moderate degree125(1994) 55–62Bendali, F. and A. Quilliot, Compatibilité entre structures d’intervalles et relations d’ordre130 (1-3) (1994)

19–37Bender, E.A., A generalizedq-binomial Vandermonde convolution1 (1971) 115–119Bender, E.A., Convexn-ominoes 8 (1974) 219–226Bender, E.A., Partitions of multisets9 (1974) 301–311Bender, E.A., The asymptotic number of non-negative integer matrices with given row and column sums10

(1974) 217–223Bender, E.A., J.S. Devitt and L.B. Richmond, Partitions of multisets II50 (1984) 1–8Bender, E.A. and L.B. Richmond, An asymptotic expansion for the coefficients of some power series II: Lagrange

inversion 50 (1984) 135–141Bender, E.A. and N.C. Wormald, The number of loopless planar maps (Note) 54 (1985) 235–237Bendrossian, P., G. Chen and R.H. Schelp, A generalization of Fan’s condition for Hamiltonicity, pancyclicity,

and Hamiltonian connectedness115(1993) 39–50Bénéteau, L., L’irréductibilité centrale dans les boucles de Moufang commutatives et dans les systèmes triples de

Hall 45 (1983) 31–44Benhocine, A., Nombres de Ramsey dans le cas orienté22 (1978) 213–217Benhocine, A., Pancyclism and Meyniel’s conditions58 (1986) 113–120Benhocine, A. and J.-L. Fouquet, The Chvátal–Erdös condition and pancyclic line-graphs66 (1987) 21–26Benhocine, A. and A.P. Wojda, Graphs with every matching contained in a cycle118(1993) 11–21Ben-Israel, A.,seeX. Tang 169(1-3) (1997) 279–282Bennett, F.E., Extended cyclic triple systems24 (1978) 139–146Bennett, F.E., Latin squares with pairwise orthogonal conjugates36 (1981) 117–137Bennett, F.E. and L. Zhu, Incomplete conjugate orthogonal idempotent Latin squares65 (1987) 5–21Bennett, F.E., The spectra of a variety of quasigroups and related combinatorial designs77 (1989) 29–50Bennett, F.E., L. Wu and L. Zhu, Further results on incomplete (3, 2, 1)-conjugate orthogonal idempotent Latin

squares 84 (1990) 1–14Bennett, F.E., B. Du and L. Zhu, On the existence of(v,7,1)-perfect Mendelsohn designs84 (1990) 221–239Bennett, F.E. and H. Shen, On indecomposable pure Mendelsohn triple systems97 (1991) 47–57Bennett, F.E., K.T. Phelps, C.A. Rodger, J. Yin and L. Zhu, Existence of perfect Mendelsohn designs withk = 5

andλ > 1 103(1992) 129–137Bennett, F.E., K.T. Phelps, C.A. Rodger and L. Zhu, Constructions of perfect Mendelsohn designs103 (1992)

139–151Bennett, F.E., J. Yin and L. Zhu, On the existence of perfect Mendelsohn designs withk = 7 andλ even 113

(1993) 7–25Bennett, F.E. and L. Zhu, The spectrum of HSOLSSOM(hn) whereh is even 158(1-3) (1996) 11–25Bennett, F.E., C.J. Colbourn and L. Zhu, Existence of three HMOLS of typeshn and 2n31 160 (1-3) (1996)

49–65Bennett, F.E. and J. Yin, Packings and coverings of the complete directed multigraph with 3- and 4-circuits162

(1-3) (1996) 23–29Bennett, F.E. and R. Wei, The existence of Schröder designs with equal-sized holes170(1-3) (1997) 15–28Bennett, F.E.,seeR.J.R. Abel 190(1-3) (1998) 1–14Bennett, G., Coin tossing and moment sequences84 (1990) 111–118Bennett, M.K., Coordinatization of affine and projective space4 (1973) 219–231


Bennett, M.K., Rectangular products of lattices79 (1989/90) 235–249Benoumhani, M., On Whitney numbers of Dowling lattices159(1-3) (1996) 13–33Benzait, A. and B. Voigt, A combinatorial interpretation of(1/k!)1ktn 73 (1988/89) 27–35Benzaken, C., Post’s closed systems and the weak chromatic number of hypergraphs23 (1978) 77–84Benzaken, C., P.L. Hammer and D. de Werra, Split graphs of Dilworth number 255 (1985) 123–127Benzaken, C. and P.L. Hammer, Boolean techniques for matroidal decomposition of independence systems and

applications to graphs56 (1985) 7–34Berardi, L., Constructing 3-designs from spreads and lines (Note) 74 (1989) 331–332Berardi, L., M. Buratti and S. Innamorati, 4-Blocked Hadamard 3-designs174(1-3) (1997) 35–46Berardi, L., On blocking sets in a design177(1-3) (1997) 249–257Berenbom, J., J. Fendel, G.T. Gilbert and R.L. Hatcher, Sliding piece puzzles with oriented tiles175 (1-3)

(1997) 23–33Berge, C. and A. Ramachandra Rao, A combinatorial problem in logic17 (1977) 23–26Berge, C., Regularisable graphs I23 (1978) 58–89Berge, C., Regularisable graphs, II23 (1978) 91–95Berge, C. and M. Las Vergnas, Transversals of circuits and acyclic orientations in graphs and matroids (Note)

50 (1984) 107–108Berge, C., Minimax relations for the partialq-colorings of a graph 74 (1989) 3–14Berge, C. and P. Duchet, Recent problems and results about kernels in directed graphs86 (1990) 27–31Berge, C., Combinatorial games on a graph151(1-3) (1996) 59–65Berge, C., Motivations and history of some of my conjectures165-166(1-3) (1997) 61–70Berge, C. and J.-L. Fouquet, On the optimal transversals of the odd cycles169(1-3) (1997) 169–175Berger, M.A., A. Felzenbaum and A.S. Fraenkel, Lattice parallelotopes and disjoint covering systems65(1987)

23–46Berger, T. and P. Charpin, The automorphism group of Generalized Reed–Muller codes117(1993) 1–17Bergeron, F. and L. Favreau, Fourier transform over semi-simple algebras and harmonic analysis for probabilistic

algorithms 139(1-3) (1995) 19–32Bergeron, F., L. Favreau and D. Krob, Conjectures on the enumeration of tableaux of bounded height139(1-3)

(1995) 463–468Bergeron, N. and A.M. Garsia, Zonal polynomials and domino tableaux99 (1992) 3–15Bergeron, N., Décomposition hyperoctahédrale de l’homologie de Hochschild139(1-3) (1995) 33–48Berghammer, R. and G. Schmidt, Discrete ordering relations43 (1983) 1–7Berman, A. and A. Kotzig, Cross-cloning and antipodal graphs69 (1988) 107–114Berman, A.,seeN. Kogan 114(1993) 297–304Berman, A.,seeR. Michel 146(1-3) (1995) 313–320Berman, D.M.,seeM.O. Albertson 31 (1980) 225–233Berman, D.M.,seeM.O. Albertson 89 (1991) 97–100Berman, D.M., A.J. Radcliffe, A.D. Scott, H. Wang and L. Wargo, All trees contain a large induced subgraph

having all degrees 1(modk) 175(1-3) (1997) 35–40Berman, G., The gossip problem (Note) 4 (1973) 91Berman, J., Algebras with modular lattice reducts and simple subdirectly irreducibles11 (1975) 1–8Berman, J., A proof of Lyndon’s finite basis theorem29 (1980) 229–233Berman, J. and R. McKenzie, Clones satisfying the term condition52 (1984) 7–29Berman, J. and G. Bordalo, Finite distributive lattices and doubly irreducible elements178 (1-3) (1998) 237–

243Berman, J.D., E.W. Kiss, P. Prohle and Á. Szendrei, The set of types of a finitely generated variety112(1993)

1–20Berman, K.A., Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps

(Note) 21 (1978) 83–85Berman, K.A., Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of

directed Eulerian paths (Note) 22 (1978) 75–80Berman, K.A., A note on coloured quadrangulations (Communication) 29 (1980) 215–217Berman, K.A., Proof of a conjecture of Häggkvist on cycles and independent edges46 (1983) 9–13Berman, K.A., Parity results on connectedf -factors 59 (1986) 1–8


Bermond, J.C., An application of the solution of Kirkman’s schoolgirl problem: The decomposition of thesymmetric oriented complete graph into 3-circuits8 (1974) 301–304

Bermond, J.C., Some Ramsey numbers for directed graphs9 (1974) 313–321Bermond, J.C., M.C. Heydemann and D. Sotteau, Line graphs of hypergraphs I18 (1977) 235–241Bermond, J.C. and J. Schönheim,G-decomposition ofKn, whereG has four vertices or less19(1977) 113–120Bermond, J.-C., P. Frankl and F. Sterboul, On the maximum number of edges in a hypergraph whose linegraph

contains no cycle (Communication) 30 (1980) 295–298Bermond, J.-C. and M. Las Vergnas, Regular factors in nearly regular graphs50 (1984) 9–13Bermond, J.C., J.L. Fouquet, M. Habib and B. Peroche, On lineark-arboricity 52 (1984) 123–132Bermond, J.-C., K. Berrada and J. Bond, Extensions of networks with given diameter75 (1989) 31–40Bermond, J.-C., N. Homobono and C. Peyrat, Connectivity of Kautz networks114(1993) 51–62Bernaldez, J.M., On cyclically K-complementary graphs127(1-3) (1994) 57–62Bernaldez, J.M., Onk-complementing permutations of cyclicallyk-complementary graphs151 (1-3) (1996)

67–70Bernardi, C., On a theorem about vertex colorings of graphs (Note) 64 (1987) 95–96Bernasconi, C., Smooth designs47 (1983) 163–168Bernstein, M., N.J.A. Sloane and P.E. Wright, On sublattices of the hexagonal lattice170(1-3) (1997) 29–39Berrachedi, A., A new characterization of median graphs128(1-3) (1994) 385–387Berrada, K.,seeJ.-C. Bermond 75 (1989) 31–40Berrizbeitia, P. and R.E. Giudici, Counting purek-cycles in sequences of Cayley graphs149(1-3) (1996) 11–18Berstel, J., Mots sans carre et morphismes iteres29 (1980) 235–244Berstel, J., M. Crochemore and J.E. Pin, Thue–Morse sequence andp-adic topology for the free monoid76

(1989) 89–94Berstel, J.,seeJ.-P. Allouche 139(1-3) (1995) 455–461Berstel, J. and M. Pocchiola, Random generation of finite Sturmian words153(1-3) (1996) 29–39Bertram, E.A., Some applications of graph theory to finite groups44 (1983) 31–43Bessenrodt, C., A bijection for Lebesgue’s partition identity in the spirit of Sylvester132(1-3) (1994) 1–10Bessenrodt, C., Generalisations of the Andrews–Olsson partition identity and applications141 (1-3) (1995)

11–22Bessis, L., Fixed points of induced automorphisms of hypermaps153(1-3) (1996) 41–46Bessis, L., Harvey–Wiman hypermaps157(1-3) (1996) 39–52Best, M.R. and A.E. Brouwer, The triply shortened binary Hamming code is optimal17 (1977) 235–245Beth, T., Generalizing the discrete Fourier transform56 (1985) 95–100Betke, U. and P. Gritzmann, An application of valuation theory to two problems in discrete geometry (Note) 58

(1986) 81–85Bétréma, J. and A. Zvonkin, Plane trees and Shabat polynomials153(1-3) (1996) 47–58Betten, A., M. Klin, R. Laue and A. Wassermann, Graphicalt-designs via polynomial Kramer–Mesner matrices

197-198(1-3) (1999) 83–109Betten, A., R. Laue and A. Wassermann, Newt-designs and large sets oft-designs 197-198(1-3) (1999) 111–

121Beutelspacher, A., On extremal intersection numbers of a block design42 (1982) 37–49Beutelspacher, A. and U. Lamberty, Strongly resolvable(r, λ)-designs 45 (1983) 141–152Beutelspacher, A. and F. Eugeni, On the type of partialt-spreads in finite projective spaces54 (1985) 241–257Beutelspacher, A. and I. Schestag, Finite linear spaces in which anyn-gon is euclidean 59 (1986) 207–220Beutelspacher, A. and K. Metsch, Embedding finite linear spaces in projective planes, II66 (1987) 219–230Beutelspacher, A., A combinatorial characterization of geometric spreads97 (1991) 59–62Bevis, J. and M. Grady, Toroidal maps of modular quotient groups186(1-3) (1998) 25–38Beznea, L., A topological characterization of complete distributive lattices49 (1984) 117–120Bhagwandas, and W.G. Bridges, Applications of algebraic duality to group divisible structures37 (1981) 159–

166Bhargava, M., Congruence preservation and polynomial functions fromZn to Zm 173(1-3) (1997) 15–21Bhaskara Rao, K.P.S.,seeR. Shelton 61 (1986) 107–114Bhaskara Rao, S., Characterization of self-complementary graphs with 2-factors17 (1977) 225–233Bhatnagar, G.,seeS.C. Milne 193(1-3) (1998) 235–245


Bhat-Nayak, V.N., R.N. Naik and S.B. Rao, Frequency partitions: Forcibly pancyclic and forcibly nonhamiltoniandegree sequences20 (1977) 93–102

Bhat-Nayak, V.N., S.A. Choudum and R.N. Naik, Characterizations of 2-variegated graphs and of 3-variegatedgraphs 23 (1978) 17–22

Bhat-Nayak, V.N. and R.N. Naik, Solutions of some further graph equations47 (1983) 169–175Bhat-Nayak, V.N. and V.D. Kane, Two families of simple and irreducible BIBDs (Note) 68 (1988) 311–313Bhave, N.S., Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences186

(1-3) (1998) 39–54Bhave, V.N.,seeE. Sampathkumar 16 (1976) 57–60Bialostocki, A. and N. Sauer, On Ramsey–Turán type problems in tournaments59 (1986) 221–228Bialostocki, A., An application of the Ramsey theorem to orderedr-tournaments (Note) 61 (1986) 325–328Bialostocki, A.,seeE. Barbut 76 (1989) 81–87Bialostocki, A., P. Dierker and B. Voxman, Some notes on the Erdos–Szekeres theorem91 (1991) 231–238Bialostocki, A. and P. Dieker, An isoperimetric lemma (Note) 94 (1991) 221–228Bialostocki, A. and P. Dierker, On the Erdös–Ginsburg–Ziv theorem and the Ramsey numbers for stars and

matchings 110(1992) 1–8Bialostocki, A., P. Erdos and H. Lefmann, Monochromatic and zero-sum sets of nondecreasing diameter137

(1-3) (1995) 19–34Bialostocki, A., H. Lefmann and T. Meerdink, On the degree of regularity of some equations150 (1-3) (1996)

49–60Biane, P., Some properties of crossings and partitions175(1-3) (1997) 41–53Bichara, A.,seeA. Barlotti 174(1-3) (1997) 1Bielak, H., Graphs with special neighbourhood orderings of vertices121(1993) 3–9Bielak, H., Chromatic uniqueness in a family of 2-connected graphs164(1-3) (1997) 21–28Bienia, W. and H. Meyniel, Partitions of digraphs into paths or circuits (Note) 61 (1986) 329–331Bienstock, D., On the complexity of testing for odd holes and induced odd paths (Note) 90 (1991) 85–92Bier, T., A family of nonbinary linear codes65 (1987) 47–51Bier, T. and A. Kleinschmidt, Centrally symmetric and magic rectangles176(1-3) (1997) 29–42Bierbrauer, J., A family of perpendicular arrays achieving perfect 4-fold secrecy125(1994) 63–66Bierbrauer, J., A family of 4-designs with block size 9138(1-3) (1995) 113–117Biggs, N., Expansions of the chromatic polynomial6 (1973) 105–113Biggs, N., Confluence of some presentations associated with graphs75 (1989) 41–46Biggs, N.,seeM. Anthony 120(1993) 227–231Biggs, N., Combinatorics and connectionism124(1994) 19–36Biggs, N.L. and M.J. Hoare, A trivalent graph with 58 vertices and girth 9 (Communication) 30 (1980) 299–301Biggs, N.L., A proof of Serre’s theorem78 (1989) 55–57Biliotti, M., On a construction of Clay of BIB designs from Frobenius groups (Note) 74 (1989) 333–334Billey, S., Transition equations for isotropic flag manifolds193(1-3) (1998) 69–84Billington, D., A simple proof that all 1-designs exist (Communication) 42 (1982) 321–322Billington, E.J., More balanced ternary designs with block size three39 (1982) 9–21Billington, E.J., New cyclic (61, 244, 40, 10, 6) BIBDs (Note) 77 (1989) 51–53Billington, E.J. and D.G. Hoffman, The number of repeated blocks in balanced ternary designs with block size

three II 92 (1991) 25–37Billington, E.J. and C.C. Lindner, The spectrum for 2-perfect bowtie systems135(1-3) (1994) 61–68Billington, E.J.,seeP. Adams 149(1-3) (1996) 1–9Billington, E.J. and D.G. Hoffman, The intersection problem for star designs179(1-3) (1998) 217–222Billington, E.J., Decomposing complete tripartite graphs into cycles of lengths 3 and 4197-198(1-3) (1999)

123–135Bilski, T., Optimum embedding of complete graphs in books182(1-3) (1998) 21–28Bioch, J.C. and T. Ibaraki, Decompositions of positive self-dual Boolean functions140(1-3) (1995) 23–46Biondi, P., A classification of finiten-2,n-biregular spaces129(1-3) (1994) 3–18Biondi, P., A classification of finiten-2,n-1-point-biregular spaces174(1-3) (1997) 47–71Bird, E., C. Greene and D.J. Kleitman, Automorphisms of lexicographic products11 (1975) 191–198Biró, M., M. Hujter and Zs. Tuza, Precoloring extension. I. Interval graphs100(1992) 267–279


Biss, D.K., A lower bound on the number of functions satisfying the strict avalanche criterion185(1-3) (1998)29–39

Bixby, R.E.,`-matrices and a characterization of binary matroids8 (1974) 139–145Bixby, R.E., A simple proof that every matroid is an intersection of fundamental transversal matroids (Note) 18

(1977) 311–312Bixby, R.E., The solution to a matroid problem of Knuth (Note) 21 (1978) 87–88Björner, A. and I. Rival, A note on fixed points in semimodular lattices29 (1980) 245–250Björner, A., Some matroid inequalities (Communication) 31 (1980) 101–103Björner, A., On complements in lattices of finite length (Note) 36 (1981) 325–326Björner, A. and J. Karlander, Invertibility of the base Radon transform of a matroid108(1992) 139–147Björner, A. and K. Eriksson, Extendable shellability for rank 3 matroid complexes132(1-3) (1994) 373–376Björner, A., A general homotopy complementation formula193(1-3) (1998) 85–91Blahut, R.E., A note on binary cyclic codes of blocklength 63106/107(1992) 35–43Blair, C.E. and R.G. Jeroslow, The value function of a mixed integer program: I19 (1977) 121–138Blair, C.E., Minimal inequalities for mixed integer programs24 (1978) 147–151Blair, C.E. and R.G. Jeroslow, The value function of a mixed integer program: II25 (1979) 7–19Blake, I.F.,seeJ.J. Stiffler 12 (1975) 159–163Blake, I.F. and J.J. Stiffler, A note on generalized room squares (Note) 21 (1978) 89–93Blake, I.F. and A. Melkman, On an inverse for sections of a binomial matrix23 (1978) 97–104Blanchard, J.L., A construction for orthogonal arrays with strengtht ≥ 3 137(1-3) (1995) 35–44Blanchard, J.L., An extension theorem for Steiner systems141(1-3) (1995) 23–35Bland, R.G., H.-C. Huang and L.E. Trotter Jr., Graphical properties related to minimal imperfection27 (1979)

11–22Bland, R.G. and B.L. Dietrich, An abstract duality (Communication) 70 (1988) 203–208Blass, A., Complexity of winning strategies3 (1972) 295–300Blass, A., On exponentiation ofG-sets 135(1-3) (1994) 69–79Blázsik, Z., M. Hujter, A. Pluhár and Z. Tuza, Graphs with no inducedC4 and 2K2 115(1993) 51–55Blecher, P.M., On a logical problem (Note) 43 (1983) 107–110Blind, G., Decomposition of a convex polygon into convex polygons26 (1979) 1–15Blind, G. and R. Blind, The almost simple cubical polytopes184(1-3) (1998) 25–48Blind, R.,seeG. Blind 184(1-3) (1998) 25–48Blinovsky, V.M., List decoding 106/107(1992) 45–51Blokhuis, A., A.E. Brouwer and H.A. Wilbrink, Heden’s bound on maximal partial spreads (Note) 74 (1989)

335–339Blokhuis, A., A. Brouwer and H. Wilbrink, Hermitian unitals are code words97 (1991) 63–68Blokhuis, A. and A.E. Brouwer, LocallyK3,3 or Petersen graphs106/107(1992) 53–60Blokhuis, A. and T. Szönyi, Note on the structure of semiovals in finite projective planes106/107(1992) 61–65Blokhuis, A. and T. Szonyi, Irregular weighting of 1-designs131(1-3) (1994) 339–343Blokhuis, A. and A.E. Brouwer, Determination of the distance-regular graphs without 3-claws163(1-3) (1997)

225–227Blokhuis, A. and C.M. O’Keefe, On deriving unitals197-198(1-3) (1999) 137–141Bluskov, I., Somet-designs are minimal (t+1)-coverings 188(1-3) (1998) 245–251Blyth, T. and J. Varlet, Principal congruences on some lattice-ordered algebras (Note) 81 (1990) 323–329Bo, C. and B. Liu, Some inequalities about connected domination number159(1-3) (1996) 241–245Boccara, G., Decompositions d’une permutation d’un ensemble fini en produit de deux cycles23 (1978) 189–

205Boccara, G., Nombre de representations d’une permutation comme produit de deux cycles de longueurs donnees

29 (1980) 105–134Boccara, G., Cycles comme produit de deux permutations de classes donnees38 (1982) 129–142Bodendiek, R. and G. Walther, On the relations between certain graph labelings134(1-3) (1994) 9–16Boesch, F.,seeL. Petingi 179(1-3) (1998) 155–166Bogart, K.P., Maximal dimensional partially ordered sets I. Hiraguchi’s Theorem5 (1973) 21–31Bogart, K.P. and W.T. Trotter Jr., Maximal dimensional partially ordered sets II. Characterization of 2n-element

posets with dimensionn 5 (1973) 33–43Bogart, K.P., A note on matrices of zeros and ones9 (1974) 323–327


Bogart, K.P.,seeW.T. Trotter Jr. 15 (1976) 389–400Bogart, K.P.,seeW.T. Trotter Jr. 16 (1976) 71–82Bogart, K.P., Incidence codes of posets: Eulerian posets and Reed–Muller codes31 (1980) 1–7Bogart, K.P., An obvious proof of Fishburn’s interval order theorem (Note) 118(1993) 239–242Bogart, K.P. and A.N. Trenk, Bipartite tolerance orders132(1-3) (1994) 11–22Bogart, K.P. and A.N. Trenk, Corrigendum145(1-3) (1995) 347Bogart, K.P. and G. Isaak, Proper and unit bitolerance orders and graphs181(1-3) (1998) 37–51Böhme, T., H.J. Broersma, F. Göbel, A.V. Kostochka and M. Stiebitz, Spanning trees with pairwise nonadjacent

endvertices 170(1-3) (1997) 219–222Böhme, T. and J. Harant, On Hamiltonian cycles in 4- and 5-connected plane triangulations191 (1-3) (1998)

25–30Böhme, T., J. Harant, A. Pruchnewski and I. Schiermeyer, A planarity criterion for cubic bipartite graphs191

(1-3) (1998) 31–43Bohus, G., W. Jockusch, C.W. Lee and N. Prabhu, On a triangulation of the 3-ball and the solid torus187(1-3)

(1998) 259–264Boicescu, V., Irredundantn-valued Moisil algebras 71 (1988) 197–204Boisen, P., Polynomials and packings: a new proof of de Bruijn’s theorem146(1-3) (1995) 285–287Bokowski, J.,seeA. Altshuler 31 (1980) 115–124Bolla, M., Spectra, Euclidean representations and clusterings of hypergraphs117(1993) 19–39Bolla, M. and G. Tusnády, Spectra and optimal partitions of weighted graphs128(1-3) (1994) 1–20Bollobás, B., Three-graphs without two triples whose symmetric difference is contained in a third8 (1974)

21–24Bollobás, B., P. Erdös and E. Szemerédi, On complete subgraphs ofr-chromatic graphs 13 (1975) 97–107Bollobás, B., Semi-topological subgraphs (Note) 20 (1977) 83–85Bollobás, B., Chromatic number, girth and maximal degree (Note) 24 (1978) 311–314Bollobás, B. and A. Thomason, Set colourings of graphs25 (1979) 21–26Bollobás, B., On graphs with equal edge connectivity and minimum degree (Note) 28 (1979) 321–323Bollobás, B., The distribution of the maximum degree of a random graph (Note) 32 (1980) 201–203Bollobás, B., Degree sequences of random graphs33 (1981) 1–19Bollobás, B., Some remarks on packing trees (Note) 46 (1983) 203–204Bollobás, B. and E.J. Cockayne, The irredundance number and maximum degree of a graph (Note) 49 (1984)

197–199Bollobás, B., C. Nara and S.-i. Tachibana, The maximal number of induced complete bipartite graphs62 (1986)

271–275Bollobás, B., Sorting in rounds72 (1988) 21–28Bollobás, B. and H.R. Hind, A new upper bound for the list chromatic number74 (1989) 65–75Bollobás, B.,seeN. Alon 75 (1989) 23–30Bollobás, B. and G. Brightwell, Long cycles in graphs with no subgraphs of minimal degree 375 (1989) 47–53Bollobás, B. and S. Rasmussen, First cycles in random directed graph processes75 (1989) 55–68Bollobás, B., E.J. Cockayne and C.M. Mynhardt, On generalised minimal domination parameters for paths86

(1990) 89–97Bollobás, B. and H.R. Hind, Graphs without large triangle free subgraphs87 (1991) 119–131Bollobás, B. and I. Leader, Maximal sets of given diameter in the grid and the torus122(1993) 15–35Bollobás, B., Turán–Ramsey problems156(1-3) (1996) 257–261Bollobás, B., Degree multiplicities and independent sets inK4-free graphs 158(1-3) (1996) 27–35Bollobás, B. and I. Leader, Sums in the grid162(1-3) (1996) 31–48Bollobás, B. and A.D. Scott, Independent sets and repeated degrees170(1-3) (1997) 41–49Bollobás, B., N. Hegyvári and G. Jin, On a problem of Erdos and Graham 175(1-3) (1997) 253–257Bollobás, B. and O. Riordan, On some conjectures of Graffiti179(1-3) (1998) 223–230Bollobás, B. and T. Szabó, The oriented cycle game186(1-3) (1998) 55–67Bollobás, B., O. Riordan, Z. Ryjácek, A. Saito and R.H. Schelp, Closure and Hamiltonian-connectivity of claw-

free graphs 195(1-3) (1999) 67–80Bollobás, B., P. Erdos and A. Sarkar, Extremal graphs for weights200(1-3) (1999) 5–19Bóna, M., A Euclidean Ramsey theorem (Note) 122(1993) 349–352Bóna, M. and G. Tóth, A Ramsey-type problem on right-angled triangles in space150(1-3) (1996) 61–67


Bóna, M., Permutations avoiding certain patterns: The case of length 4 and some generalizations175 (1-3)(1997) 55–67

Bóna, M., Permutations with one or two 132-subsequences181(1-3) (1998) 267–274Bond, J.,seeJ.-C. Bermond 75 (1989) 31–40Bond, J. and C. Delorme, A note on partial Cayley graphs114(1993) 63–74Bondy, J.A., Large cycles in graphs1 (1971) 121–132Bondy, J.A. and V. Chvátal, A method in graph theory15 (1976) 111–135Bondy, J.A. and C. Thomassen, A short proof of Meyniel’s theorem (Note) 19 (1977) 195–197Bondy, J.A., A remark on two sufficient conditions for Hamilton cycles (Note) 22 (1978) 191–193Bondy, J.A. and S.C. Locke, Relative lengths of paths and cycles in 3-connected graphs33 (1981) 111–122Bondy, J.A. and P. Hell, Counterexamples to theorems of Menger type for the diameter (Communication) 44

(1983) 217–220Bondy, J.A. and G. Fan, A sufficient condition for dominating cycles (Note) 67 (1987) 205–208Bondy, J.A., Trigraphs 75 (1989) 69–79Bondy, J.A., A short proof of the Chen–Manalastas theorem146(1-3) (1995) 289–292Bondy, J.A., Counting subgraphs A new approach to the Caccetta–Häggkvist conjecture165-166(1-3) (1997)

71–80Bondy, J.A., P. Erdos and S. Fajtlowicz, Graphs of diameter two with no 4-circuits200(1-3) (1999) 21–25Bongartz, K. and D. Mertens, On the enumeration of homeochromatic classes ofk-chromatic tilings 85 (1990)

17–42Bonin, J.E., Modular elements of higher-weight Dowling lattices119(1993) 3–11Bonin, J.E., On basis-exchange properties for matroids187(1-3) (1998) 265–268Bonisoli, A. and G. Korchmáros, Suzuki groups, one-factorizations and Lüneburg planes161(1-3) (1996) 13–

24Bonnet, R.,seeM. Bekkali 53 (1985) 3–19Bonnin, A. and J.M. Pallo, A-transformation dans les arbresn-aires 45 (1983) 153–163Bonnin, A. and J.M. Pallo, Sur la generation des arbres binaires par les B-suites51 (1984) 111–117Bonnington, C.P., W. Imrich and M.E. Watkins, Separating double rays in locally finite planar graphs145(1-3)

(1995) 61–72Book, R.V., Free and almost-free subsemigroups of a free semigroup4 (1973) 233–241Book, R.V. and M.A. Harrison, Mutually divisible semigroups9 (1974) 329–332Book, R.V., Homogeneous thue systems and the Church-Rosser property48 (1984) 137–145Book, R.V. and C.C. Squier, Almost all one-rule Thue systems have decidable word problems49 (1984) 237–

240Booth, R.S., A class of Fibonacci-type sequences10 (1974) 15–28Booth, R.S.,seeJ.F. Weng 141(1-3) (1995) 259–274Bordalo, G.,seeJ. Berman 178(1-3) (1998) 237–243Bordat, J.P., Note sur la recherche des monomes maximaux en algebre de Post (Note) 17 (1977) 323–326Borges, J. and J. Rifà, A note about multidesigns and extended designs111(1993) 65–69Borkovitz, D. and F.K. Hwang, Multiplicative magic squares47 (1983) 1–11Borobia, A., Vertices of the generalized transitive tournament polytope163(1-3) (1997) 229–234Borobia, A. and V. Chumillas, *-graphs of vertices of the generalized transitive tournament polytope179(1-3)

(1998) 49–57Böröczky, K., I. Bárány, E. Makai Jr. and J. Pach, Maximal volume enclosed by plates and proof of the chessboard

conjecture 60 (1986) 101–120Böröczky, K., N. Sauer and X. Zhu, Inexhaustible homogeneous structures115(1993) 57–63Borodin, O.V., On acyclic colorings of planar graphs25 (1979) 211–236Borodin, O.V., Cyclic coloring of plane graphs100(1992) 281–289Borodin, O.V., Diagonal coloring of the vertices of triangulations (Note) 102(1992) 95–96Borodin, O.V. and J. Mayer, Decomposition ofK13 into a torus graph and a graph imbedded in the Klein bottle

(Note) 102(1992) 97–98Borodin, O.V., Simultaneous coloring of edges and faces of plane graphs128(1-3) (1994) 21–33Borodin, O.V., Triangles with restricted degree sum of their boundary vertices in plane graphs137(1-3) (1995)

45–51Borodin, O.V., Irreducible graphs in the Grünbaum–Havel 3-colour problem159(1-3) (1996) 247–249


Borodin, O.V., A new proof of Grünbaum’s 3 color theorem169(1-3) (1997) 177–183Borodin, O.V., Triangulated 3-polytopes without faces of low weight186(1-3) (1998) 281–285Borodin, O.V., A.V. Kostochka, J. Nešetril, A. Raspaud and E. Sopena, On universal graphs for planar oriented

graphs of a given girth 188(1-3) (1998) 73–85Borodin, O.V., A.V. Kostochka and D.R. Woodall, On kernel-perfect orientations of line graphs191(1-3) (1998)

45–49Boros, E., On a linear diophantine problem for geometrical type sequences66 (1987) 27–33Boros, E. and P.L. Hammer, On clustering problems with connected optima in Euclidean spaces75 (1989)

81–88Boros, E., On shift stable hypergraphs (Communication) 87 (1991) 81–84Boros, E. and R. Meshulam, On the number of flats spanned by a set of points inPG(d ,q) 150 (1-3) (1996)

407–409Boros, E. and V. Gurvich, Perfect graphs are kernel solvable159(1-3) (1996) 35–55Boros, E. and O.Cepek, On perfect 0,±1 matrices 165-166(1-3) (1997) 81–100Boros, E. and V. Gurvich, A corrected version of the Duchet kernel conjecture179(1-3) (1998) 231–233Borosh, I., M. Flahive and B. Treybig, Small solutions of linear Diophantine equations58 (1986) 215–220Borovik, A.V., I. Gelfand and N. White, On exchange properties for Coxeter matroids and oriented matroids

179(1-3) (1998) 59–72Borowiecki, M. and E. Drgas-Burchardt, Classes of chromatically unique graphs111(1993) 71–75Borowiecki, M. and E. Drgas-Burchardt, Classes of chromatically unique or equivalent graphs121(1993) 11–

18Borowiecki, M. and D. Michalak, Generalized independence and domination in graphs191(1-3) (1998) 51–56Borwein, D., S. Rankin and L. Renner, Enumeration of injective partial transformations (Communication) 73

(1989) 291–296Borzacchini, L. and C. Pulito, Some results on conversion matrices39 (1982) 255–261Bosák, J., On thek-index of graphs 1 (1971) 133–146Bose, R.C. and S.S. Shrikhande, Embedding the complement of an oval in a projective plane of even order6

(1973) 305–312Bose, R.C., W.G. Bridges and M.S. Shrikhande, A characterization of partial geometric designs16 (1976) 1–7Bose, R.C., W.G. Bridges and M.S. Shrikhande, Partial geometric designs and two-class partially balanced

designs 21 (1978) 97–101Boshernitzan, M. and A.S. Fraenkel, Nonhomogeneous spectra of numbers (Communication) 34 (1981) 325–

327Boswell, S.G. and J. Simpson, Edge-disjoint maximal planar graphs179(1-3) (1998) 235–241Botlík, O., Modifications of object sizes and box capacities to achieve a simultaneous fitting18 (1977) 105–108Böttcher, M. and U. Knauer, Endomorphism spectra of graphs109(1992) 45–57Bottreau, A., A. Di Bucchianico and D.E. Loeb, Computer algebra and Umbral Calculus180(1-3) (1998) 65–72Bouchakour, M. and A.R. Mahjoub, One-node cutsets and the dominating set polytope165-166(1-3) (1997)

101–123Bouchard, P., Y. Chiricota and G. Labelle, Arbres, arborescences et racines carrées symétriques139(1-3) (1995)

49–56Bouchemakh, I. and K. Engel, The order-interval hypergraph of a finite poset and the König property170(1-3)

(1997) 51–61Bouchet, A. and R. Lopez-Bracho, Decomposition of a complete graph into trails of given lengths42 (1982)

145–152Bouchet, A.,seeD. Benard 62 (1986) 261–270Bouchet, A., Unimodularity and circle graphs (Communication) 66 (1987) 203–208Bouchet, A., Maps and1-matroids 78 (1989) 59–71Bouchet, A., Recognizing locally equivalent graphs114(1993) 75–86Bouchet, A. and L. Ghier, Connectivity andβ-invariants of isotropic systems and 4-regular graphs161 (1-3)

(1996) 25–44Bouchet, A. and W. Schwärzler, The delta-sum of matching delta-matroids181(1-3) (1998) 53–63Boukliev, I.G., New bounds for the minimum length of quaternary linear codes of dimension five169 (1-3)

(1997) 185–192Boulala, M. and J.-P. Uhry, Polytope des independants d’un graphe serie-parallele27 (1979) 225–243


Bourgeois, B.A.,seeA.M. Hobbs 67 (1987) 27–42Bousquet-Mélou, M. and J.-M. Fédou, The generating function of convex polyominoes: the resolution of aq-

differential system 137(1-3) (1995) 53–75Bousquet-Mélou, M. and L. Habsieger, Sur les matrices à signes alternants139(1-3) (1995) 57–72Bousquet-Mélou, M., A method for the enumeration of various classes of column-convex polygons154 (1-3)

(1996) 1–25Bousquet-Mélou, M., New enumerative results on two-dimensional directed animals180(1-3) (1998) 73–106Boutin, D.L.,seeM.O. Albertson 127(1-3) (1994) 15–21Bouwkamp, C.J., On some new simple perfect squared squares106/107(1992) 67–75Bouwkamp, C.J., On step-2 transforms for simple perfect squared squares179(1-3) (1998) 243–252Bowler, A., Generalised Bhaskar Rao designs over non-Abelian groups125(1994) 67–72Bowler, A., On the fixed points of an automorphism of a symmetric design138(1-3) (1995) 119–124Bowler, A., Orthomorphisms of dihedral groups167-168(1-3) (1997) 141–144Boyce, W.M., On a simple optimal stopping problem5 (1973) 297–312Boza, L., A. Diánez and A. Márquez, The center of an infinite graph161(1-3) (1996) 45–52Brading, P.W.,seeD.A. Preece 125(1994) 319–327Bradley, G.H., Transformation of integer programs to knapsack problems1 (1971) 29–45Brainerd, B., On a class of languages occurring in the study of theatre2 (1972) 195–198Brand, N., Isomorphic designs that are not multiplier equivalent (Communication) 57 (1985) 159–165Brand, N., Isomorphisms of cyclic combinatorial objects78 (1989) 73–81Brand, N., On the Bays–Lambossy theorem78 (1989) 217–222Brand, N. and S. Sutinuntopas, One-factors and the existence of affine designs120(1993) 25–35Brandes, H., H. Harborth, H.-D.O.F. Gronau and C. Schwahn, Ramsey numbers for sets of small graphs125

(1994) 73–86Brandstädt, A., Partitions of graphs into one or two independent sets and cliques152(1-3) (1996) 47–54Brandstädt, A., V.D. Chepoi and F.F. Dragan, Perfect elimination orderings of chordal powers of graphs158

(1-3) (1996) 273–278Brandstädt, A.,seeF.F. Dragan 162(1-3) (1996) 93–108Brandstädt, A., F.F. Dragan and F. Nicolai, LexBFS-orderings and powers of chordal graphs171 (1-3) (1997)

27–42Brandstädt, A., Van Bang Le and T. Szymczak, Duchet-type theorems for powers of HHD-free graphs177

(1-3) (1997) 9–16Brandstädt, A., Corrigendum186(1-3) (1998) 295Brandt, S. and E. Dobson, The Erdos–Sós conjecture for graphs of girth 5150(1-3) (1996) 411–414Brandt, S.,seeD. Amar 181(1-3) (1998) 31–36Brandt, S., The local density of triangle-free graphs183(1-3) (1998) 17–25Brant, L.J. and G.L. Mullen, A study of frequency cubes69 (1988) 115–121Brass, P., Packing constants in graphs and connectivity137(1-3) (1995) 353–355Brass, P., On the Erdos-diameter of sets150(1-3) (1996) 415–419Brawley, J.V. and L. Carlitz, Irreducibles and the composed product for polynomials over a finite field65(1987)

115–139Brawley, J.V. and L. Carlitz, A test for additive decomposability of irreducibles over a finite field (Note) 76

(1989) 61–65Brawley, J.V. and D. Brown, Composed products and module polynomials over finite fields117(1993) 41–56Breckenridge, J.W., K. Varadarajan and K.H. Wehrhahn, Chains, multichains and Möbius numbers120(1993)

37–50Breen, M., A better decomposition theorem for simply connectedm-convex sets 24 (1978) 153–159Breen, M.,k-dimensional intersections of convex sets and convex kernels36 (1981) 233–237Breen, M., A decomposition theorem forℵ1-convex sets 41 (1982) 131–138Bremser, P.S., Congruence classes of matrices in GL2(Fq) (Note) 118(1993) 243–249Brennan, J.P. and J. Wolfskill, Remarks on the probability the determinant of ann× n-matrix over a finite field

vanishes (Note) 67 (1987) 311–313Brenner, J.L. and R.C. Lyndon, Infinite Eulerian tessellations46 (1983) 111–132Brent, R.P. and B.D. McKay, Determinants and ranks of random matrices overZm 66 (1987) 35–49Brenti, F., Kazhdan–Lusztig andR-polynomials from a combinatorial point of view193(1-3) (1998) 93–116


Brešar, B., On clique-gated graphs199(1-3) (1999) 201–205Bressoud, D.M. and D. Zeilberger, A short Rogers-Ramanujan bijection (Communication) 38 (1982) 313–315Bressoud, D.M.,seeG.E. Andrews 49 (1984) 223–236Bressoud, D.M.,seeD. Zeilberger 54 (1985) 201–224Bressoud, D.M., Problems on theZ-statistic 73 (1988/89) 37–48Bressoud, D.M., Unimodality of Gaussian polynomials99 (1992) 17–24Brewster, R.C., P. Hell and G. MacGillivray, The complexity of restricted graph homomorphisms167-168(1-3)

(1997) 145–154Brewster, T.L., M.J. Dinneen and V. Faber, A computational attack on the conjectures of Graffiti: New

counterexamples and proofs147(1-3) (1995) 35–55Bridges, W.G., Replication results for certain combinatorial configurations6 (1973) 191–199Bridges, W.G. and M.S. Shrikhande, Special partially balanced incomplete block designs and associated graphs

9 (1974) 1–18Bridges, W.G.,seeR.C. Bose 16 (1976) 1–7Bridges, W.G.,seeR.C. Bose 21 (1978) 97–101Bridges, W.G.,seeBhagwandas 37 (1981) 159–166Brigham, R.C. and R.D. Dutton, Graphs which, with their complements, have certain clique covering numbers

34 (1981) 1–7Brigham, R.C. and R.D. Dutton, On clique covers and independence numbers of graphs44 (1983) 139–144Brigham, R.C. and R.D. Dutton, Upper bounds on the edge clique cover number of a graph52 (1984) 31–37Brigham, R.C.,seeA.P. Shelton 59 (1986) 199–201Brigham, R.C.,seeR.D. Dutton 76 (1989) 191–195Brigham, R.C. and R.D. Dutton, Factor domination in graphs86 (1990) 127–136Brigham, R.C.,seeR.D. Dutton 147(1-3) (1995) 293–295Brightwell, G.,seeB. Bollobás 75 (1989) 47–53Brightwell, G. and J. Nešetril, Reorientations of covering graphs88 (1991) 129–132Brightwell, G., Linear extensions of random orders125(1994) 87–96Brightwell, G.,seeM. Anthony 138(1-3) (1995) 43–56Brightwell, G.R., Linear extensions of infinite posets70 (1988) 113–136Brini, A., seeM. Barnabei 29 (1980) 13–17Brini, A., seeM. Barnabei 31 (1980) 261–270Brinkmann, G. and E. Steffen, 3- and 4-critical graphs of small even order169(1-3) (1997) 193–197Brito, D., seeD. Amar 181(1-3) (1998) 31–36Britto-Pacumio, R.A., Limits of iteratedH -line graphs 199(1-3) (1999) 1–10Brlek, S.,seeJ.-P. Allouche 139(1-3) (1995) 455–461Broadie, M.N. and R.W. Cottle, A note on triangulating the 5-cube52 (1984) 39–49Brochet, J.-M. and M. Pouzet, Gallai–Milgram properties for infinite graphs95 (1991) 23–47Brock, B.W., A new construction of circulantGH(p2;Zp) (Note) 112(1993) 249–252Broder, A.Z., Ther-Stirling numbers 49 (1984) 241–259Broere, I. and C.M. Mynhardt, Remarks on the critical graph conjecture26 (1979) 209–212Broere, I. and M. Frick, On the order of uniquely(k,m)-colourable graphs 82 (1990) 225–232Broere, I., J.H. Hattingh, M.A. Henning and A.A. McRae, Majority domination in graphs138 (1-3) (1995)

125–135Broere, I.,seeG. Benadé 162(1-3) (1996) 13–22Broersma, H., H. Li, J. Li, F. Tian and H.J. Veldman, Cycles through subsets with large degree sums171(1-3)

(1997) 43–54Broersma, H.J. and F. Göbel, Coloring a graph optimally with two colors118(1993) 23–31Broersma, H.J., A note onK4-closures in hamiltonian graph theory121(1993) 19–23Broersma, H.J., J. van den Heuvel and H.J. Veldman, Long cycles, degree sums and neighborhood unions121

(1993) 25–35Broersma, H.J., J. van den Heuvel and H.J. Veldman, A generalization of Ore’s Theorem involving neighborhood

unions 122(1993) 37–49Broersma, H.J. and I. Schiermeyer, A closure concept based on neighborhood unions of independent triples124

(1994) 37–47Broersma, H.J.,seeD. Bauer 141(1-3) (1995) 1–10


Broersma, H.J., A note on the minimum size of a vertex pancyclic graph164(1-3) (1997) 29–32Broersma, H.J., Z. Ryjácek and I. Schiermeyer, Dirac’s minimum degree condition restricted to claws167-168

(1-3) (1997) 155–166Broersma, H.J.,seeT. Böhme 170(1-3) (1997) 219–222Broersma, H.J. and H. Trommel, Closure concepts for claw-free graphs185(1-3) (1998) 231–238Brooks, R.L., C.A.B. Smith, A.H. Stone and W.T. Tutte, Determinants and current flows in electric networks

100(1992) 291–301Broué, M., Codes correcteurs d’erreurs auto-orthogonaux sur le corps a deux elements et formes quadratiques

entieres definies positives a discriminant+1 17 (1977) 247–269Brousek, J., Minimal 2-connected non-hamiltonian claw-free graphs191(1-3) (1998) 57–64Brousek, J., Z. Ryjácek and O. Favaron, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs

196(1-3) (1999) 29–50Brousek, J., Z. Ryjácek and I. Schiermeyer, Forbidden subgraphs, stability and hamiltonicity197-198(1-3)

(1999) 143–155Brouwer, A.,seeA. Blokhuis 97 (1991) 63–68Brouwer, A.E.,seeM.R. Best 17 (1977) 235–245Brouwer, A.E., A. Schrijver and H. Hanani, Group divisible designs with block-size four20 (1977) 1–10Brouwer, A.E. and R. Tijdeman, On the edge-colouring problem for unions of complete uniform hypergraphs

34 (1981) 241–260Brouwer, A.E. and G.H.J. van Rees, More mutually orthogonal Latin squares39 (1982) 263–281Brouwer, A.E., P. Duchet and A. Schrijver, Graphs whose neighborhoods have no special cycles47 (1983)

177–182Brouwer, A.E., Distance regular graphs of diameter 3 and strongly regular graphs (Note) 49 (1984) 101–103Brouwer, A.E., An inequality in binary vector spaces (Note) 59 (1986) 315–317Brouwer, A.E.,seeA. Blokhuis 74 (1989) 335–339Brouwer, A.E., A unital in the Hughes plane of order nine (Note) 77 (1989) 55–56Brouwer, A.E., A note on completely regular codes (Communication) 83 (1990) 115–117Brouwer, A.E.,seeA. Blokhuis 106/107(1992) 53–60Brouwer, A.E. and W.H. Haemers, Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph106/107

(1992) 77–82Brouwer, A.E., H.A. Wilbrink and W.H. Haemers, Some 2-ranks106/107(1992) 83–92Brouwer, A.E., On complete regularity of extended codes (Note) 117(1993) 271–273Brouwer, A.E. and J.H. Koolen, A new infinite series of regular uniformly geodetic code graphs (Note) 120

(1993) 241–247Brouwer, A.E. and M. Numata, A characterization of some graphs which do not contain 3-claws124 (1994)

49–54Brouwer, A.E., On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to

the Mathieu groupM12) 126(1994) 13–27Brouwer, A.E., Variations on a theme by Weetman138(1-3) (1995) 137–145Brouwer, A.E.,seeA. Blokhuis 163(1-3) (1997) 225–227Brouwer, A.E. and H.M. Mulder, The vertex connectivity of a 0,2-graph equals its degree169 (1-3) (1997)

153–155Brown, D.,seeJ.V. Brawley 117(1993) 41–56Brown, D.P., Compound and unimodular matrices19 (1977) 1–5Brown, D.P., Compound connection matrices30 (1980) 203–209Brown, H., L. Hjelmeland and L. Masinter, Constructive graph labeling using double cosets7 (1974) 1–30Brown, H. and L. Masinter, An algorithm for the construction of the graphs of organic molecules8 (1974)

227–244Brown, J.I., D. Kelly, J. Schönheim and R.E. Woodrow, Graph coloring satisfying restraints80 (1990) 123–143Brown, J.I. and D.G. Corneil, Graph properties and hypergraph colourings98 (1991) 81–93Brown, J.I., A vertex critical graph without critical edges (Note) 102(1992) 99–101Brown, J.I. and S. Watson, Mutually complementary partial orders113(1993) 27–39Brown, J.I. and S. Watson, The number of complements of a topology onn points is at least 2n (except for some

special cases) 154(1-3) (1996) 27–39Brown, J.I.,seeD. Achlioptas 179(1-3) (1998) 1–11


Brown, J.I., Chromatic polynomials and order ideals of monomials189(1-3) (1998) 43–68Brown, M. and R. Connelly, On graphs with a constant link, II11 (1975) 199–232Brown, R.B., Sequences of functions of binomial type6 (1973) 313–331Brown, R.B., Nonexistence of a regular graph design withv = 17 andk = 6 (Note) 68 (1988) 315–318Brown, T.C., Common transversals for partitions of a finite set51 (1984) 119–124Brown, W.G. and M. Simonovits, Digraph extremal problems, hypergraph extremal problems, and the densities

of graph structures 48 (1984) 147–162Brualdi, R.A. and G.W. Dinolt, Truncations of principal geometries12 (1975) 113–138Brualdi, R.A., The diagonal hypergraph of a matrix (bipartite graph)27 (1979) 127–147Brualdi, R.A. and J.A. Ross, Matrices with isomorphic diagonal hypergraphs33 (1981) 123–138Brualdi, R.A. and J.L. Goldwasser, Permanent of the Laplacian matrix of trees and bipartite graphs48 (1984)

1–21Brualdi, R.A. and R. Manber, Chromatic number of classes of matrices of zeros and ones50 (1984) 143–152Brualdi, R.A. and E.S. Solheid, Maximum determinants of complementary acyclic matrices of zeros and ones

61 (1986) 1–19Brualdi, R.A. and J. Csima, Extending subpermutation matrices in regular classes of matrices (Note) 62 (1986)

99–101Brualdi, R.A. and R. Manber, On strong digraphs with a unique minimally strong subdigraph71 (1988) 1–7Brualdi, R.A. and V.S. Pless, On the covering radius of a code and its subcodes83 (1990) 189–199Brualdi, R.A. and B.L. Shader, Matrices of 0’s and 1’s with restricted permanental minors96 (1991) 161–174Brualdi, R.A., N. Cai and V.S. Pless, Orphan structure of the first-order Reed–Muller codes102(1992) 239–247Brualdi, R.A. and J.J. Quinn Massey, Incidence and strong edge colorings of graphs122(1993) 51–58Brualdi, R.A. and A. Fonseca, On the quasi-transversals of a matroid146(1-3) (1995) 293–297Brualdi, R.A., J.S. Graves and K.M. Lawrence, Codes with a poset metric147(1-3) (1995) 57–72Brualdi, R.A. and J.A.D. da Silva, A retract characterization of posets with the fixed-point property169 (1-3)

(1997) 199–203Bruen, A. and R. Dixon, Then-queens problem (Note) 12 (1975) 393–395Bruen, A.A. and J.C. Fisher, An observation on certain point-line configurations in classical planes106/107

(1992) 93–96Bruen, A.A., Solution to a question of A. Beutelspacher on finite linear spaces129(1-3) (1994) 219–220Brunat, J.M., M. Espona, M.A. Fiol and O. Serra, On Cayley line digraphs138(1-3) (1995) 147–159Brunat, J.M., M. Maureso and M. Mora, Characterization ofc-circulant digraphs of degree two which are

circulant 165-166(1-3) (1997) 125–137Brunat, J.M., M.A. Fiol and M.L. Fiol, Digraphs on permutations174(1-3) (1997) 73–86Brunat, J.M., M. Maureso and M. Mora, Endo-circulant digraphs: connectivity and generalized cycles197-198

(1-3) (1999) 157–167Brunetti, S.,seeE. Barcucci 190(1-3) (1998) 235–240Brunton, B.E., B.J. Wilson and T.S. Griggs, Graphs which haven/2-minimal line-distinguishing colourings155

(1-3) (1996) 19–26Bruyère, V. and C. De Felice, Synchronization and decomposability for a family of codes: Part 2140 (1-3)

(1995) 47–77Bruyneel, G.,seeW. Mielants 37 (1981) 73–77Bry, F., On the factorization of graphs with exactly one vertex of infinite degree (Note) 43 (1983) 317–320Bryant, D.E. and S. Oates-Williams, Mendelsohn designs associated with a class of idempotent quasigroups138

(1-3) (1995) 161–167Bryant, D.E.,seeP. Adams 149(1-3) (1996) 1–9Bryant, D.E., A special class of nested Steiner triple systems152(1-3) (1996) 315–320Bryant, D.E. and S. Oates-Williams, Strongly 2-perfect cycle systems and their quasigroups167-168(1-3)

(1997) 167–174Bryant, D.E., C.A. Rodger and E.R. Spicer, Embeddings ofm-cycle systems and incompletem-cycle systems:m6 14 171(1-3) (1997) 55–75

Bryant, R.D. and H. Fredricksen, Covering the de Bruijn graph89 (1991) 133–148Bryant, V. and H. Perfect, Some characterization theorems for circuit spaces associated with graphs18 (1977)

109–124


Bryant, V., A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks’theorem 158(1-3) (1996) 279–281

Brylawski, T., The lattice of integer partitions6 (1973) 201–219Brylawski, T., Connected matroids with the smallest Whitney numbers18 (1977) 243–252Brylawski, T. and J. Oxley, Several identities for the characteristic polynomial of a combinatorial geometry31

(1980) 161–170Brylawski, T.H., Some properties of basic families of subsets6 (1973) 333–341Brylawski, T.H., Hyperplane reconstruction of the Tutte polynomial of a geometric lattice35 (1981) 25–38Brylawski, T.H. and E. Dieter, Exchange systems69 (1988) 123–151Brys, K. and Z. Lonc, Clique and anticlique partitions of graphs185(1-3) (1998) 41–49Brzozowski, J.A. and I. Simon, Characterizations of locally testable events4 (1973) 243–271Brzozowski, J.A., Run languages16 (1976) 299–307Brzozowski, J.A. and F.E. Fich, On generalized locally testable languages50 (1984) 153–169Bu, T., Partitions of a vector space (Note) 31 (1980) 79–83Buck, M. and D. Wiedemann, Gray codes with restricted density48 (1984) 163–171Buckingham, M.A. and M.C. Golumbic, Partitionable graphs, circle graphs, and the Berge Strong Perfect Graph

Conjecture 44 (1983) 45–54Buckley, F., The central ratio of a graph38 (1982) 17–21Buckley, F.,seeY. Alavi 72 (1988) 3–13Bucko, J.,seeP. Mihók 191(1-3) (1998) 149–158Buekenhout, F., Questions about linear spaces129(1-3) (1994) 19–27Buekenhout, F. and M. Parker, The number of nets of the regular convex polytopes in dimension64 186(1-3)

(1998) 69–94Bugata, P., Trahtenbrot–Zykov problem and NP-completeness108(1992) 253–259Bugata, P., M. Hornák and A. Nagy, On (1,2)-realizable graphs158(1-3) (1996) 37–47Bumiller, C., On rank three graphs with a large eigenvalue (Note) 23 (1978) 1–15Buneman, P., A characterisation of rigid circuit graphs9 (1974) 205–212Buratti, M., Constructions of (q,k,1) difference families withq a prime power andk=4,5 138 (1-3) (1995)

169–175Buratti, M., Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes

161(1-3) (1996) 291–295Buratti, M.,seeL. Berardi 174(1-3) (1997) 35–46Burge, W.H., A correspondence between partitions related to generalizations of the Rogers–Ramanujan

indentities 34 (1981) 9–15Burger, A.P., E.J. Cockayne and C.M. Mynhardt, Domination and irredundance in the queens’ graph163(1-3)

(1997) 47–66Burkard, R.E., A general Hungarian method for the algebraic transportation problem22 (1978) 219–232Burkard, R.E.,seeR. Euler 62 (1986) 155–181Burkard, R.E., T. Dudás and T. Maier, Cut and patch Steiner trees for ladders161(1-3) (1996) 53–61Burkard, R.E.,seeQ.F. Yang 176(1-3) (1997) 233–254Burkill, H. and L. Mirsky, Combinatorial problems on the existence of large submatrices I6 (1973) 15–28Burkill, H. and L. Mirsky, Combinatorial problems on the existence of large submatrices II20 (1977) 103–108Burlet, M. and J. Fonlupt, Polyhedral consequences of the amalgam operation130(1-3) (1994) 39–55Burlet, M. and A.V. Karzanov, Minimum weight (T ,d)-joins and multi-joins 181(1-3) (1998) 65–76Burmeister, P., On maximal objects in classes of (di)graphs determined by prescribed factorobjects35 (1981)

17–23Burns, D., S.F. Kapoor and P.A. Ostrand, Edge cosymmetric graphs32 (1980) 99–103Burosch, G. and J.-M. Laborde, Characterization of grid graphs (Communication) 87 (1991) 85–88Burosch, G., I. Havel and J.-M. Laborde, Distance monotone graphs and a new characterization of hypercubes

110(1992) 9–16Burosch, G. and P.V. Ceccherini, Isometric embeddings into cube-hypergraphs137(1-3) (1995) 77–85Burosch, G. and P.V. Ceccherini, A characterization of cube-hypergraphs152(1-3) (1996) 55–68Burosch, G., H.-D.O.F. Gronau, J.-M. Laborde and I. Warnke, On posets ofm-ary words 152 (1-3) (1996)

69–91Burr, S.A. and J.A. Roberts, On Ramsey numbers for linear forests8 (1974) 245–250


Burr, S.A., P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Ramsey-minimal graphs for star-forests33(1981) 227–237

Burr, S.A., P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Ramsey-minimal graphs for forests38(1982) 23–32

Burr, S.A., Multicolor Ramsey numbers involving graphs with long suspended paths40 (1982) 11–20Burr, S.A. and J.W. Grossman, Ramsey numbers of graphs with long tails41 (1982) 223–227Burr, S.A., Some undecidable problems involving the edge-coloring and vertex-coloring of graphs50 (1984)

171–177Burr, S.A., J. Nešetril and V. Rödl, On the use of senders in generalized Ramsey theory for graphs54 (1985)

1–13Burr, S.A., On the Ramsey numbersr(G,nH) andr(nG,nH) whenn is large 65 (1987) 215–229Burr, S.A., What can we hope to accomplish in generalized Ramsey theory?67 (1987) 215–225Burr, S.A., On Ramsey numbers for large disjoint unions of graphs70 (1988) 277–293Burris, A.C., The irregular coloring number of a tree141(1-3) (1995) 279–283Burshtein, N., On distinct unit fractions whose sum equals 15 (1973) 201–206Burshtein, N., On natural exactly covering systems of congruences having moduli occurring at mostM times

14 (1976) 205–214Burzio, M. and J. Pelant, On complete strongly connected digraphs with the least number of 3-cycles155(1-3)

(1996) 27–30Burzio, M. and G. Ferrarese, The subdivision graph of a graceful tree is a graceful tree181 (1-3) (1998) 275–

281Buset, D., Graphs which are locally a cube46 (1983) 221–226Buset, D., Orbits on vertices and edges of finite graphs (Communication) 57 (1985) 297–299Bussemaker, F.C. and V.D. Tonchev, New extremal doubly-even codes of length 56 derived from Hadamard

matrices of order 28 (Communication) 76 (1989) 45–49Bussemaker, F.C. and V.D. Tonchev, Extremal doubly-even codes of length 40 derived from Hadamard matrices

of order 20 (Communication) 82 (1990) 317–321Buzeteanu,S.N.,seeV. Domocos 147(1-3) (1995) 287–292Buzeteanu,S.N. and V. Domoco¸s, Polynomial identities from weighted lattice path counting150 (1-3) (1996)

421–425Byard, K.,seeD. Jennings 167-168(1-3) (1997) 405–410Byard, K.,seeD. Jennings 181(1-3) (1998) 283–288Byer, O.D., Two path extremal graphs and an application to a Ramsey-type problem196(1-3) (1999) 51–64Bylka, S. and J. Komar, Intersection properties of line graphs164(1-3) (1997) 33–45Bylka, S., A. Idzik and Z. Tuza, Maximum cuts: Improvements and local algorithmic analogues of the Edwards–

Erdos inequality 194(1-3) (1999) 39–58Cabaniss, S. and B.W. Jackson, Infinite families of bi-embeddings82 (1990) 127–141Caccetta, L. and R. Häggkvist, On diameter critical graphs28 (1979) 223–229Caccetta, L. and K. Vijayan, Long cycles in subgraphs with prescribed minimum degree97 (1991) 69–81Caccetta, L. and K. Vijayan, Maximal cycles in graphs98 (1991) 1–7Caccetta, L. and W.F. Smyth, Graphs of maximum diameter102(1992) 121–141Caccetta, L.,seeN. Achuthan 151(1-3) (1996) 3–13Caccetta, L.,seeN. Ananchuen 170(1-3) (1997) 1–13Caccetta, L.,seeR.P. Anstee 179(1-3) (1998) 37–47Caccetta, L. and R.Z. Jia, On a problem concerning ordered colourings190(1-3) (1998) 241–245Cai, L. and D. Corneil, On cycle double covers of line graphs (Note) 102(1992) 103–106Cai, M.-c., A new bound on the length of the shortest string containing allr-permutations (Note) 39 (1982)

329–330Cai, M.-c., Minimallyk-connected graphs of low order and maximal size41 (1982) 229–234Cai, M.-c., A counterexample to a conjecture of Grant (Note) 44 (1983) 111Cai, M.-c., Solutions to Edmonds’ and Katona’s problems on families of separating subsets47 (1983) 13–21Cai, M.-c., On a problem of Katona on minimal completely separating systems with restrictions (Note) 48

(1984) 121–123Cai, M.-c., On separating systems of graphs49 (1984) 15–20Cai, M.-c., Restricted covering of digraphs with arborescences82 (1990) 143–152


Cai, M.-c., The maximal size of graphs with at mostk edge-disjoint paths connecting any two adjacent vertices85 (1990) 43–52

Cai, M.-c., On some factor theorems of graphs (Note) 98 (1991) 223–229Cai, M.-c., A remark on the number of vertices of degreek in a minimallyk-edge-connected graph104(1992)

221–226Cai, M.-c., An algorithm for optimum common root functions of two digraphs119(1993) 13–20Cai, M.-c., Connected [k,k+1]-factors of graphs 169(1-3) (1997) 1–16Cai, N.,seeR.A. Brualdi 102(1992) 239–247Cairnie, N. and K. Edwards, The achromatic number of bounded degree trees188(1-3) (1998) 87–97Calahan-Zijlstra, R. and R.B. Gardner, Bicyclic Steiner triple systems128(1-3) (1994) 35–44Calderbank, A.R., F.R.K. Chung and D.G. Sturtevant, Increasing sequences with nonzero block sums and

increasing paths in edge-ordered graphs50 (1984) 15–28Calderbank, A.R. and P. Frankl, Binary codes and quasi-symmetric designs83 (1990) 201–204Calderbank, A.R., Covering machines106/107(1992) 105–110Calderbank, R. and D.B. Wales, The Haemers partial geometry and the Steiner systemS(5,8,24) 51 (1984)

125–136Calkin, N.J., A curious binomial identity 131(1-3) (1994) 335–337Calkin, N.J., On the structure of a random sum-free set of positive integers190(1-3) (1998) 247–257Calmet, J., Algebraic algorithms in GF(q) 56 (1985) 101–109Calude, C., On metrizability of the free monoids15 (1976) 307–310Calude, C. and V.E. Cazanescu, On topologies generated by Moisil resemblance relations25 (1979) 109–115Camarinopoulos, L.,seeA. Behr 187(1-3) (1998) 31–38Cambini, A., An explicit form of the inverse of a particular circulant matrix (Communication) 48 (1984) 323–

325Camerini, P.M. and F. Maffioli, Heuristically guided algorithm forK-parity matroid problems 21 (1978) 103–

116Cameron, K., A min–max relation for the partialq-colourings of a graph. Part II: Box perfection74 (1989)

15–27Cameron, K. and J. Edmonds, Coflow polyhedra101(1992) 1–21Cameron, K., Coloured matchings in bipartite graphs169(1-3) (1997) 205–209Cameron, P., Research problems167-168(1-3) (1997) 605–615Cameron, P.J., Regular orbits of permutation groups on the power set (Communication) 62 (1986) 307–309Cameron, P.J., Some sequences of integers75 (1989) 89–102Cameron, P.J., Several 2-(46, 6, 3) designs (Note) 87 (1991) 89–90Cameron, P.J., The age of a relational structure95 (1991) 49–67Cameron, P.J., Covers of graphs and EGQs97 (1991) 83–92Cameron, P.J., Almost all quasigroups have rank 2106/107(1992) 111–115Cameron, P.J. and A.M. Cohen, On the number of fixed point free elements in a permutation group106/107

(1992) 135–138Cameron, P.J. and C.E. Praeger, Block-transitivet-designs I: point-imprimitive designs118(1993) 33–43Cameron, P.J., An orbit theorem for Steiner triple systems125(1994) 97–100Cameron, P.J., Two-graphs and trees127(1-3) (1994) 63–74Cameron, P.J., Infinite linear spaces129(1-3) (1994) 29–41Cameron, P.J., On the probability of connectedness167-168(1-3) (1997) 175–187Cameron, P.J., A census of infinite distance-transitive graphs192(1-3) (1998) 11–26Camina, A.R., Automorphism groups of block designs which are block transitive57 (1985) 1–7Camion, P., Linear codes with given authomorphism groups3 (1972) 33–45Cammack, L.,seeG. Schrag 78 (1989) 169–177Campbell, C.M., On cages for girth pair (6,b) 177(1-3) (1997) 259–266Campello de Souza, R.M. and P.G. Farrell, Finite field transforms and symmetry groups56 (1985) 111–116Canfield, E.R. and N.C. Wormald, Ménage numbers, bijections andP -recursiveness 63 (1987) 117–129Canfield, E.R. and D.M. Jackson, A D-finiteness result for products of permutations99 (1992) 25–30Cannon, J.J., Construction of defining relators for finite groups5 (1973) 105–129Cao, F., D.-Z. Du, D. Frank Hsu, L. Hwang and W. Wu, Super line-connectivity of consecutive-d digraphs 183

(1-3) (1998) 27–38


Capobianco, M. and O. Frank, Graph evolution by stochastic additions of points and lines46 (1983) 133–143Caragiu, M., On a class of finite upper half-planes162(1-3) (1996) 49–66Carbonara, J.O., A combinatorial interpretation of the inverse t-Kostka matrix193(1-3) (1998) 117–145Carducci, O.M., The strong perfect graph conjecture holds for diamonded odd cycle-free graphs110 (1992)

17–34Cardy, S., The proof of, and generalisations to, a conjecture by Baker and Essam4 (1973) 101–122Carini, L. and J.B. Remmel, Formulas for the expansion of the plethysmss2[s(a,b)] and s2[s(nk)] 193 (1-3)

(1998) 147–177Carlet, C., A general case of formal duality between binary nonlinear codes111(1993) 77–85Carlitz, L., Enumeration of up-down sequences4 (1973) 273–286Carlitz, L. and R. Scoville, Enumeration of rises and falls by position5 (1973) 45–59Carlitz, L. and T. Vaughan, Enumeration of sequences of given specification according to rises, falls and maxima

8 (1974) 147–167Carlitz, L., R. Scoville and T. Vaughan, Enumeration of pairs of permutations14 (1976) 215–239Carlitz, L., Alternating sequences17 (1977) 133–138Carlitz, L., Explicit formulas for the Dumont-Foata polynomial30 (1980) 211–225Carlitz, L.,seeJ.V. Brawley 65 (1987) 115–139Carlitz, L.,seeJ.V. Brawley 76 (1989) 61–65Carlson, T.J., Some unifying principles in Ramsey theory68 (1988) 117–169Carmona, A.,seeC. Balbuena 167-168(1-3) (1997) 85–100Carmona, A.,seeM.C. Balbuena 174(1-3) (1997) 3–17Carmona, A.,seeM.C. Balbuena 174(1-3) (1997) 19–27Carmona, A.,seeC. Balbuena 197-198(1-3) (1999) 61–75Carmony, L.A. and S.T. Tan,s-quasi-symmetry 34 (1981) 17–24Carnes, N.P., Cyclic antiautomorphisms of Mendelsohn triple systems126(1994) 29–45Carnielli, W.A., On covering and coloring problems for rook domains57 (1985) 9–16Caro, Y. and J. Schönheim, Generalized 1-factorization of trees (Note) 33 (1981) 319–321Caro, Y. and Y. Roditty, A note on packing trees into complete bipartite graphs and on Fishburn’s Conjecture

(Note) 82 (1990) 323–326Caro, Y., On zero-sum Ramsey numbers — stars104(1992) 1–6Caro, Y. and Z. Tuza, Bounded degrees and prescribed distances in graphs111(1993) 87–93Caro, Y.,seeN. Alon 114(1993) 3–7Caro, Y., I. Krasikov and Y. Roditty, On induced subgraphs of trees, with restricted degrees125(1994) 101–106Caro, Y., On induced subgraphs with odd degrees132(1-3) (1994) 23–28Caro, Y., Y. Roditty and J. Schönheim, On colored designs — II138(1-3) (1995) 177–186Caro, Y., Zero-sum problems — A survey152(1-3) (1996) 93–113Caro, Y., On the generalized Erdos–Szekeres Conjecture — a new upper bound160(1-3) (1996) 229–233Caro, Y., Y. Roditty and J. Schönheim, On colored designs — I164(1-3) (1997) 47–65Carrillo, L.D., Hamiltonian-connected self-complementary graphs127(1-3) (1994) 75–93Casali, M.R. and L. Grasselli, 2-Symmetric crystallizations and 2-fold branched coverings ofS3 87 (1991)

9–22Casali, M.R., Coloured knots and coloured graphs representing 3-fold simple coverings ofS3 137(1-3) (1995)

87–98Casey, K.,seeC. Barefoot 138(1-3) (1995) 93–99Casse, L.R.A. and D.G. Glynn, On the uniqueness of(q + 1)4-arcs of PG(4, q), q = 2h , h>3 48 (1984) 173–

186Casse, L.R.A.,seeM.G. Oxenham 92 (1991) 251–259Catlin, P.A., Subgraphs of graphs10 (1974) 225–233Catlin, P.A., A bound on the chromatic number of a graph (Note) 22 (1978) 81–83Catlin, P.A., Another bound on the chromatic number of a graph24 (1978) 1–6Catlin, P.A., Subgraphs with triangular components27 (1979) 149–170Catlin, P.A., Spanning eulerian subgraphs and matchings76 (1989) 95–116Catlin, P.A. and H.-J. Lai, Vertex arboricity and maximum degree141(1-3) (1995) 37–46Catlin, P.A., The reduction of graph families closed under contraction160(1-3) (1996) 67–80Catlin, P.A., Z.-Y. Han and H.-J. Lai, Graphs without spanning closed trails160(1-3) (1996) 81–91


Caughman, IV, J.S., Intersection numbers of bipartite distance-regular graphs163(1-3) (1997) 235–241Caughman IV, J.S., The Terwilliger algebras of bipartiteP - andQ-polynomial schemes 196(1-3) (1999) 65–95Caulfield, M.J., Full and quarter plane complete infinite latin squares159(1-3) (1996) 251–253Cavicchioli, A., Lins-Mandel crystallizations 57 (1985) 17–37Cavicchioli, A. and M. Meschiari, A homology theory for colored graphs137(1-3) (1995) 99–136Cazanescu, V.E., Quelques propriétés algébriques des automates2 (1972) 97–109Cazanescu, V.E.,seeC. Calude 25 (1979) 109–115Cazanescu, V.-E. and G. ¸Stefanescu, Classes of finite relations as initial abstract data types I90 (1991) 233–265Cazanescu, V.-E. and G. ¸Stefanescu, Classes of finite relations as initial abstract data types – II126 (1994)

47–65Ceccherini, P.V. and J.W.P. Hirschfeld, The dimension of projective geometry codes106/107(1992) 117–126Ceccherini, P.V.,seeG. Burosch 137(1-3) (1995) 77–85Ceccherini, P.V.,seeG. Burosch 152(1-3) (1996) 55–68Ceccherini, P.V.,seeA. Barlotti 174(1-3) (1997) 1Cechlárová, K. and P. Szabó, On the Monge property of matrices81 (1990) 123–128Cedeño, W.,seeI.J. Dejter 114(1993) 131–135Çela, E.,seeQ.F. Yang 176(1-3) (1997) 233–254Cenzer, D. and E. Howorka, On vertex k-partitions of certain infinite graphs23 (1978) 105–113Cepek, O.,seeE. Boros 165-166(1-3) (1997) 81–100Cepulic, V. and M. Essert, Biplanes (56, 11, 2) with automorphisms of order 4 fixing some point71 (1988)

9–17Cepulic, V., On symmetric block designs (40,13,4) with automorphisms of order 5128(1-3) (1994) 45–60Cepulic, V., The unique symmetric block design (61, 16, 4) admitting an automorphism of order 15 operating

standardly (Note) 175(1-3) (1997) 259–263Cerasoli, M., On the probability of a boolean polynomial of events (Communication) 44 (1983) 221–227Cerasoli, M., Enumeration with the lattice of periods (Communication) 59 (1986) 191–198Cerdeira, J.O.,seeF. Göbel 87 (1991) 29–40Cerdeira, J.O. and P. Barcia, Ordered matroids and regular independence systems154(1-3) (1996) 255–261Cerlienco, L. and M. Mureddu, Generalized Robinson–Schensted correspondences: A new algorithm133(1-3)

(1994) 79–88Cerlienco, L. and M. Mureddu, From algebraic sets to monomial linear bases by means of combinatorial

algorithms 139(1-3) (1995) 73–87Cerný, A., P. Horák and W.D. Wallis, Kirkman’s school projects167-168(1-3) (1997) 189–196Chabanne, H. and N. Sendrier, On the concatenated structures of a [49, 18, 12] binary abelian code

(Communication) 112(1993) 245–248Chadjiconstantinidis, S. and T. Chadjipadelis, A construction method of new D-, A-optimal weighing designs

whenN ≡ 3 mod 4 andk 6N − 1. 131(1-3) (1994) 39–50Chadjipadelis, T.,seeS. Chadjiconstantinidis 131(1-3) (1994) 39–50Chadjipantelis, Th. and S. Kounias, Supplementary difference sets andD-optimal designs forn≡ 2 mod 4 57

(1985) 211–216Chaffer, R.A., A construction of orthogonal arrays and applications to embedding theorems39 (1982) 23–29Chaimovich, M., Fast exact and approximate algorithms fork-partition and scheduling independent tasks114

(1993) 87–103Chakravarti, I.M., Geometric construction of some families of two-class and three-class association schemes and

codes from nondegenerate and degenerate Hermitian varieties111(1993) 95–103Chakravarti, I.M., A three-class association scheme on the flags of a finite projective plane and a (PBIB) design

defined by the incidence of the flags and the Baer subplanes in PG(2, q2) (Note) 120(1993) 249–252Chamberlin, S.R. and D.A. Sprott, On a discrete distribution associated with the statistical assessment of nominal

scale agreement92 (1991) 39–47Chameni Nembua, C. and B. Monjardet, Finite pseudocomplemented lattices and ‘permutoedre’111 (1993)

105–112Champetier, C., On the null-homotopy of graphs (Note) 64 (1987) 97–98Chan, A.H., Embedding of a pseudo-point residual design into a Möbius plane37 (1981) 29–33Chan, O., C.C. Chen and Q. Yu, On 2-extendable abelian Cayley graphs146(1-3) (1995) 19–32Chan, T.-H., Nondecreasing subsequences oft-sequences (Note) 79 (1989/90) 215–218


Chan, W., An exchange property of matroid146(1-3) (1995) 299–302Chan, W.H.,seeP.C.B. Lam 173(1-3) (1997) 285–289Chan, W.-K., M.-K. Siu and S.-L. Ma, Nonexistence of certain perfect arrays125(1994) 107–113Chandak, M.L.,seeB.L. Misra 34 (1981) 85–87Chandra, A.K. and G. Markowsky, On the number of prime implicants24 (1978) 7–11Chandrasekaran, R. and S. Shirali, Total weak unimodularity: Testing and applications51 (1984) 137–145Chandrasekaran, R. and S.N. Kabadi, Pseudomatroids71 (1988) 205–217Chang, C.-C.,seeC. Chen 170(1-3) (1997) 223–230Chang, D.K., Permanents of doubly stochastic matrices (Note) 62 (1986) 211–213Chang, G.J., The domatic number problem125(1994) 115–122Chang, G.J. and Y.-J. Tsay, The partial gossiping problem148(1-3) (1996) 9–14Chang, G.J.,seeY.-J. Tsay 163(1-3) (1997) 165–172Chang, G.J.,seeD. Kuo 169(1-3) (1997) 121–131Chang, G.J.,seeC. Chen 170(1-3) (1997) 223–230Chang, G.J.,seeS.-C. Liaw 196(1-3) (1999) 219–227Chang, G.J. and M.-J. Jou, The number of maximal independent sets in connected triangle-free graphs197-198

(1-3) (1999) 169–178Chang, G.J., B. DasGupta, W.M. Dymàcek, M. Fürer, M. Koerlin, Y.-S. Lee and T. Whaley, Characterizations of

bipartite Steinhaus graphs199(1-3) (1999) 11–25Chang, Y.,seeQ. Kang 118(1993) 263–268Chao, C.-Y., A note on labeled symmetric graphs (Note) 8 (1974) 295–297Chao, C.-Y. and E.G. Whitehead Jr., Chromatically unique graphs27 (1979) 171–177Chao, C.-Y. and G.A. Novacky Jr., On maximally saturated graphs41 (1982) 139–143Chao, C.-Y. and L.-C. Zhao, A note concerning chromatic polynomials (Note) 45 (1983) 127–128Chao, C.-Y. and J.G. Wells, On labeled vertex-transitive digraphs with a prime number of vertices (Note) 46

(1983) 311–315Chao, C.-Y. and Z. Chen, On uniquely 3-colorable graphs112(1993) 21–27Chao, C.-Y., A critically chromatic graph172(1-3) (1997) 3–7Chao, C.-Y., Z.-Y. Guo and N.-Z. Li, Onq-graphs 172(1-3) (1997) 9–16Chao, C.-Y. and Z. Chen, On uniquely 3-colorable graphs II189(1-3) (1998) 259–265Chao, J.M. and H. Kaneta, Classical arcs in PG(r ,q) for 116q619 174(1-3) (1997) 87–94Chapman, R.J. and B.S. Webb, A note on a lemma of Brauer138(1-3) (1995) 187–191Chapman, R.J., Shrinking integer lattices142(1-3) (1995) 39–48Charalambides, Ch.A., A problem of arrangements on chessboards and generalizations27 (1979) 179–186Charalambides, Ch.A., Bipartitional polynomials and their applications in combinatorics and statistics (Note)

34 (1981) 81–84Charalambides, Ch.A. and M. Koutras, On the differences of the generalized factorials at an arbitrary point and

their combinatorial applications47 (1983) 183–201Charalambides, Ch.A. and A. Kyriakoussis, An asymptotic formula for the exponential polynomials and a central

limit theorem for their coefficients 54 (1985) 259–270Chari, M.K., Matroid inequalities (Communication) 147(1-3) (1995) 283–286Chari, M.K., Reversible shellings and an inequality for h-vectors159(1-3) (1996) 255–259Charlap, L.S., H.D. Rees and D.P. Robbins, The asymptotic probability that a random biased matrix is invertible

82 (1990) 153–163Charles, P.,seeJ. Stefan 163(1-3) (1997) 201–208Charnes, A. and F. Granot, Existence and representation of diophantine and mixed diophantine solutions to linear

equations and inequalities11 (1975) 233–248Charon, I., A. Guénoche, O. Hudry and F. Woirgard, New results on the computation of median orders165-166

(1-3) (1997) 139–153Charpin, P., A descritpion of some extended cyclic codes with application to Reed–Solomon codes56 (1985)

117–124Charpin, P., Codes cycliques étendus affines-invariants et antichaines d’un ensemble partiellement ordonne80

(1990) 229–247Charpin, P.,seeT. Berger 117(1993) 1–17Chartrand, G. and S. Schuster, A note on cycle Ramsey numbers5 (1973) 313–315


Chartrand, G.,seeY. Alavi 62 (1986) 113–118Chartrand, G., H. Hevia and R.J. Wilson, The ubiquitous Petersen graph100(1992) 303–311Chartrand, G., H. Gavlas and M. Schultz, Convergent sequences of iteratedH -line graphs 147 (1-3) (1995)

73–86Chartrand, G., H. Hevia, E.B. Jarrett and M. Schultz, Subgraph distances in graphs defined by edge transfers

170(1-3) (1997) 63–79Chartrand, G., F. Harary and B.Q. Yue, On the out-domination and in-domination numbers of a digraph197-198

(1-3) (1999) 179–183Chase, K., Sandwich semigroups of binary relations28 (1979) 231–236Chase, P.J., Subsequence numbers and logarithmic concavity16 (1976) 123–140Chassé, G., Combinatorial cycles of a polynomial map over a commutative field61 (1986) 21–26Chastand, M. and N. Polat, Invariant Hamming graphs in infinite quasi-median graphs160(1-3) (1996) 93–104Chaty, G. and M. Chein, A note on top down and bottom up analysis of strongly connected digraphs16 (1976)

309–311Chávez, M.J.,seeR. Ayala 194(1-3) (1999) 13–37Check, P.L. and C.J. Colbourn, Concerning difference families with block size four133(1-3) (1994) 285–289Chee, Y.M., Graphicalt-designs with block sizes three and four (Note) 91 (1991) 201–206Chee, Y.M. and G.F. Royle, The 2-rotational Steiner triple systems of order 2597 (1991) 93–100Chein, M.,seeG. Chaty 16 (1976) 309–311Chein, M., M. Habib and M.C. Maurer, Partitive hypergraphs37 (1981) 35–50Chen, B., Parametric Möbius inversion formulas169(1-3) (1997) 211–215Chen, B. and M. Yan, The geometric cone relations for simplicial and cubical complexes183 (1-3) (1998)

39–46Chen, B. and S. Zhou, Upper bounds forf -domination number of graphs185(1-3) (1998) 239–243Chen, B. and S. Lawrencenko, Structural characterization of projective flexibility188(1-3) (1998) 233–238Chen, B. and S. Zhou, Domination number and neighbourhood conditions195(1-3) (1999) 81–91Chen, B.-L. and H.-L. Fu, Edge domination in complete partite graphs132(1-3) (1994) 29–35Chen, B.-L., C.-K. Cheng, H.-L. Fu and K.-C. Huang, A study of the total chromatic number of equibipartite

graphs 184(1-3) (1998) 49–60Chen, B.-L., L. Dong, Q.-Z. Liu and K.-C. Huang, Total colorings of equibipartite graphs194 (1-3) (1999)

59–65Chen, C.,seeL.-H. Hsu 65 (1987) 53–63Chen, C.,seeY. Zhu 85 (1990) 301–311Chen, C. and J. Wang, Factors in graphs with odd-cycle property112(1993) 29–40Chen, C., Binding number and toughness for matching extension146(1-3) (1995) 303–306Chen, C., C.-C. Chang and G.J. Chang, Proper interval graphs and the guard problem170(1-3) (1997) 223–230Chen, C., Matchings and matching extensions in graphs186(1-3) (1998) 95–103Chen, C.C. and K.M. Koh, A characterization of finite distributive planar lattices5 (1973) 207–213Chen, C.C., On the structure of complete graphs without alternating cycles28 (1979) 1–5Chen, C.C. and P. Manalastas Jr., Every finite strongly connected digraph of stability 2 has a Hamiltonian path

44 (1983) 243–250Chen, C.C., K.M. Koh and S.C. Lee, On the grading numbers of direct products of chains49 (1984) 21–26Chen, C.C., On edge-Hamiltonian property of Cayley graphs72 (1988) 29–33Chen, C.C., K.M. Koh and Y.H. Peng, On the higher-order edge toughness of a graph111(1993) 113–123Chen, C.C.,seeO. Chan 146(1-3) (1995) 19–32Chen, C.C.,seeB. Alspach 151(1-3) (1996) 19–38Chen, C.C., G.L. Chia, K.M. Koh, N.Z. Li and K.L. Teo, Preface172(1-3) (1997) 1Chen, D., C.C. Lindner and D.R. Stinson, Further results on large sets of disjoint group-divisible designs110

(1992) 35–42Chen, G., Hamiltonian graphs involving neighborhood intersections (Note) 112(1993) 253–257Chen, G.,seeP. Bendrossian 115(1993) 39–50Chen, G., A result onC4-star Ramsey numbers163(1-3) (1997) 243–246Chen, G., R.H. Schelp and W.E. Shreve, A specialk-coloring for a connectedk-chromatic graph 170 (1-3)

(1997) 231–236Chen, G., A. Gyárfás and R.H. Schelp, Vertex colorings with a distance restriction191(1-3) (1998) 65–82


Chen, G., R.J. Gould and M.S. Jacobson, On 2-factors containing 1-factors in bipartite graphs197-198(1-3)(1999) 185–194

Chen, J., Sharp bound of thekth eigenvalue of trees128(1-3) (1994) 61–72Chen, J., J.L. Gross and R.G. Rieper, Overlap matrices and total imbedding distributions128(1-3) (1994) 73–94Chen, J., D. Archdeacon and J.L. Gross, Maximum genus and connectivity149(1-3) (1996) 19–29Chen, J., S.P. Kanchi and J.L. Gross, A tight lower bound on the maximum genus of a simplicial graph156

(1-3) (1996) 83–102Chen, R.-s.,seeF.-j. Zhang 72 (1988) 405–415Chen, W. and T. Kløve, Lower bounds on multiple difference sets98 (1991) 9–21Chen, W. and T. Kløve, Lower bounds on multiple distinct sums sets148(1-3) (1996) 15–35Chen, W. and T. Kløve, Disjoint sets of distinct sum sets175(1-3) (1997) 69–77Chen, W.Y.C., Maximum(g,f )-factors of a general graph91 (1991) 1–7Chen, W.Y.C. and G.-C. Rota,q-Analogs of the inclusion-exclusion principle and permutations with restricted

position 104(1992) 7–22Chen, W.Y.C. and R.P. Stanley, Derangements on then-cube 115(1993) 65–75Chen, W.Y.C., The theory of compositionals122(1993) 59–87Chen, W.Y.C., The skew, relative, and classical derangements160(1-3) (1996) 235–239Chen, X., Some families of chromatically unique bipartite graphs184(1-3) (1998) 245–252Chen, X.E. and K.Z. Ouyang, Chromatic classes of certain 2-connected (n,n+2)-graphs homeomorphic toK4

172(1-3) (1997) 17–29Chen, X.E. and K.Z. Ouyang, Chromatic classes of certain 2-connected (n,n+2)-graphs II 172 (1-3) (1997)

31–38Chen, Y.-C., A short proof of Kundu’sk-factor theorem (Note) 71 (1988) 177–179Chen, Y.-g., Onm-harmonic sequences162(1-3) (1996) 273–280Chen, Y.-G., A theorem on harmonic sequences186(1-3) (1998) 287–288Chen, Z.,seeC.-Y. Chao 112(1993) 21–27Chen, Z., On polynomial functions fromZn to Zm 137(1-3) (1995) 137–145Chen, Z., Harary’s conjectures on integral sum graphs160(1-3) (1996) 241–244Chen, Z., On polynomial functions fromZn1 ×Zn2 × · · · ×Znr to Zm 162(1-3) (1996) 67–76Chen, Z., Integral sum graphs from identification181(1-3) (1998) 77–90Chen, Z.,seeC.-Y. Chao 189(1-3) (1998) 259–265Chen, Z.-b. and F.-j. Zhang, Bounds of the longest directed cycle length for minimal strong digraphs68 (1988)

9–13Chen, Z.-H., Spanning closed trails in graphs117(1993) 57–71Chen, Z.-H., The size of graphs with clique numberm and without nowhere-zero 4-flows163 (1-3) (1997)

247–249Chen, Z.-H., Supereulerian graphs, independent sets, and degree-sum conditions179(1-3) (1998) 73–87Cheng, C.-K.,seeB.-L. Chen 184(1-3) (1998) 49–60Cheng, C.T. and L.J. Cowen, On the local distinguishing numbers of cycles196(1-3) (1999) 97–108Cheng, Y., Switching classes of directed graphs andH -equivalent matrices 61 (1986) 27–40Cheng, Y. and N.J.A. Sloane, The automorphism group of an [18, 9, 8] quaternary code83 (1990) 205–212Cheng, Z.,seeA.J.W. Hilton 101(1992) 135–147Chepoi, V.,seeH.-J. Bandelt 160(1-3) (1996) 25–39Chepoi, V., A note onr-dominating cliques 183(1-3) (1998) 47–60Chepoi, V. and S. Klavžar, Distances in benzenoid systems: Further developments192(1-3) (1998) 27–39Chepoi, V.D.,seeA. Brandstädt 158(1-3) (1996) 273–278Chernoff, W.W., Permutations withpl -th roots 125(1994) 123–127Chernoff, W.W., Interwoven polygonal frames167-168(1-3) (1997) 197–204Chernyak, A.A., Zh.A. Chernyak and R.I. Tyshkevich, On forcibly hereditaryP -graphical sequences64 (1987)

111–128Chernyak, A.A.,seeZh.A. Chernyak 62 (1986) 133–138Chernyak, A.A. and Zh.A. Chernyak, Pseudodomishold graphs (Communication) 84 (1990) 193–196Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs89 (1991) 1–6Chernyak, A.A. and Zh.A. Chernyak,r-Multihypergraphs with prescribed edge degree sequences170 (1-3)

(1997) 237–240


Chernyak, Z.A.,seeA.A. Chernyak 89 (1991) 1–6Chernyak, Zh.A.,seeA.A. Chernyak 64 (1987) 111–128Chernyak, Zh.A. and A.A. Chernyak, About recognizing(α,β) classes of polar graphs62 (1986) 133–138Chernyak, Zh.A.,seeA.A. Chernyak 84 (1990) 193–196Chernyak, Zh.A.,seeA.A. Chernyak 170(1-3) (1997) 237–240Cherowitzo, W., Hyperovals in Desarguesian planes: An update155(1-3) (1996) 31–38Chetwynd, A.G. and H.P. Yap, Chromatic index critical graphs of order 947 (1983) 23–33Chetwynd, A.G. and A.J.W. Hilton, 1-factorizing regular graphs of high degree – An improved bound75(1989)

103–112Chetwynd, A.G. and A.J.W. Hilton, Outline symmetric latin squares97 (1991) 101–117Chetwynd, A.G. and S.J. Rhodes, Chessboard squares141(1-3) (1995) 47–59Chetwynd, A.G. and S.J. Rhodes, Avoiding partial Latin squares and intricacy177(1-3) (1997) 17–32Chew, K.H., Total chromatic number of regular graphs of odd order and high degree154(1-3) (1996) 41–51Chew, K.H., The chromatic index of graphs of high maximum degree162(1-3) (1996) 77–91Chew, K.H., On Vizing’s theorem, Adjacency lemma and fan argument generalized to multigraphs171 (1-3)

(1997) 283–286Chia, G.L., The chromaticity of wheels with a missing spoke (Note) 82 (1990) 209–212Chia, G.L., The chromaticity of wheels with a missing spoke II148(1-3) (1996) 305–310Chia, G.L., On graphs uniquely colorable under the action of their automorphism groups162 (1-3) (1996)

281–284Chia, G.L., On the chromatic equivalence class of a family of graphs162(1-3) (1996) 285–289Chia, G.L.,seeC.C. Chen 172(1-3) (1997) 1Chia, G.L., Some problems on chromatic polynomials172(1-3) (1997) 39–44Chia, G.L., A bibliography on chromatic polynomials172(1-3) (1997) 175–191Chia, G.L., On the chromatic equivalence class of graphs178(1-3) (1998) 15–23Chiang, N.-P. and H.-L. Fu, The achromatic indices of the regular complete multipartite graphs141(1-3) (1995)

61–66Chiang, N.-P. and H.-L. Fu, On upper bounds for the pseudo-achromatic index175(1-3) (1997) 79–86Chiavacci, R. and G. Pareschi, Some bounds for the regular genus of PL-manifolds82 (1990) 165–180Chigbu, P.E.,seeR.A. Bailey 167-168(1-3) (1997) 73–84Chi Kim, A. and B.N. Neumann, Laws in a class of groupoids92 (1991) 145–158Chilakamarri, K.B., Unit-distance graphs in rationaln-spaces 69 (1988) 213–218Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs (Note) 118

(1993) 253–257Chinn, P.Z., R.B. Richter and M. Truszczynski, Primal graphs with small degrees87 (1991) 237–248Chiricota, Y. and G. Labelle, Familles de solutions combinatoires dey′ = 1+ y2 et d’équations différentielles

autonomes 115(1993) 77–93Chiricota, Y.,seeP. Bouchard 139(1-3) (1995) 49–56Cho, C.J., Rotational Steiner triple systems42 (1982) 153–159Choffrut, C. and M. Goldwurm, Determinants and Möbius functions in trace monoids194(1-3) (1999) 239–247Choi, S.-y. and P. Guan, A spanning tree of the 2m-dimensional hypercube with maximum number of degree-

preserving vertices (Note) 117(1993) 275–277Chopra, D.V., On arrays with some combinatorial structure138(1-3) (1995) 193–198Chottin, L., Une demonstration combinatoire de la formule de Lagrange a deux variables13 (1975) 215–224Chou, C.-C., C.-M. Fu and W.-C. Huang, Decomposition ofKm,n into short cycles 197-198(1-3) (1999) 195–

203Choudum, S.A., Some 4-valent, 3-connected, planar, almost pancyclic graphs18 (1977) 125–129Choudum, S.A.,seeV.N. Bhat-Nayak 23 (1978) 17–22Choudum, S.A., On graphic and 3-hypergraphic sequences (Note) 87 (1991) 91–95Choudum, S.A., On forcibly connected graphic sequences96 (1991) 175–181Choudum, S.A. and K. Kayathri, There are no edge-chromatic 4-critical graphs of order 12141 (1-3) (1995)

67–73Chouinard II, L.G., Partitions of the 4-subsets of a 13-set into disjoint projective planes (Note) 45 (1983) 297–

300Chouinard II, L.G., E.S. Kramer and D.L. Kreher, Graphicalt-wise balanced designs46 (1983) 227–240


Chouinard II, L.G., Bounding graphicalt-wise balanced designs159(1-3) (1996) 261–263Chow, T., Distances forbidden by two-colorings ofQ3 andAn 115(1993) 95–102Chow, T.Y., On the Dinitz conjecture and related conjectures145(1-3) (1995) 73–82Chow, Y.,seeC.J. Liu 44 (1983) 285–291Chow, Y., On the number of regular configurations66 (1987) 51–58Christen, C.A., Search problems: one, two or many rounds136(1-3) (1994) 39–51Christen, C.A., G. Coray and S.M. Selkow, A characterization ofn-component graphs149 (1-3) (1996) 279–

281Christiansen, M., J. Lützen, G. Sabidussi and B. Toft, Julius Petersen annotated bibliography100(1992) 83–97Christofi, C., Enumerating 4× 5 and 5× 6 double Youden rectangles125(1994) 129–135Chrysaphinou, O., On Touchard polynomials54 (1985) 143–152Chrzastowski-Wachtel, P.,seeM. Raczunas 150(1-3) (1996) 347–357Chu, W., A new combinatorial interpretation for generalized Catalan number (Note) 65 (1987) 91–94Chu, W. and L.C. Hsu, On some classes of inverse series relations and their applications123(1993) 3–15Chu, W., Distributivity and decomposability on the lattices satisfying the chain conditions174 (1-3) (1997)

95–97Chuan, W.-F.,α-Words and factors of characteristic sequences177(1-3) (1997) 33–50Chumillas, V.,seeA. Borobia 179(1-3) (1998) 49–57Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures110(1992) 43–59Chung, F.R.K., On the Ramsey numbersN(3,3, . . . ,3;2) 5 (1973) 317–321Chung, F.R.K.,seeJ.E. Herman 20 (1977) 33–40Chung, F.R.K., On partitions of graphs into trees23 (1978) 23–30Chung, F.R.K., On the coverings of graphs30 (1980) 89–93Chung, F.R.K.,seeA.R. Calderbank 50 (1984) 15–28Chung, F.R.K.,seeN. Alon 72 (1988) 15–19Chung, F.R.K. and P.D. Seymour, Graphs with small bandwidth and cutwidth75 (1989) 113–119Chung, F.R.K., A. Gyárfás, Z. Tuza and W.T. Trotter, The maximum number of edges in 2K2-free graphs of

bounded degree81 (1990) 129–135Chung, F.R.K. and R.L. Graham, On hypergraphs having evenly distributed subhypergraphs111 (1993) 125–

129Chung, K.M. and C.L. Liu, A generalization of ramsey theory for graphs21 (1978) 117–127Chung, M.J. and B. Ravikumar, Bounds on the size of test sets for sorting and related networks81 (1990) 1–9Chung, M.S. and D.B. West, Large 2P3-free graphs with bounded degree150(1-3) (1996) 69–79Chungphaisan, V., Conditions for sequences to ber-graphic 7 (1974) 31–39Chvátal, V. and P. Erdös, A note on Hamiltonian circuits2 (1972) 111–113Chvatal, V., P. Erdös and Z. Hedrlin, Ramsey’s theorem and self-complementary graphs3 (1972) 301–304Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems4 (1973) 305–337Chvátal, V., Tough graphs and hamiltonian circuits5 (1973) 215–228Chvátal, V.,seeJ.A. Bondy 15 (1976) 111–135Chvátal, V., The tail of the hypergeometric distribution (Note) 25 (1979) 285–287Chvátal, V., R.L. Graham, A.F. Perold and S.H. Whitesides, Combinatorial designs related to the strong perfect

graph conjecture 26 (1979) 83–92Chvátal, V.,seeJ. Akiyama 85 (1990) 247–255Chvátal, V. and W. Cook, The discipline number of a graph86 (1990) 191–198Chvátal, V., In praise of Claude Berge165-166(1-3) (1997) 3–9Chvátalová, J., Optimal labelling of a product of two paths11 (1975) 249–253Chvatalova, J. and J. Opatrny, The bandwidth problem and operations on graphs61 (1986) 141–150Ciampi, R.P., Stone’s representation theorem for Boolean hyperalgebras topological version155 (1-3) (1996)

211–214Cieslik, D. and J. Linhart, Steiner minimal trees inL2

p 155(1-3) (1996) 39–48Cignoli, R., Quantifiers on distributive lattices96 (1991) 183–197Cimikowski, R. and D. Coppersmith, The sizes of maximal planar, outerplanar, and bipartite planar subgraphs

149(1-3) (1996) 303–309Cižek, N. and S. Klavžar, On the chromatic number of the lexicographic product and the Cartesian sum of graphs

134(1-3) (1994) 17–24


Claasen, H.L.,seeR.W. Goldbach 159(1-3) (1996) 111–118Clapham, C.R.J., Hamiltonian arcs in self-complementary graphs8 (1974) 251–255Clapham, C.R.J., Hamiltonian arcs in infinite self-complementary graphs13 (1975) 307–314Clapham, C.R.J., The bipartite tournament associated with a fabric (Note) 57 (1985) 195–197Clapham, C.R.J., Universal tilings and universal(0,1)-matrices (Note) 58 (1986) 87–92Clapham, C.R.J., Graphs self-complementary inKn − e 81 (1990) 229–235Clapham, C.R.J. and J. Sheehan, All trees are 1-embeddable and all except stars are 2-embeddable (Note) 120

(1993) 253–259Clapham, P.C., Steiner triple systems with block-transitive automorphism groups14 (1976) 121–131Clark, B.N., C.J. Colbourn and D.S. Johnson, Unit disk graphs86 (1990) 165–177Clark, L., R.C. Entringer and D.E. Jackson, Minimum graphs with completek-closure 30 (1980) 95–101Clark, L.H. and R.C. Entringer, The number of cutvertices in graphs with given minimum degree81 (1990)

137–145Clark, L.H.,seeL.A. Székely 103(1992) 293–300Clark, L.H.,seeC.A. Barefoot 125(1994) 15–30Clark, L.H.,seeC.A. Barefoot 150(1-3) (1996) 31–48Clark, L.H. and D. Haile, Remarks on the size of critical edge-chromatic graphs171(1-3) (1997) 287–293Clark, L.H.,seeD.W. Bange 178(1-3) (1998) 1–14Clark, L.H.,seeA.T. Amin 187(1-3) (1998) 1–17Clark, W.E., Equidistant cyclic codes over GF(q) 17 (1977) 139–141Clark, W.E., Cyclic codes over GF(q) with simple orbit structure 61 (1986) 151–164Clark, W.E., L.A. Dunning and D.G. Rogers, Binary set functions and parity check matrices80 (1990) 249–265Clark, W.E., Blocking sets in finite projective spaces and uneven binary codes (Note) 94 (1991) 65–68Clarke, F.H., A graph polynomial and its applications3 (1972) 305–313Clarke, F.H. and R.E. Jamison, Multicolorings, measures and games on graphs14 (1976) 241–245Clarke, R.J., Covering a set by subsets81 (1990) 147–152Clausen, M. and F. Stötzer, Jeu de taquin and connected standard skew tableaux (Communication) 45 (1983)

133–135Clay, J.R., More balanced incomplete block designs from Frobenius groups59 (1986) 229–234Clements, G.F., More on the generalized Macaulay theorem1 (1971) 247–255Clements, G.F., A minimization problem concerning subsets of a finite set4 (1973) 123–128Clements, G.F., Sperner’s theorem with constraints10 (1974) 235–255Clements, G.F., More on the generalized Macaulay theorem — II18 (1977) 253–264Clements, G.F. and H.-D.O.F. Gronau, On maximal antichains containing no set and its complement33 (1981)

239–247Clements, G.F., Antichains in the set of subsets of a multiset48 (1984) 23–45Clements, G.F., Antichains in the set of subsets of a multiset (Erratum) 54 (1985) 347Clements, G.F., An extremal problem for antichains of subsets of a multiset63 (1987) 1–14Clements, G.F., On multisetk-families 69 (1988) 153–164Clements, G.F., The cubical poset is additive169(1-3) (1997) 17–28Clements, G.F., Yet another generalization of the Kruskal–Katona theorem184(1-3) (1998) 61–70Clivio, A., Tilings of a torus with rectangular boxes91 (1991) 121–139Cochand, M., A. Gaillard and H. Gröflin, Lattice matrices, intersection of ring families and dicuts110 (1992)

61–80Cochand, M. and G. Károlyi, On a graph colouring problem194(1-3) (1999) 249–252Cock, J.C., Toroidal tilings from de Bruijn–Good cyclic sequences (Note) 70 (1988) 209–210Cockayne, E.J. and S.T. Hedetniemi, Disjoint independent dominating sets in graphs15 (1976) 213–222Cockayne, E.J., B.L. Hartnell and S.T. Hedetniemi, A linear algorithm for disjoint matchings in trees21 (1978)

129–136Cockayne, E.J.,seeI.J. Holyer 26 (1979) 243–246Cockayne, E.J., O. Favaron, C. Payan and A.G. Thomason, Contributions to the theory of domination,

independence and irredundance in graphs33 (1981) 249–258Cockayne, E.J.,seeB. Bollobás 49 (1984) 197–199Cockayne, E.J., B. Gamble and B. Shepherd, Domination parameters for the bishops graph58 (1986) 221–227


Cockayne, E.J., S.T. Hedetniemi and R. Laskar, Gallai theorems for graphs, hypergraphs, and set systems72(1988) 35–47

Cockayne, E.J. and C.M. Mynhardt, On the product of upper irredundance numbers of a graph and its complement76 (1989) 117–121

Cockayne, E.J., Chessboard domination problems86 (1990) 13–20Cockayne, E.J.,seeB. Bollobás 86 (1990) 89–97Cockayne, E.J., O. Favaron, H. Li and G. MacGillivray, The product of the independent domination numbers of

a graph and its complement (Note) 90 (1991) 313–317Cockayne, E.J. and C.M. Mynhardt, The sequence of upper and lower domination, independence and

irredundance numbers of a graph122(1993) 89–102Cockayne, E.J., G. MacGillivray and C.M. Mynhardt, Convexity of minimal dominating functions of trees — II

125(1994) 137–146Cockayne, E.J., G. Fricke and C.M. Mynhardt, On a Nordhaus–Gaddum type problem for independent

domination 138(1-3) (1995) 199–205Cockayne, E.J. and C.M. Mynhardt, A characterisation of universal minimal total dominating functions in trees

141(1-3) (1995) 75–84Cockayne, E.J., O. Favaron and C.M. Mynhardt, Universal maximal packing functions of graphs159 (1-3)

(1996) 57–68Cockayne, E.J.,seeA.P. Burger 163(1-3) (1997) 47–66Cockayne, E.J. and C.M. Mynhardt, Domination and irredundance in cubic graphs167-168(1-3) (1997) 205–

214Cockayne, E.J., J.H. Hattingh, S.M. Hedetniemi, S.T. Hedetniemi and A.A. McRae, Using maximality and

minimality conditions to construct inequality chains176(1-3) (1997) 43–61Cockayne, E.J., S.M. Hedetniemi, S.T. Hedetniemi and C.M. Mynhardt, Irredundant and perfect neighbourhood

sets in trees 188(1-3) (1998) 253–260Cogis, O., Ferrers digraphs and threshold graphs38 (1982) 33–46Cogis, O., On the Ferrers dimension of a digraph38 (1982) 47–52Cohen, A.M.,seeP.J. Cameron 106/107(1992) 135–138Cohen, A.M. and B.N. Cooperstein, Generalized hexagons of even order106/107(1992) 139–146Cohen, D.I.A. and T.M. Katz, Recurrence of a random walk on the half-line as the generating function for the

Catalan numbers (Communication) 29 (1980) 213–214Cohen, G. and P. Frankl, On tilings of the binary vector space31 (1980) 271–277Cohen, G. and A. Lempel, Linear intersecting codes56 (1985) 35–43Cohen, G. and P. Frankl, Good coverings of Hamming spaces with spheres56 (1985) 125–131Cohen, G.D., Applications of coding theory to communication combinatorial problems83 (1990) 237–248Cohen, G.D. and S.N. Litsyn, On the covering radius of Reed–Muller codes106/107(1992) 147–155Cohen, G.D. and G. Zemor, Write-isolated memories (WIMs)114(1993) 105–113Cohen, J.E., The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper

interval graph 40 (1982) 21–24Cohen, S.D., Primitive elements and polynomials with arbitrary trace83 (1990) 1–7Cohen, S.D.,seeI. Anderson 138(1-3) (1995) 31–41Cohn, J.H.E., AD-optimal design of order 102 (Communication) 102(1992) 61–65Cohn, J.H.E., Complex D-optimal designs156(1-3) (1996) 237–241Cohn, K.J., Cyclomatic numbers of planar graphs178(1-3) (1998) 245–250Colbourn, C.J., M.J. Colbourn and A. Rosa, Completing small partial triple systems45 (1983) 165–179Colbourn, C.J. and A.I. Weiss, A census of regular 3-polystroma arising from honeycombs50 (1984) 29–36Colbourn, C.J., Edge-packings of graphs and network reliability72 (1988) 49–61Colbourn, C.J. and V. Rödl, Percentages in pairwise balanced designs77 (1989) 57–63Colbourn, C.J.,seeE.S. El-Mallah 80 (1990) 21–40Colbourn, C.J. and E.S. Mahmoodian, The spectrum of support sizes for threefold triple systems83 (1990)

9–19Colbourn, C.J.,seeB.N. Clark 86 (1990) 165–177Colbourn, C.J. and L.K. Stewart, Permutation graphs: Connected domination and Steiner trees86 (1990) 179–

189


Colbourn, C.J., K.T. Phelps, M.J. de Resmini and A. Rosa, Partitioning Steiner triple systems into complete arcs89 (1991) 149–160

Colbourn, C.J., R.A. Mathon, A. Rosa and N. Shalaby, The fine structure of threefold triple systems:v ≡ 1 or3(mod6) 92 (1991) 49–64

Colbourn, C.J. and A. Hartman, Intersections and supports of quadruple systems97 (1991) 119–137Colbourn, C.J., D.G. Hoffman and C.A. Rodger, Directed star decompositions of directed multigraphs97

(1991) 139–148Colbourn, C.J. and E.S. Elmallah, Reliable assignments of processors to tasks and factoring on matroids114

(1993) 115–129Colbourn, C.J. and E.S. Mahmoodian, Support sizes of sixfold triple systems115(1993) 103–131Colbourn, C.J.,seeP.L. Check 133(1-3) (1994) 285–289Colbourn, C.J.,seeF.E. Bennett 160(1-3) (1996) 49–65Colbourn, C.J.,seeZ. Jiang 183(1-3) (1998) 153–160Colbourn, C.J.,seeR. Gallant 184(1-3) (1998) 101–110Colbourn, M.J.,seeC.J. Colbourn 45 (1983) 165–179Cole, T., Non-crossing of plane minimal spanning and minimalT 1 networks 177(1-3) (1997) 51–65Collatz, L., Equipartition with square numbers (Note) 42 (1982) 313–316Collatz, L., The 93 classes of equitilings of the plane with characteristics> 3 102(1992) 1–11Collier, J.B. and E.F. Schmeichel, New flip-flop constructions for hypohamiltonian graphs18 (1977) 265–271Collins, C.B., I.P. Goulden, D.M. Jackson and O.M. Nierstrasz, A combinatorial application of matrix Riccati

equations and theirq-analogue 36 (1981) 139–153Collins, K.,seeD. Moak 131(1-3) (1994) 195–204Collins, K.L.,seeM.O. Albertson 54 (1985) 127–132Collins, K.L., P.W. Shor and J.R. Stembridge, A lower bound for 0, 1,∗ tournament codes63 (1987) 15–19Collins, K.L., Factoring distance matrix polynomials122(1993) 103–112Collins, K.L. and L.B. Krompart, The number of Hamiltonian paths in a rectangular grid169 (1-3) (1997)

29–38Compton, K.J., Some methods for computing component distribution probabilities in relational structures66

(1987) 59–77Conder, M., Generating the Mathieu groups and associated Steiner systems112(1993) 41–47Conder, M., Explicit definition of the binary reflected Gray codes195(1-3) (1999) 245–249Conforti, M., D.G. Corneil and A.R. Mahjoub,Ki -covers I: Complexity and polytopes58 (1986) 121–142Conforti, M.,seeF. Barahona 66 (1987) 213–218Conforti, M. and M. Laurent, A characterization of matroidal systems of inequalities69 (1988) 165–171Conforti, M. and M.R. Rao, Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets

104(1992) 23–47Conforti, M. and M.R. Rao, Articulation sets in linear perfect matrices II: the wheel theorem and clique

articulations 110(1992) 81–118Conforti, M., G. Cornuéjols and K. Vuškovic, Balanced cycles and holes in bipartite graphs199 (1-3) (1999)

27–33Cong, T.T. and M. Sato, One-dimensional random walk with unequal step lengths restricted by an absorbing

barrier 40 (1982) 153–162Cong, T.T.,seeM. Sato 43 (1983) 249–261Connelly, R.,seeM. Brown 11 (1975) 199–232Constantin, J. and B. Courteau, Partitions lineaires arguesiennes d’un espace vectoriel33 (1981) 139–147Constantin, J. and G. Fournier, Ordonnes escamotables et points fixes53 (1985) 21–33Constantin, J.,seeJ.-P. Barthélemy 111(1993) 49–63Constantin, J.,seeM.-F. Bélanger 130(1-3) (1994) 9–17Constantine, G.M., Schur convex functions on the spectra of graphs45 (1983) 181–188Constantine, G.M.,seeE.J. Farrell 89 (1991) 203–210Constantineau, I., Le nombre d’arbresm-Husimis invariants sous une permutation des sommets139 (1-3)

(1995) 89–103Constantineau, I. and G. Labelle, Une généralisation automorphe des nombres de Stirling157 (1-3) (1996)

53–64


Conway, J.H. and V. Pless, On primes dividing the group order of a doubly-even (72, 36, 16) code and the grouporder of a quaternary (24, 12, 10) code38 (1982) 143–156

Conway, J.H., S.J. Lomonaco Jr. and N.J.A. Sloane, A [45, 13] code with minimal distance 1683 (1990) 213–217

Conway, J.H., Integral lexicographic codes83 (1990) 219–235Cook, C.R., Further characterizations of cubic lattice graphs4 (1973) 129–138Cook, C.R., Two characterizations of interchange graphs of completem-partite graphs 8 (1974) 305–311Cook, W.,seeV. Chvátal 86 (1990) 191–198Cooper, C., Pancyclic Hamilton cycles in random graphs91 (1991) 141–148Cooper, C.,seeM. Anthony 138(1-3) (1995) 43–56Cooperstein, B.N.,seeA.M. Cohen 106/107(1992) 139–146Coppersmith, D.,seeR. Cimikowski 149(1-3) (1996) 303–309Coray, G.,seeC.A. Christen 149(1-3) (1996) 279–281Corbas, B. and G.D. Williams, Matrix representatives for three-dimensional bilinear forms over finite fields185

(1-3) (1998) 51–61Cordova, J.,seeI.J. Dejter 72 (1988) 63–70Cordovil, R. and M. Las Vergnas, Geometries simpliciales unimodulaires26 (1979) 213–217Cordovil, R., Sur un theoreme de separation des matroïdes orientes de rang trois40 (1982) 163–169Cordovil, R., The directions determined byn points in the plane: A matroidal generalization43 (1983) 131–137Cordovil, R. and P. Duchet, Separation par une droite dans les matroïdes orientes de rang 3 (Note) 62 (1986)

103–104Cordovil, R. and P. Duchet, On sign-invariance graphs of uniform oriented matroids79 (1989/90) 251–257Cordovil, R., K. Fukuda and M.L. Moreira, Clutters and matroids89 (1991) 161–171Cordovil, R. and M.L. Moreira, A homotopy theorem on oriented matroids111(1993) 131–136Cordovil, R., A.G. de Oliveira and M.L. Vergnas, A generalized Desargues configuration and the pure braid group

160(1-3) (1996) 105–113Cordovil, R., Coloring matroids 165-166(1-3) (1997) 155–160Cori, R. and J. Richard, Enumeration des graphes planaires a l’aide des series formelles en variables non

commutatives 2 (1972) 115–162Cori, R., Sur la rationalité de certaines séries génératrices3 (1972) 315–331Corneil, D.,seeL. Cai 102(1992) 103–106Corneil, D.G. and J.M. Keil, A note on a conjecture by Gavril on clique separable graphs (Note) 46 (1983)

317–318Corneil, D.G.,seeM. Conforti 58 (1986) 121–142Corneil, D.G.,seeS. Arnborg 80 (1990) 1–19Corneil, D.G. and L.K. Stewart, Dominating sets in perfect graphs86 (1990) 145–164Corneil, D.G.,seeJ.I. Brown 98 (1991) 81–93Corneil, D.G.,seeD. Achlioptas 179(1-3) (1998) 1–11Corneil, D.G.,seeT.B. Moorhouse 190(1-3) (1998) 277–286Cornuéjols, G. and W. Pulleyblank, A mathching problem with side conditions29 (1980) 135–159Cornuéjols, G. and W.H. Cunningham, Compositions for perfect graphs55 (1985) 245–254Cornuéjols, G.,seeM. Conforti 199(1-3) (1999) 27–33Corominas, E., On better quasi-ordering countable trees53 (1985) 35–53Corrádi, K. and S. Szabó, Cube tiling and covering a complete graph (Note) 85 (1990) 319–321Corsani, C., D. Merlini and R. Sprugnoli, Left-inversion of combinatorial sums180(1-3) (1998) 107–122Coster, M.J.,seeC. Roos 62 (1986) 139–144Côté, M.,seeD.A. Preece 125(1994) 319–327Cottle, R.W., Minimal triangulation of the 4-cube40 (1982) 25–29Cottle, R.W.,seeM.N. Broadie 52 (1984) 39–49Coulson, D., An 18-colouring of 3-space omitting distance one170(1-3) (1997) 241–247Courcelle, B. and G. Sénizergues, The obstructions of a minor-closed set of graphs defined by a context-free

grammar 182(1-3) (1998) 29–51Cournier, A. and P. Ille, Minimal indecomposable graphs183(1-3) (1998) 61–80Courteau, B.,seeJ. Constantin 33 (1981) 139–147Courteau, B. and J. Wolfmann, On triple-sum-sets and two or three weights codes50 (1984) 179–191


Courteau, B. and J. Goulet, An extension of the codes introduced by Séguin, Allard and Bhargava56 (1985)133–139

Courteau, B. and A. Montpetit, Dual distances of completely regular codes89 (1991) 7–15Courteau, B. and A. Montpetit, A class of codes admitting at most three nonzero dual distances90 (1991)

267–280Cowen, L.J.,seeC.T. Cheng 196(1-3) (1999) 97–108Cowling, P., Strong total chromatic numbers of complete hypergraphs138(1-3) (1995) 207–212Cowling, P., The total graph of a hypergraph167-168(1-3) (1997) 215–236Cox, M.A.A.,seeD.K. Arrowsmith 27 (1979) 215–223Cozzens, M.B. and L.L. Kelleher, Dominating cliques in graphs86 (1990) 101–116Craft, D.L., On the genus of joins and compositions of graphs178(1-3) (1998) 25–50Crama, Y., L. Loebl and S. Poljak, A decomposition of strongly unimodular matrices into incidence matrices of

digraphs 102(1992) 143–147Crampin, D.J. and D.G. Rogers, An arithmetic of complete permutations with constraints, II: Case studies70

(1988) 241–256Crippa, D. and K. Simon,q-distributions and Markov processes170(1-3) (1997) 81–98Crochemore, M.,seeJ. Berstel 76 (1989) 89–94Crook, J.F.,seeI.J. Good 19 (1977) 23–45Cruse, A.B., A note on 1-factors in certain regular multigraphs18 (1977) 213–216Cruse, Allan.B., A note on symmetric doubly-stochastic matrices13 (1975) 109–119Csákány, R. and J. Komlós, The smallest Ramsey numbers199(1-3) (1999) 193–199Csima, J., On the plane term rank of three dimensional matrices28 (1979) 147–152Csima, J., Colouring finite planes of odd order (Note) 49 (1984) 309Csima, J., Generalized Hilton construction for embeddingd-ary quasigroups (Note) 58 (1986) 195–197Csima, J.,seeR.A. Brualdi 62 (1986) 99–101Csizmadia, G., Furthest neighbours in space150(1-3) (1996) 81–88Csizmadia, G., The multiplicity of the two smallest distances among points194(1-3) (1999) 67–86Csmiraz, L., On a combinatorial game with an application to Go-moku29 (1980) 19–23Culík, K., Extensions of rooted trees and their applications18 (1977) 131–148Culik II, K. and J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht’s conjecture43(1983)

139–153Culik II, K., An aperiodic set of 13 Wang tiles160(1-3) (1996) 245–251Cunkle, C.H. and S. Rudeanu, Rings in Boolean algebras7 (1974) 41–51Cunningham, W.H., Chords and disjoint paths in matroids19 (1977) 7–15Cunningham, W.H.,seeG. Cornuéjols 55 (1985) 245–254Curran, D.J. and S.A. Vanstone, Doubly resolvable designs from generalized Bhaskar Rao designs73(1988/89)

49–63Curran, S.J., Hamilton paths in Cayley digraphs of metacyclic groups115(1993) 133–139Curran, S.J. and J.A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey156

(1-3) (1996) 1–18Currie, J.D., Which graphs allow infinite nonrepetitive walks?87 (1991) 249–260Currie, J.D., Connectivity of distance graphs (Note) 103(1992) 91–94Curtin, B., 2-Homogeneous bipartite distance-regular graphs187(1-3) (1998) 39–70Curtin, B., Distance-regular graphs which support a spin model are thin197-198(1-3) (1999) 205–216Cutsem, B.V., Minimal superior ultrametrics under order constraint (Communication) 84 (1990) 201–204Cvetkovic, D. and S. Simic, On graphs whose second largest eigenvalue does not exceed(

√5− 1)/2 138(1-3)

(1995) 213–227Cvetkovic, D.M. and S.K. Simic, Graph equations for line graphs and total graphs13 (1975) 315–320Cvetkovic, S. and M. Petric, A table of connected graphs on six vertices50 (1984) 37–49Czerniakiewicz, A., Minimal graphs with cyclic color group19 (1977) 201–212Czyzowicz, J., A. Pelc and I. Rival, Drawing orders with few slopes82 (1990) 233–250Czyzowicz, J., E. Rivera-Campo, J. Urrutia and J. Zaks, On illuminating line segments in the plane137 (1-3)

(1995) 147–153Dacar, F., The cyclicity of a hypergraph182(1-3) (1998) 53–67D’Agostini, E., On caps with weighted points in PG(t, q) 34 (1981) 103–110


Dahlhaus, E., P.D. Manuel and M. Miller, A characterization of strongly chordal graphs187(1-3) (1998) 269–271

Dahl Vestergaard, P.,seeJ. Topp 191(1-3) (1998) 207–221Dai, Z., X. Feng, M. Liu and Z. Wan, Nonlinear feedforward sequences ofm-sequences I 123(1993) 17–34Dailey, D.P., Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Note) 30

(1980) 289–293Dailey, D.P., On the graphical containment of discrete metric spaces131(1-3) (1994) 51–66Dakic, T. and T. Pisanski, On the genus of the tensor product of graphs where one factor is a regular graph134

(1-3) (1994) 25–39Dale, K. and I. Skau, The (Generalized) Secretary’s Packet Problem and the Bell numbers137 (1-3) (1995)

357–360Damaschke, P., Irredundance number versus domination number (Note) 89 (1991) 101–104Damaschke, P., Paths in interval graphs and circular arc graphs112(1993) 49–64Damaschke, P.,seeD. Kratsch 128(1-3) (1994) 269–275Damerell, R.M., C. Roos and A.J. van Zanten, On the existence of certain generalized moore geometries, V76

(1989) 183–189Damianou, Ch.,seeS. Kounias 22 (1978) 85–89Danhof, K.,seeA. Baartmans 30 (1980) 69–81Danhof, K.J.,seeA. Baartmans 10 (1974) 1–8D’Antona, O. and J.P.S. Kung, Coherent orientations and series-parallel networks (Communication) 32 (1980)

95–98Danzer, L., Finite point-sets onS2 with minimum distance as large as possible60 (1986) 3–66Danzer, L., Three-dimensional analogs of the planar penrose tilings and quasicrystals (Invited paper) 76 (1989)

1–7Darcel, N. and Y. Zimmermann, Partition en cycles du graphe de comparabilite d’un arbre38 (1982) 53–64Darrah, M., Y.-P. Liu and C.-Q. Zhang, Cycles of all lengths in arc-3-cyclic semicomplete digraphs173 (1-3)

(1997) 23–33Das, P., Characterization of unigraphic and unidigraphic integer-pair sequences37 (1981) 51–66Das, P. and S.B. Rao, Alternating eulerian triails with prescribed degrees in two edge-colored complete graphs

43 (1983) 9–20Das, P., Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences45

(1983) 45–59Das, P., Integer-pair sequences with self-complementary realizations45 (1983) 189–198Das, P.K. and A. Rosa, Halving Steiner triple systems109(1992) 59–67Das, S. and M. Sen, An interval digraph in relation to its associated bipartite graph122(1993) 113–136DasGupta, B.,seeG.J. Chang 199(1-3) (1999) 11–25Da Silva, I.P.F., On fillings of 2N -gons with rhombi 111(1993) 137–144Da Silva, I.P.F., Note on inseparability graphs of matroids having exactly one class of orientations171 (1-3)

(1997) 77–87Da Silva, J.A.D.,seeR.A. Brualdi 169(1-3) (1997) 199–203Datta, B.,seeB. Bagchi 188(1-3) (1998) 41–60Datta, B.T., On tangential 2-blocks15 (1976) 1–22Datta, B.T., Nonexistence of seven-dimensional tangential 2-blocks36 (1981) 1–32Dauenhauer, M.H. and H.J. Zassenhaus, Local optimality of the critical lattice sphere-packing of regular

tetrahedra 64 (1987) 129–146Daven, M. and C.A. Rodger, (k,g)-cages are 3-connected199(1-3) (1999) 207–215Davey, B.A. and H.A. Priestley, Partition-induced natural dualities for varieties of pseudo-complemented

distributive lattices 113(1993) 41–58Davies, H., Flag-transitivity and primitivity (Communication) 63 (1987) 91–93Davis, J.A., Construction of relative difference sets inp-groups 103(1992) 7–15Davis, J.A., New constructions of divisible designs (Note) 120(1993) 261–268Davis, J.A., New semiregular divisible difference sets188(1-3) (1998) 99–109Davis, R. and C. Wagner, Covering algebras andq-binomial generating functions128(1-3) (1994) 95–111Day, D.P., O.R. Oellermann and H.C. Swart, On thel-connectivity of a digraph 127(1-3) (1994) 95–104


Day, D.P., O.R. Oellermann and H.C. Swart, Bounds on the size of graphs of given order and`-connectivity197-198(1-3) (1999) 217–223

Dayhoff, J.E., Independently prescribable sets ofn-letter words 50 (1984) 193–219Daykin, D.E., J.W. Daykin and M.S. Paterson, On log concavity for order-preserving maps of partial orders50

(1984) 221–226Daykin, J.W.,seeD.E. Daykin 50 (1984) 221–226Daykin, J.W., Inequalities for the number of monotonic functions of partial orders61 (1986) 41–55Dean, N., L. Lesniak and A. Saito, Cycles of length 0 modulo 4 in graphs121(1993) 37–49Dean, N. and J. Zito, Well-covered graphs and extendability126(1994) 67–80Dean, R., A construction for large families ofk-element sets having the Erdös intersection property53 (1985)

55–56Debroey, I. and F. De Clerck, Non-trivial01-regular graphs 41 (1982) 7–15Debroey, I.,seeJ.A. Thas 51 (1984) 283–292De Bruijn, N.G., Sorting by means of swappings9 (1974) 333–339De Bruijn, N.G., Penrose patterns are almost entirely determined by two points106/107(1992) 97–104De Caen, D., D.L. Kreher, S.P. Radziszowski and W.H. Mills, On the covering oft-sets with (t + 1)-sets:C(9,5,4) andC(10,6,5) 91 (1991) 65–77

De Caen, D., A lower bound on the probability of a union169(1-3) (1997) 217–220De Caen, D., An upper bound on the sum of squares of degrees in a graph185(1-3) (1998) 245–248Deckhart, R.W., The local Kostant–PBW ordering90 (1991) 1–20De Clerck, F.,seeI. Debroey 41 (1982) 7–15De Clerck, F.,seeJ.A. Thas 51 (1984) 283–292De Clerck, F. and N.L. Johnson, Subplane covered nets and semipartial geometries106/107(1992) 127–134Décoste, H., G. Labelle and P. Leroux, The functorial composition of species, a forgotten operation99 (1992)

31–48Décoste, H. and G. Labelle, Leq-dénombrement générique d’une espèce: Existence et méthode de calcul153

(1-3) (1996) 59–67Dedò, E. and L. Porcu, Some properties of a multidigraph by semi-incidence matrices55 (1985) 1–11Deeter, C.R. and J.M. Gray, The discrete Green’s function and the discrete kernel function10 (1974) 29–42De Felice, C., A partial result about the factorization conjecture for finite variable-length codes122 (1993)

137–152De Felice, C.,seeV. Bruyère 140(1-3) (1995) 47–77De Figueiredo, C.M.H.,seeH. Everett 165-166(1-3) (1997) 223–242De Fraysseix, H., Local complementation and interlacement graphs33 (1981) 29–35De Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs (Note) 110(1992) 279–282Dehnhardt, K. and H. Harborth, Universal tilings of the plane by 0–1-matrices73 (1988/89) 65–70Dehon, M., Non-existence d’un 3-design de parametresλ= 2, k = 5 etv = 11 15 (1976) 23–25Dehon, M., On the existence of 2-designsSλ(2,3, v) without repeated blocks43 (1983) 155–171Dehon, M., An existence theorem for some simplet-designs 90 (1991) 137–142Deiters, K. and M. Erné, Negations and contrapositions of complete lattices181(1-3) (1998) 91–111Dejter, I.J., J. Cordova and J.A. Quintana, Two Hamilton cycles in bipartite reflective Kneser graphs72 (1988)

63–70Dejter, I.J., W. Cedeño and V. Jauregui, A note on Frucht diagrams, Boolean graphs and Hamilton cycles114

(1993) 131–135Dejter, I.J., On symmetric subgraphs of the 7-cube: an overview124(1994) 55–66Dejter, I.J., H. Hevia and O. Serra, Hidden Cayley graph structures182(1-3) (1998) 69–83Deken, J.G., Some limit results for longest common subsequences26 (1979) 17–31Dekking, F.M., Iteration of maps by an automaton126(1994) 81–86Delandtsheer, A., Finite planar spaces with isomorphic planes42 (1982) 161–176Delandtsheer, A., The rigidity of the smallest unknownπ -space 47 (1983) 203–210Delandtsheer, A., Metrical regularity in the incidence graph of a finite linear space52 (1984) 133–141Delandtsheer, A., Transitivity on sets of independent points in geometric lattices (Communication) 61 (1986)

103–105Delandtsheer, A., Orbits in uniform hypergraphs (Communication) 61 (1986) 317–319Delandtsheer, A., Finite planar spaces with isomorphic planes (Erratum) 65 (1987) 107


Delandtsheer, A., Line-primitive groups of small rank (Communication) 68 (1988) 103–106Delandtsheer, A., Classifications of finite highly transitive dimensional linear spaces129(1-3) (1994) 75–111De la Torre, P. and D.T. Kao, An algebraic approach to the prefix model analysis of binary trie structures and set

intersection algorithms 180(1-3) (1998) 123–142De Launey, W., Generalised Hadamard matrices which are developed modulo a group104(1992) 49–65Deléglise, M., P. Erdos and J.-L. Nicolas, Sur les ensembles représentés par les partitions d’un entiern 200

(1-3) (1999) 27–48Delest, M.P. and J.M. Fedou, Enumeration of skew Ferrers diagrams112(1993) 65–79Del Fra, A. and D. Ghinelli, Classification of extended generalized quadrangles with maximum diameter105

(1992) 13–23Del Fra, A. and G. Pica, Flag-transitiveC2.Ln geometries 174(1-3) (1997) 99–105Del Fra, A., On two new classes of semibiplanes174(1-3) (1997) 107–116Del Greco, J.G., Characterizing bias matroids103(1992) 153–159Dell’Olmo, P., M.G. Speranza and Zs. Tuza, Efficiency and effectiveness of normal schedules on three dedicated

processors 164(1-3) (1997) 67–79Del Lungo, A., M. Nivat and R. Pinzani, The number of convex polyominoes reconstructible from their orthogonal

projections 157(1-3) (1996) 65–78Del Lungo, A.,seeE. Barcucci 170(1-3) (1997) 211–217Del Lungo, A.,seeE. Barcucci 180(1-3) (1998) 45–64Del Lungo, A.,seeE. Barcucci 189(1-3) (1998) 21–42Del Lungo, A.,seeE. Barcucci 190(1-3) (1998) 235–240Delorme, C. and G. Hahn, Infinite generalized friendship graphs49 (1984) 261–266Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of

graphs 111(1993) 145–156Delorme, C.,seeJ. Bond 114(1993) 63–74Delorme, C., Eigenvalues of finite graphs114(1993) 137–146Delorme, C. and J.P. Tillich, Eigenvalues, eigenspaces and distances to subsets165-166(1-3) (1997) 161–184Del Ristoro, F.,seeE. Barcucci 190(1-3) (1998) 235–240Delsarte, P. and J.M. Goethals, Unrestricted codes with the Golay parameters are unique12 (1975) 211–224Delsarte, P., A generalization of the Legendre symbol for finite Abelian groups27 (1979) 187–192Delsarte, Ph., Weights of linear codes and strongly regular normed spaces3 (1972) 47–64Delsarte, Ph. and Ph. Piret, An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary

codes (Note) 55 (1985) 313–315De Luca, A., D. Perrin, A. Restivo and S. Termini, Synchronization and simplification27 (1979) 297–308De Luca, A., On some combinatorial problems in free monoids38 (1982) 207–225De Luca, A., On the product of square-free words52 (1984) 143–157Demel, J., Maximal frequencies of equivalences with small classes (Note) 23 (1978) 67–71De Mello, C.P.,seeC.L. Lucchesi 183(1-3) (1998) 247–254Demetrovics, J., On the main diagonal of Sheffer functions21 (1978) 1–5Demetrovics, J.,seeA. Békéssy 27 (1979) 1–10Demetrovics, J.,seeA. Békéssy 30 (1980) 83–88Deming, R.W., Independence numbers of graphs – An extension of the Koenig–Egervary theorem27 (1979)

23–33Dénes, J., On some connections between permutations and coding56 (1985) 141–146Dénes, J. and A.D. Keedwell, A new authentication scheme based on latin squares106/107(1992) 157–161Dénes, J. and G.L. Mullen, Enumeration formulas for latin and frequency squares111(1993) 157–163Deng, C.-L. and C.-K. Lim, A result on generalized latin rectangles72 (1988) 71–80Deng, C.-L. and C.-K. Lim, A class of clique-closed graphs127(1-3) (1994) 131–137Deng, C.-L. and C.-K. Lim, A Characterization of graphsG with G∼=K2(G) 151(1-3) (1996) 71–79Deng, X.-t.,seeY.-j. Zhu 87 (1991) 197–214Denise, A. and R. Simion, Two combinatorial statistics on Dyck paths137(1-3) (1995) 155–176Denise, A., Génération aléatoire et uniforme de mots153(1-3) (1996) 69–84Denley, T., The Ramsey numbers for disjoint unions of cycles149(1-3) (1996) 31–44Denniston, R.H.F., Some packings with Steiner triple systems9 (1974) 213–227Denniston, R.H.F., Sylvester’s problem of the 15 schoolgirls9 (1974) 229–233


Deogun, J.S., D. Kratsch and G. Steiner, 1-tough cocomparability graphs are hamiltonian170 (1-3) (1997)99–106

De Oliveira, A.G., On the Steinitz exchange lemma137(1-3) (1995) 367–370De Oliveira, A.G.,seeR. Cordovil 160(1-3) (1996) 105–113Depew, A.J.,seeC.A. Barefoot 125(1994) 15–30De Resmini, M.J., On complete arcs in Steiner systemsS(2,3, v) andS(2,4, v) 77 (1989) 65–73De Resmini, M.J.,seeC.J. Colbourn 89 (1991) 149–160De Resmini, M.J., Some naive constructions ofS(2,3, v) andS(2,4, v) 97 (1991) 149–153De Resmini, M.J.,seeK.T. Phelps 104(1992) 273–280Dershowitz, N. and S. Zaks, Enumerations of ordered trees31 (1980) 9–28Dershowitz, N. and S. Zaks, Ordered trees and non-crossing partitions (Note) 62 (1986) 215–218Désarménien, J., An algorithm for the Rota straightening formula30 (1980) 51–68Désarménien, J. and D. Foata, Statistiques d’ordre sur les permutations colorées87 (1991) 133–148Désarménien, J. and D. Foata, The signed Eulerian numbers99 (1992) 49–58Deschamps, J., Fermeturesi-generatrices — Application aux fonctions booleennes permutantes13(1975) 321–

339Deschamps, J.P., Parametric solutions of Boolean equations3 (1972) 333–342Deshouillers, J.-M., P. Erdos and G. Melfi, On a question about sum-free sequences200(1-3) (1999) 49–54De Simone, C., The cut polytope and the Boolean quadric polytope79 (1989/90) 71–75De Simone, C., M. Deza and M. Laurent, Collapsing and lifting for the cut cone127(1-3) (1994) 105–130De Simone, C. and A. Galluccio, New classes of Berge perfect graphs131(1-3) (1994) 67–79Desrosiers, J.,seeO. du Merle 194(1-3) (1999) 229–237Detemple, D. and J. Robertson, Permutations associated with billiard paths47 (1983) 211–219DeTemple, D.,seeK. McAvaney 113(1993) 131–142DeTemple, D.W., M.J. Dineen, J.M. Robertson and K.L. McAvaney, Recent examples in the theory of partition

graphs (Note) 113(1993) 255–258Deuber, W., Partition theorems for unary algebras27 (1979) 35–45Deuber, W.A. and X. Zhu, The chromatic numbers of distance graphs165-166(1-3) (1997) 191–200Deutsch, E., A bijection on Dyck paths and its consequences179(1-3) (1998) 253–256Deutsch, E., A bijection on Dyck paths and its consequences (Note) [Discrete Math. 179 (1998) 253–256]187

(1-3) (1998) 297Devitt, J.S.,seeE.A. Bender 50 (1984) 1–8Devlin, K.J., A note on a problem of Erdös and Hajnal11 (1975) 9–22De Vries, H.L., Historical notes on Steiner systems (Note) 52 (1984) 293–297De Vries, H.L.,seeI. Diener 55 (1985) 13–19De Vroedt, C.,seeC. Roos 40 (1982) 261–276De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance97 (1991)

155–160De Vroedt, C., Über einen Satz von Köhler97 (1991) 161–165Dewdney, A.K., Wagner’s theorem for torus graphs4 (1973) 139–149Dewdney, A.K. and F. Harary, Oriented two-dimensional circuits33 (1981) 149–162De Werra, D., Investigations on an edge coloring problem1 (1971) 167–179De Werra, D., An extension of bipartite multigraphs14 (1976) 133–138De Werra, D., Regular and canonical colorings27 (1979) 309–316De Werra, D., Variation on a theorem of König (Note) 51 (1984) 319–321De Werra, D.,seeC. Benzaken 55 (1985) 123–127De Werra, D.,seeM. Preissmann 61 (1986) 259–267De Werra, D.,seeA. Hertz 68 (1988) 111–113De Werra, D.,seeA. Hertz 74 (1989) 51–59De Werra, D.,seeA.J.W. Hilton 128(1-3) (1994) 179–201De Werra, D., Restricted coloring models for timetabling165-166(1-3) (1997) 611–620De Werra, D. and A. Hertz, On perfectness of sums of graphs195(1-3) (1999) 93–101Deza, A., M. Deza and V. Grishukhin, Fullerenes and coordination polyhedra versus half-cube embeddings192

(1-3) (1998) 41–80


Deza, M., Une propriete extremale des plans projectifs finis dans une classe de codes equidistants6 (1973)343–352

Deza, M. and P. Erdös, Extension de quelques theoremes sur les densites de series d’elements de N a des seriesde sous-ensembles finis de N12 (1975) 295–308

Deza, M.,seeN. Hamada 71 (1988) 219–231Deza, M.,seeM. Laurent 75 (1989) 279–313Deza, M.,seeN. Hamada 77 (1989) 75–87Deza, M.,seeN. Hamada 93 (1991) 19–33Deza, M. and M. Laurent, Extension operations for cuts106/107(1992) 163–179Deza, M., K. Fukuda and M. Laurent, The inequicut cone119(1993) 21–48Deza, M. and M. Laurent, The even and odd cut polytopes119(1993) 49–66Deza, M.,seeC. De Simone 127(1-3) (1994) 105–130Deza, M. and V. Grishukhin, The skeleton of the 120-cell is not penta-gonal165-166(1-3) (1997) 185–190Deza, M.,seeA. Deza 192(1-3) (1998) 41–80Dhurandhar, M., Improvement on Brooks’ chromatic bound for a class of graphs42 (1982) 51–56Diaconis, P. and R. Graham, Binomial coefficient codes over GF(2)106/107(1992) 181–188Diaconis, P.,seeF. Chung 110(1992) 43–59Diánez, A.,seeL. Boza 161(1-3) (1996) 45–52Dias da Silva, J.A. and A. Fonseca, Ther-depth of a matroid 141(1-3) (1995) 85–93Diatta, J., Approximating dissimilarities by quasi-ultrametrics192(1-3) (1998) 81–86Diatta, J. and B. Fichet, Quasi-ultrametrics and their 2-ball hypergraphs192(1-3) (1998) 87–102Di Bucchianico, A.,seeA. Bottreau 180(1-3) (1998) 65–72Dieker, P.,seeA. Bialostocki 94 (1991) 221–228Diener, I., On S-cyclic Steiner systems39 (1982) 283–292Diener, I., E. Schmitt and H.L. de Vries, All 80 Steiner triple systems on 15 elements are derived55 (1985)

13–19Dierker, P.,seeA. Bialostocki 91 (1991) 231–238Dierker, P.,seeA. Bialostocki 110(1992) 1–8Diestel, R., On the problem of finding small subdivision and homomorphism bases for classes of countable graphs

55 (1985) 21–33Diestel, R., Tree-decompositions, tree-representability and chordal graphs (Note) 71 (1988) 181–184Diestel, R., Simplicial decompositions of graphs: A survey of applications75 (1989) 121–144Diestel, R., Decomposing infinite graphs95 (1991) 69–89Diestel, R., The end structure of a graph: recent results and open problems100(1992) 313–327Dieter, E.,seeT.H. Brylawski 69 (1988) 123–151Dietrich, B.L.,seeR.G. Bland 70 (1988) 203–208Dietrich, B.L., Matroids and antimatroids—A survey78 (1989) 223–237Dikranjan, D. and A. Policriti, Complementation in the lattice of equivalence relations159(1-3) (1996) 83–94Dilcher, K., Someq-series identities related to divisor functions145(1-3) (1995) 83–93Dillencourt, M.B., An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Note) 90

(1991) 93–97Dillencourt, M.B. and W.D. Smith, Graph-theoretical conditions for inscribability and Delaunay realizability

161(1-3) (1996) 63–77Dineen, M.J.,seeD.W. DeTemple 113(1993) 255–258Ding, G., Disjoint circuits on a Klein bottle and a theorem on posets112(1993) 81–91Ding, G., Clutters withτ2= 2τ 115(1993) 141–152Ding, G., Stable sets versus independent sets117(1993) 73–87Ding, G., Monotone clutters 119(1993) 67–77Ding, G. and B. Oporowski, On tree-partitions of graphs149(1-3) (1996) 45–58Ding, G. and P.L. Hammer, Matroids arisen from matrogenic graphs165-166(1-3) (1997) 201–207Ding, K., Invisible permutations and rook placements on a Ferrers board139(1-3) (1995) 105–127Ding, K. and P. Terwilliger, On Garsia–Remmel problem of rook equivalence149(1-3) (1996) 59–68Ding, K., Rook placements and cellular decomposition of partition varieties170(1-3) (1997) 107–151Ding, K., Rook placements and generalized partition varieties176(1-3) (1997) 63–95Ding, R., K. Kołodziejczyk and J. Reay, A new pick-type theorem on the hexagonal lattice68 (1988) 171–177


Ding, R.,seeG. Murphy 69 (1988) 295–300Dinh, H.V., On the length of longest dominating cycles in graphs121(1993) 211–222Dinh, H.V., Path partition number in tough graphs164(1-3) (1997) 291–294Dinitz, J.,seeD. Archdeacon 113(1993) 1–6Dinitz, J.H. and D.R. Stinson, MOLS with holes44 (1983) 145–154Dinitz, J.H., D.R. Stinson and W.D. Wallis, Room squares with holes of sides 3, 5, and 747 (1983) 221–228Dinitz, J.H.,seeD. Archdeacon 92 (1991) 9–19Dinneen, M.J.,seeT.L. Brewster 147(1-3) (1995) 35–55Dinolt, G.W.,seeR.A. Brualdi 12 (1975) 113–138Dinski, T. and X. Zhu, A bound for the game chromatic number of graphs196(1-3) (1999) 109–115Dion, J.P., The Sperner property for posets: A probabilistic approach53 (1985) 57–62Dirac, G.A., Terminable and interminable paths and trails in infinite graphs9 (1974) 19–34Dirac, G.A., Note on infinite graphs11 (1975) 107–118Ditor, S.Z., Cardinality questions concerning semilattices of finite breadth48 (1984) 47–59Dixon, J.D., Monotonic subsequences in random sequences12 (1975) 139–142Dixon, J.D., Random sets which invariably generate the symmetric group105(1992) 25–39Dixon, R.,seeA. Bruen 12 (1975) 393–395Dobbs, D.E., Posets admitting a unique order-compatible topology41 (1982) 235–240Dobson, E., Isomorphism problem for Cayley graphs ofZ3

p 147(1-3) (1995) 87–94Dobson, E.,seeS. Brandt 150(1-3) (1996) 411–414Dobson, E., H. Gavlas, J. Morris and D. Witte, Automorphism groups with cyclic commutator subgroup and

Hamilton cycles 189(1-3) (1998) 69–78Doehlert, D.H. and V.L. Klee, Experimental designs through level reduction of thed-dimensional cuboctahedron

2 (1972) 309–334Doignon, J.-P., On characterizations of binary and graphic matroids (Communication) 37 (1981) 299–301Doignon, J.-P. and J.-C. Falmagne, Well-graded families of relations173(1-3) (1997) 35–44Ðokovic, D.Ž., Williamson matrices of order 4n for n= 33,35,39 (Note) 115(1993) 267–271Ðokovic, D.Ž., Equivalence classes and representatives of Golay sequences189(1-3) (1998) 79–93Dolan, P. and M. Halsey, Random edge domination (Note) 112(1993) 259–260Dolinar, S., T.-M. Ko and R. McEliece, Some VLSI decompositions of the de Bruijn graph106/107(1992)

189–198Domb, C. and A.J. Barrett, Enumeration of ladder graphs9 (1974) 341–358Domke, G.S., J.E. Dunbar and L.R. Markus, Gallai-type theorems and domination parameters167-168(1-3)

(1997) 237–248Domke, G.S. and R.C. Laskar, The bondage and reinforcement numbers ofγf for some graphs 167-168(1-3)

(1997) 249–259Domocos, V. and W.R. Schmitt, An application of linear species132(1-3) (1994) 377–381Domocos, V. andS.N. Buze¸teanu, The generating function of irreducible coverings by edges of completek-partite

graphs 147(1-3) (1995) 287–292Domocos, V.,seeS.N. Buze¸teanu 150(1-3) (1996) 421–425Domocos, V., A combinatorial method for the enumeration of column-convex polyominoes152 (1-3) (1996)

115–123Domocos, V., Minimal coverings of uniform hypergraphs and P-recursiveness159(1-3) (1996) 265–271Donati, A., Lins-Mandel manifolds as branched covering ofS3 62 (1986) 21–27Dong, F. and Y. Liu, Counting rooted near-triangulations on the sphere123(1993) 35–45Dong, F.-M. and Y. Liu, On the chromatic uniqueness of the graphW(n,n− 2)+Kk 145(1-3) (1995) 95–103Dong, F.M. and K.M. Koh, On graphs in which any pair of colour classes but one induces a tree169 (1-3)

(1997) 39–54Dong, F.M. and K.M. Koh, On the structure and chromaticity of graphs in which any two colour classes induce a

tree 176(1-3) (1997) 97–113Dong, F.M. and Y.P. Liu, All wheels with two missing consecutive spokes are chromatically unique184 (1-3)

(1998) 71–85Dong, L.,seeB.-L. Chen 194(1-3) (1999) 59–65Donovan, D. and S. Oates–Williams, Single laws for sloops and squags92 (1991) 79–83Dörfler, W., Every regular graph is a quasigroup graph (Note) 10 (1974) 181–183


Dorrough, D., Convergence of sequences of iterated triangular line graphs161(1-3) (1996) 79–86Dougherty, S.T., T.A. Gulliver and M. Harada, Optimal ternary formally self-dual codes196(1-3) (1999) 117–

135Douglas, R.J., Bounds on the number of Hamiltonian circuits in then-cube 17 (1977) 143–146Douglas, R.J., NP-completeness and degree restricted spanning trees105(1992) 41–47Dow, S., An improved bound for extending partial projective planes45 (1983) 199–207Dowling, T.A. and D.G. Kelly, Elementary strong maps and transversal geometries7 (1974) 209–224Downs, M.L.N. and G.A. Jones, Enumerating regular objects with a given automorphism group (Communication)

64 (1987) 299–302Doyen, J., A note on reverse Steiner triple systems1 (1972) 315–319Doyen, J. and R.M. Wilson, Embeddings of Steiner triple systems5 (1973) 229–239Doyen, J. and V. Van Diest, New families of hypohamiltonian graphs13 (1975) 225–236Doyle, J.K. and J.E. Graver, Mean distance in a graph17 (1977) 147–154Dragan, F.F.,seeA. Brandstädt 158(1-3) (1996) 273–278Dragan, F.F. and A. Brandstädt,r-Dominating cliques in graphs with hypertree structure162(1-3) (1996) 93–

108Dragan, F.F.,seeA. Brandstädt 171(1-3) (1997) 27–42Drake, D.A. and M.P. Hale Jr., Half counts in Latin quarters8 (1974) 257–268Drake, D.A., Embedding maximal cliques of sets in maximal cliques of bigger sets58 (1986) 229–242Drake, D.A., G.H.J. van Rees and W.D. Wallis, Maximal sets of mutually orthogonal Latin squares194 (1-3)

(1999) 87–94Drápal, A., On quasigroup rich in associative triples44 (1983) 251–265Dress, A.W.M. and R. Scharlau, The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the

Euclidean plane 60 (1986) 121–138Dress, A.W.M.,seeH.-J. Bandelt 136(1-3) (1994) 21–37Drgas-Burchardt, E.,seeM. Borowiecki 111(1993) 71–75Drgas-Burchardt, E.,seeM. Borowiecki 121(1993) 11–18Dridi, T., Distributions binaires unimodales (Communication) 126(1994) 373–378Droms, C., B. Servatius and H. Servatius, Groups assembled from free and direct products109(1992) 69–75Dror, M., G. Finke, S. Gravier and W. Kubiak, On the complexity of a restricted list-coloring problem195(1-3)

(1999) 103–109Droste, M., Products of conjugacy classes of the infinite symmetric groups47 (1983) 35–48Du, B.,seeF.E. Bennett 84 (1990) 221–239Du, B.,seeL. Zhu 97 (1991) 409–417Du, B., On the existence of incomplete transversal designs with block size five135(1-3) (1994) 81–92Du, B., The existence of orthogonal diagonal Latin squares with subsquares148(1-3) (1996) 37–48Du, B.,K1,p2-factorization of complete bipartite graphs187(1-3) (1998) 273–279Du, D.Z.,seeF.K. Hwang 45 (1983) 107–112Du, D.-Z. and D.F. Hsu, Partitionable starters for twin prime power type87 (1991) 23–28Du, D.-Z.,seeB. Gao 142(1-3) (1995) 49–63Du, D.Z., D.F. Hsu and Y.D. Lyuu, On the diameter vulnerability of Kautz digraphs151(1-3) (1996) 81–85Du, D.-Z.,seeP.-J. Wan 163(1-3) (1997) 173–200Du, D.-Z.,seeP.-J. Wan 171(1-3) (1997) 261–275Du, D.-Z.,seeF. Cao 183(1-3) (1998) 27–38Du, Q., Onσ -polynomials and a class of chromatically unique graphs115(1993) 153–165Du, Q., Chromaticity of the complements of paths and cycles162(1-3) (1996) 109–125Dubernard, J.P. and I. Dutour, Enumération de polyominos convexes dirigés157(1-3) (1996) 79–90Dubois, J., Polytopes de transport symetriques4 (1973) 1–27Dubois, J., Transformations affines agissant sur un simplexe5 (1973) 61–78Duchamp, G. and J.Y. Thibon, Le support de l’algebre de Lie libre76 (1989) 123–129Duchet, P., Sur les hypergraphes invariants8 (1974) 269–280Duchet, P. and H. Meyniel, A note on kernel-critical graphs (Communication) 33 (1981) 103–105Duchet, P. and H. Meyniel, Une generalisation du theoreme de Richardson sur l’existence de noyaux dans les

graphes orientes 43 (1983) 21–27


Duchet, P., Y. Hamidoune, M. Las Vergnas and H. Meyniel, Representing a planar graph by vertical lines joiningdifferent levels (Note) 46 (1983) 319–321

Duchet, P.,seeA.E. Brouwer 47 (1983) 177–182Duchet, P.,seeR. Cordovil 62 (1986) 103–104Duchet, P., M. Las Vergnas and H. Meyniel, Connected cutsets of a graph and triangle bases of the cycle space

62 (1986) 145–154Duchet, P. and V. Kaneti, Sur la contraction des graphes orientes enK∗3 (Note) 65 (1987) 95–98Duchet, P., Y.O. Hamidoune and H. Meyniel, Sur les quasi-noyaux d’un graphe65 (1987) 231–235Duchet, P., On locally-perfect colorings74 (1989) 29–32Duchet, P.,seeR. Cordovil 79 (1989/90) 251–257Duchet, P.,seeC. Berge 86 (1990) 27–31Duchet, P. and S. Olariu, Graphes parfaitement ordonnables généralises (Note) 90 (1991) 99–101Duchet, P. and H. Meyniel, Kernels in directed graphs: a poison game (Note) 115(1993) 273–276Duchet, P. and V. Kaneti, Sur la contractibilité d’un graphe orienté enK∗4 130(1-3) (1994) 57–68Dudás, T.,seeR.E. Burkard 161(1-3) (1996) 53–61Dudek, W.A.,seeZ. Stojakovic 183(1-3) (1998) 277–284Dudley, R.M.,seeR.S. Wenocur 33 (1981) 313–318Duffus, D. and I. Rival, Path length in the covering graph of a lattice19 (1977) 139–158Duffus, D., I. Rival and M. Simonovits, Spanning retracts of a partially ordered set32 (1980) 1–7Duffus, D., M. Pouzet and I. Rival, Complete ordered sets with no infinite antichains35 (1981) 39–52Duffus, D. and I. Rival, A structure theory for ordered sets35 (1981) 53–118Duffus, D.,seeM. Aigner 88 (1991) 113–119Duffus, D., H. Lefmann and V. Rödl, Shift graphs and lower bounds on Ramsey numbersrk(l; r) 137 (1-3)

(1995) 177–187Duffus, D. and N. Sauer, Lattices arising in categorial investigations of Hedetniemi’s conjecture152 (1-3)

(1996) 125–139Dugat, V.,seeA. Astié-Vidal 102(1992) 111–120Dugat, V.,seeA. Astié-Vidal 111(1993) 27–36Dugdale, J.K. and A.J.W. Hilton, The total chromatic number of regular graphs whose complement is bipartite

126(1994) 87–98Dujella, A., A bijective proof of Riordan’s theorem on powers of Fibonacci numbers199(1-3) (1999) 217–220Duke, R.A., On the genus and connectivity of Hamiltonian graphs2 (1972) 199–206Duke, R.A., P. Erdos and V. Rödl, Cycle-connected graphs108(1992) 261–278Dulucq, S. and J.-G. Penaud, Cordes, arbres et permutations117(1993) 89–105Dulucq, S. and B.E. Sagan, La correspondance de Robinson–Schensted pour les tableaux oscillants gauches139

(1-3) (1995) 129–142Dulucq, S., S. Gire and J. West, Permutations with forbidden subsequences and nonseparable planar maps153

(1-3) (1996) 85–103Dulucq, S. and O. Guibert, Stack words, standard tableaux and Baxter permutations157(1-3) (1996) 91–106Dulucq, S. and O. Guibert, Baxter permutations180(1-3) (1998) 143–156Dulucq, S., S. Gire and O. Guibert, A combinatorial proof of J. West’s conjecture187(1-3) (1998) 71–96Dumas, P. and L. Thimonier, Random palindromes: multivariate generating function and Bernoulli density139

(1-3) (1995) 143–154Du Merle, O., D. Villeneuve, J. Desrosiers and P. Hansen, Stabilized column generation194(1-3) (1999) 229–

237Dumont, D., Sur une conjecture de Gandhi concernant les nombres de Genocchi1 (1972) 321–327Dumont, D. and A. Randrianarivony, Dérangements et nombres de Genocchi132(1-3) (1994) 37–49Dumont, D., Conjectures sur des symétries ternaires liées aux nombres de Genocchi (Note) 139 (1-3) (1995)

469–472Dunbar, J. and R. Laskar, Finite nets of dimensiond 22 (1978) 1–24Dunbar, J., S. Hedetniemi, M.A. Henning and A.A. McRae, Minus domination in regular graphs149 (1-3)

(1996) 311–312Dunbar, J., S. Hedetniemi, M.A. Henning and A. McRae, Minus domination in graphs199(1-3) (1999) 35–47Dunbar, J.E., F.C. Harris Jr., S.M. Hedetniemi, S.T. Hedetniemi, A.A. McRae and R.C. Laskar, Nearly perfect

sets in graphs 138(1-3) (1995) 229–246


Dunbar, J.E.,seeG.S. Domke 167-168(1-3) (1997) 237–248Dunbar, J.E., J.W. Grossman, J.H. Hattingh, S.T. Hedetniemi and A.A. McRae, On weakly connected domination

in graphs 167-168(1-3) (1997) 261–269Dunham, D., D.S. Jungreis and D. Witte, Infinite Hamiltonian paths in Cayley digraphs of hyperbolic symmetry

groups 143(1-3) (1995) 1–30Dunning, L.A.,seeW.E. Clark 80 (1990) 249–265Düntsch, I. and S. Koppelberg, Complements and quasicomplements in the lattice of subalgebras ofP (ω) 53

(1985) 63–78Duquenne, V., The core of finite lattices88 (1991) 133–147Dür, A., The decoding of extended Reed–Solomon codes90 (1991) 21–40Dür, A., On the covering radius of Reed–Solomon codes126(1994) 99–105Durand, F., A characterization of substitutive sequences using return words179(1-3) (1998) 89–101Durnberger, E., Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian

groups are hamiltonian 46 (1983) 55–68Dutour, I.,seeJ.P. Dubernard 157(1-3) (1996) 79–90Dutton, R.D.,seeR.C. Brigham 34 (1981) 1–7Dutton, R.D.,seeR.C. Brigham 44 (1983) 139–144Dutton, R.D.,seeR.C. Brigham 52 (1984) 31–37Dutton, R.D.,seeA.P. Shelton 59 (1986) 199–201Dutton, R.D. and R.C. Brigham, On the size of graphs of a given bandwidth76 (1989) 191–195Dutton, R.D.,seeR.C. Brigham 86 (1990) 127–136Dutton, R.D. and R.C. Brigham, On the radius and diameter of the clique graph147(1-3) (1995) 293–295Duval, J.P., Relationship between the period of a finite word and the length of its unbordered segments40

(1982) 31–44Duvdevani, N. and A.S. Fraenkel, Properties ofK-Welter’s game 76 (1989) 197–221Dvorák, T., I. Havel and P. Liebl, Euler cycles in the complete graphK2m+1 171(1-3) (1997) 89–102Dymacek, W.M., Complements of Steinhaus graphs37 (1981) 167–180Dymacek, W.M., Bipartite Steinhaus graphs59 (1986) 9–20Dymàcek, W.M. and T. Whaley, Generating strings for bipartite Steinhaus graphs141(1-3) (1995) 95–107Dymàcek, W.M.,seeG.J. Chang 199(1-3) (1999) 11–25Dziobiak, W.,seeM.E. Adams 135(1-3) (1994) 15–28Eaton, N., Ramsey numbers for sparse graphs185(1-3) (1998) 63–75Ebert, G., J. Hemmeter, F. Lazebnik and A. Woldar, On the number of irregular assignments on a graph93

(1991) 131–142Ebert, G.L., Inverse planes with a given collection of common blocks131(1-3) (1994) 81–90Eckhoff, J., The maximum number of triangles in aK4-free graph 194(1-3) (1999) 95–106Edelberg, M.,seeD. Kleitman 1 (1971) 47–53Edelberg, M., M.R. Garey and R.L. Graham, On the distance matrix of a tree14 (1976) 23–39Edelman, P.H., On a fixed point theorem for partially ordered sets25 (1979) 117–119Edelman, P.H., Chain enumeration and non-crossing partitions31 (1980) 171–180Edelman, P.H., Multichains, non-crossing partitions and trees40 (1982) 171–179Edelman, P.H., R. Simion and D. White, Partition statistics on permutations99 (1992) 63–68Edelman, P.H. and R. Simion, Chains in the lattice of noncrossing partitions126(1994) 107–119Edelman, P.H., Lexicographically first reduced words147(1-3) (1995) 95–106Edelsbrunner, H. and D. Haussler, The complexity of cells in three-dimensional arrangements60 (1986) 139–

146Edelsbrunner, H., A.D. Robison and X.-J. Shen, Covering convex sets with non-overlapping polygons81(1990)

153–164Edmonds, F.C., Enumeration of arrays of a given size18 (1977) 1–22Edmonds, F.C., Rectangular arrays19 (1977) 213–227Edmonds, J.,seeK. Cameron 101(1992) 1–21Edmonds, J., M. Laurent and A. Schrijver, A minor-monotone graph parameter based on oriented matroids165-

166(1-3) (1997) 209–216Edwards, K., On a problem concerning piles of counters156(1-3) (1996) 263–264Edwards, K.,seeN. Cairnie 188(1-3) (1998) 87–97


Eftimie, M. and R. Eftimie, A decomposition property of basic acyclic graphs17 (1977) 271–279Eftimie, R.,seeM. Eftimie 17 (1977) 271–279Egawa, Y., M. Urabe, T. Fukuda and S. Nagoya, A decomposition of complete bipartite graphs into edge-disjoint

subgraphs with star components (Note) 58 (1986) 93–95Egawa, Y., Characterization of the Cartesian product of complete graphs by convex subgraphs (Note) 58 (1986)

307–309Egawa, Y.,seeK. Ando 65 (1987) 109–114Egawa, Y., H. Enomoto and A. Saito, Factors and induced subgraphs68 (1988) 179–189Egawa, Y. and P.D. Vestergaard, Spanning trees in a cactus (Note) 110(1992) 269–274Egawa, Y. and M. Kano, Sufficient conditions for graphs to have (g,f )-factors 151(1-3) (1996) 87–90Egawa, Y.,seeK. Ando 167-168(1-3) (1997) 35–63Egawa, Y., Contractible cycles in graphs with large minimum degree171(1-3) (1997) 103–119Egawa, Y. and K. Ota, Vertex-disjoint claws in graphs197-198(1-3) (1999) 225–246Eggleton, R.B., Tiling the plane with triangles7 (1974) 53–65Eggleton, R.B., Common factors of integers: A graphic view65 (1987) 141–147Eggleton, R.B., A.S. Fraenkel and R.J. Simpson, Beatty sequences and Langford sequences111 (1993) 165–

178Ehrenborg, R. and M. Readdy, Juggling and applications toq-analogues 157(1-3) (1996) 107–125Ehrenfeucht, A., K.P. Lee and G. Rozenberg, On the number of subwords of everywhere growing DT0L languages

15 (1976) 223–234Ehrenfeucht, A., J. Karhumäki and G. Rozenberg, A note on D0L length sets22 (1978) 233–242Ehrenfeucht, A. and D.M. Silberger, Periodicity and unbordered segments of words26 (1979) 101–109Ehrenfeucht, A., V. Faber and H.A. Kierstead, A new method of proving theorems on chromatic index52(1984)

159–164Ehrenfeucht, A., T. Harju and G. Rozenberg, Incremental construction of 2-structures128(1-3) (1994) 113–141Ehrenfeucht, A.,seeE. Knill 141(1-3) (1995) 185–194Ehrenfeucht, A., T. Harju, P. ten Pas and G. Rozenberg, Permutations, parenthesis words, and Schröder numbers

190(1-3) (1998) 259–264Eidswick, J.A., Short factorizations of permutations into transpositions73 (1989) 239–243Eisfeld, J., On the common nature of Spreads and Pencils in PG(d ,q) 189(1-3) (1998) 95–104Eke, B.G., Monotonic triads 9 (1974) 359–363Eke, B.G., Coprimes in blocks of successive integers149(1-3) (1996) 313–317Ekhad, S.B., A short proof of a ‘strange’ combinatorial identity conjectured by Gosper (Note) 90 (1991) 319–

320Ekhad, S.B.,seeS. Parnes 110(1992) 263–264El Gamal, A.,seeR. Ahlswede 49 (1984) 1–5Eliad-Badt, E., Decomposition of the complete hypergraph into stars71 (1988) 107–117Eliahou, S., The 3x + 1 problem: new lower bounds on nontrivial cycle lengths118(1993) 45–56El Kadi Abderrezzak, M., E. Flandrin, A. Harkat-Benhamdine and H. Li,Dλ-cycles inλ-claw-free graphs 165-

166(1-3) (1997) 11–20Ellingham, M.N., Isomorphic factorization ofr-regular graphs intor parts 69 (1988) 19–34Ellingham, M.N., R.L. Hemminger and K.E. Johnson, Contractible edges in longest cycles in non-Hamiltonian

graphs 133(1-3) (1994) 89–98El-Mallah, E.S. and C.J. Colbourn, On two dual classes of planar graphs80 (1990) 21–40Elmallah, E.S.,seeC.J. Colbourn 114(1993) 115–129El-Zahar, M. and N.W. Sauer, Ramsey-type properties of relational structures94 (1991) 1–10El-Zahar, M.H., On circuits in graphs50 (1984) 227–230El-Zahar, M.H.,seeB.I. Bayoumi 131(1-3) (1994) 29–37El-Zahar, M.H. and L.A. Fateen, On sphere orders185(1-3) (1998) 249–253El-Zanati, S. and C.V. Eynden, Cycle factorizations of cycle products189(1-3) (1998) 267–275El-Zanati, S.I., Maximum packings with odd cycles131(1-3) (1994) 91–97Emamy-K, M.R. and L. Lazarte, On the cut-complexes of the 5-cube78 (1989) 239–256Emamy-K., M.R., On the covering cutscd (d 6 5) 68 (1988) 191–196Endo, T., The pagenumber of toroidal graphs is at most seven175(1-3) (1997) 87–96Engel, K., About the number of pairs of elements ofEn

kwhose distances have given values45 (1983) 209–216


Engel, K., Strong properties in partially ordered sets I47 (1983) 229–234Engel, K., Strong properties in partially ordered sets II48 (1984) 187–196Engel, K. and H.-D.O.F. Gronau, An intersection-union theorem for integer sequences54 (1985) 153–159Engel, K. and P.L. Erdos, Polytopes determined by complementfree Sperner families81 (1990) 165–169Engel, K.,seeI. Bouchemakh 170(1-3) (1997) 51–61Engel, P., On the enumeration of polyhedra (Communication) 41 (1982) 215–218Engel, P., The enumeration of four-dimensional polytopes91 (1991) 9–31Engelhardt, E., V. Klee, K. Li and H. Quaife, Minimum graphs of specified diameter, connectivity and valence.

II 78 (1989) 257–266Enns, T.C., Convex 4-valent polytopes30 (1980) 227–234Enns, T.C., Hamiltonian circuits and paths in subset graphs with circular adjacency122(1993) 153–165Enomoto, H.,seeY. Egawa 68 (1988) 179–189Enomoto, H., H. Mizutani and N. Tokushige, A word problem in Artin semigroups104(1992) 159–166Enomoto, H. and M. Kano, Disjoint odd integer subsets having a constant even sum137(1-3) (1995) 189–193Enomoto, H., Toughness and the existence ofk-factors. III 189(1-3) (1998) 277–282Entringer, R.C. and L.D. Gassman, Line-critical point determining and point distinguishing graphs10 (1974)

43–55Entringer, R.C.,seeL. Clark 30 (1980) 95–101Entringer, R.C.,seeL.H. Clark 81 (1990) 137–145Entringer, R.C.,seeL.A. Székely 103(1992) 293–300Entringer, R.C.,seeC.A. Barefoot 125(1994) 15–30Entringer, R.C.,seeC.A. Barefoot 150(1-3) (1996) 31–48Eplett, W.J.R., A note about the Catalan triangle (Note) 25 (1979) 289–291Eppstein, D., J. Feigenbaum and C.-L. Li, Equipartitions of graphs91 (1991) 239–248Era, H.,seeH. Narushima 21 (1978) 215–217Era, H.,seeJ. Akiyama 34 (1981) 209–218Era, H. and M. Tsuchiya, On upper bound graphs whose complements are also upper bound graphs179 (1-3)

(1998) 103–109Erdös, P., On some extremal problems onr-graphs 1 (1971) 1–6Erdös, P.,seeV. Chvátal 2 (1972) 111–113Erdös, P., A. Meir, V.T. Sós and P. Turán, On some applications of graph theory, I2 (1972) 207–228Erdös, P.,seeV. Chvatal 3 (1972) 301–304Erdös, P. and P.E. O’Neil, On a generalization of Ramsey numbers4 (1973) 29–35Erdös, P. and M. Simonovits, On a valence problem in extremal graph theory5 (1973) 323–334Erdös, P.,seeB. Andrásfai 8 (1974) 205–218Erdös, P. and D.J. Kleitman, Extremal problems among subsets of a set8 (1974) 281–294Erdös, P.,seeM. Deza 12 (1975) 295–308Erdös, P.,seeB. Bollobás 13 (1975) 97–107Erdös, P. and A. Meir, On total matching numbers and total covering numbers of complementary graphs19

(1977) 229–233Erdös, P.,seeK. Alladi 22 (1978) 201–211Erdös, P., S.H. Hechler and P. Kainen, On finite superuniversal graphs24 (1978) 235–249Erdös, P. and J. Pach, On a problem of L. Fejes Tóth30 (1980) 103–109Erdös, P.,seeS.A. Burr 33 (1981) 227–237Erdös, P.,seeS.A. Burr 38 (1982) 23–32Erdös, P., G. Purdy and E.G. Straus, On a problem in combinatorial geometry40 (1982) 45–52Erdös, P., A.M. Hobbs and C. Payan, Disjoint cliques and disjoint maximal independent sets of vertices in graphs

42 (1982) 57–61Erdös, P. and Z. Palka, Trees in random graphs46 (1983) 145–150Erdös, P., R.C. Mullin, V.T. Sós and D.R. Stinson, Finite linear spaces and projective planes47 (1983) 49–62Erdös, P. and N. Hindman, Enumeration of intersecting families48 (1984) 61–65Erdös, P. and Z. Palka, Addendum to “Trees in random graphs”48 (1984) 331Erdös, P. and A. Hajnal, Chromatic number of finite and infinite graphs and hypergraphs53 (1985) 281–285Erdös, P. and D.B. West, A note on the interval number of a graph55 (1985) 129–133Erdös, P., N. Linial and S. Moran, Extremal problems on permutations under cyclic equivalence64 (1987) 1–11


Erdös, P., Z. Füredi, A. Hajnal, P. Komjáth, V. Rödl and Á. Seress, Coloring graphs with locally few colors59(1986) 21–34

Erdös, P. and M. Erné, Clique numbers of graphs59 (1986) 235–242Erdös, P., On some metric and combinatorial geometric problems60 (1986) 147–153Erdös, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, A Ramsey problem of Harary on graphs with prescribed

size 67 (1987) 227–233Erdos, P., Problems and results in combinatorial analysis and graph theory72 (1988) 81–92Erdos, P., R. Faudree and E.T. Ordman, Clique partitions and clique coverings72 (1988) 93–101Erdos, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, Extremal theory and bipartite graph-tree Ramsey

numbers 72 (1988) 103–112Erdos, P. and A. Hajnal, On the number of distinct induced subgraphs of a graph75 (1989) 145–154Erdos, P., J.L. Nicolas and A. Sárkozy, On the number of partitions ofn without a given subsum (I) 75 (1989)

155–166Erdos, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, Subgraphs of minimal degreek 85 (1990) 53–58Erdos, P. and F. Galvin, Some Ramsey-type theorems87 (1991) 261–269Erdos, P., S. Fajtlowicz and W. Staton, Degree sequences in triangle-free graphs92 (1991) 85–88Erdos, P. and J.A. Larson, Matchings from a set below to a set above95 (1991) 169–182Erdos, P., Z. Füredi and Z. Tuza, Saturatedr-uniform hypergraphs 98 (1991) 95–104Erdos, P., R.J. Faudree and C.C. Rousseau, Extremal problems involving vertices and edges on odd cycles101

(1992) 23–31Erdos, P. and A. Sárközy, Arithmetic progressions in subset sums102(1992) 249–264Erdos, P.,seeR.A. Duke 108(1992) 261–278Erdos, P., T. Gallai and Z. Tuza, Covering the cliques of a graph with vertices108(1992) 279–289Erdos, P., Z. Füredi, J. Pach and I.Z. Ruzsa, The grid revisited111(1993) 189–196Erdos, P. and F. Galvin, Monochromatic infinite paths113(1993) 59–70Erdös, P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph (Note) 113(1993) 259–262Erdos, P., R.J. Faudree and C.C. Rousseau, Extremal problems and generalized degrees127 (1-3) (1994) 139–

152Erdos, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, A local density condition for triangles127(1-3) (1994)

153–161Erdos, P., Problems and results in discrete mathematics136(1-3) (1994) 53–73Erdos, P., A. Sárközy and V.T. Sós, On additive properties of general sequences136(1-3) (1994) 75–99Erdos, P.,seeA. Bialostocki 137(1-3) (1995) 19–34Erdos, P., R. Faudree, T.J. Reid, R. Schelp and W. Staton, Degree sequence and independence inK(4)-free graphs

141(1-3) (1995) 285–290Erdos, P., T. Gallai and Z. Tuza, Covering and independence in triangle structures150(1-3) (1996) 89–101Erdos, P., A. Gyárfás and T. Łuczak, Graphs in which eachC4 spansK4 154(1-3) (1996) 263–268Erdos, P., T.J. Reid, R. Schelp and W. Staton, Sizes of graphs with induced subgraphs of large maximum degree

158(1-3) (1996) 283–286Erdos, P. and P. Fishburn, Maximum planar sets that determinek distances 160(1-3) (1996) 115–125Erdos, P., Some recent problems and results in graph theory164(1-3) (1997) 81–85Erdos, P., Some old and new problems in various branches of combinatorics165-166(1-3) (1997) 217–221Erdös, P. and L. Pyber, Covering a graph by complete bipartite graphs170(1-3) (1997) 249–251Erdos, P. and P. Fishburn, Distinct distances in finite planar sets175(1-3) (1997) 97–132Erdos, P., A. Gyárfás and Y. Kohayakawa, The size of the largest bipartite subgraphs177(1-3) (1997) 267–271Erdos, P.,seeB. Bollobás 200(1-3) (1999) 5–19Erdos, P.,seeJ.A. Bondy 200(1-3) (1999) 21–25Erdos, P.,seeM. Deléglise 200(1-3) (1999) 27–48Erdos, P.,seeJ.-M. Deshouillers 200(1-3) (1999) 49–54Erdos, P., R.J. Faudree, C.C. Rousseau and R.H. Schelp, The number of cycle lengths in graphs of given minimum

degree and girth 200(1-3) (1999) 55–60Erdos, P. and A. Gyárfás, Split and balanced colorings of complete graphs200(1-3) (1999) 79–86Erdos, P. and R.R. Hall, On the angular distribution of Gaussian integers with fixed norm200 (1-3) (1999)

87–94Erdos, P., G. Harcos and J. Pach, Popular distances in 3-space200(1-3) (1999) 95–99


Erdos, P. and G. Kolesnik, Prime power divisors of binomial coefficients200(1-3) (1999) 101–117Erdos, P., J.L. Malouf, J.L. Selfridge and E. Szekeres, Subsets of an interval whose product is a power200(1-3)

(1999) 137–147Erdos, P., C. Mauduit and A. Sárközy, On arithmetic properties of integers with missing digits II: Prime factors

200(1-3) (1999) 149–164Erdos, P. and P.P. Pálfy, On the orders of directly indecomposable groups200(1-3) (1999) 165–179Erdos, P. and G. Tenenbaum, Ensembles de multiples de suites finies200(1-3) (1999) 181–203Erdos, P.L.,seeK. Engel 81 (1990) 165–169Erdos, P.L., A new bijection on rooted forests111(1993) 179–188Erdos, P.L., U. Faigle and W. Kern, On the average rank of LYM-sets144(1-3) (1995) 11–22Erdos, P.L., Splitting property in infinite posets163(1-3) (1997) 251–256Erickson, M., A conjecture concerning Ramsey’s theorem (Note) 126(1994) 395–398Ericson, T. and V. Zinoviev, On spherical codes generating the kissing number in dimensions 8 and 24106/107

(1992) 199–207Eriksson, K.,seeA. Björner 132(1-3) (1994) 373–376Eriksson, K., The numbers game and Coxeter groups139(1-3) (1995) 155–166Eriksson, K., Strong convergence and the polygon property of 1-player games153(1-3) (1996) 105–122Eriksson, K., Reduced words in affine Coxeter groups157(1-3) (1996) 127–146Erné, M., On the cardinalities of finite topologies and the number of antichains in partially ordered sets35

(1981) 119–133Erné, M.,seeP. Erdös 59 (1986) 235–242Erné, M., The number of partially ordered sets with more points than incomparable pairs105(1992) 49–60Erné, M.,seeK. Deiters 181(1-3) (1998) 91–111Escott, A.E.,seeS. Perkins 197-198(1-3) (1999) 637–655Espona, M.,seeJ.M. Brunat 138(1-3) (1995) 147–159Esqué, P., F. Aguiló and M.A. Fiol, Double commutative-step digraphs with minimum diameters114 (1993)

147–157Essam, J.W., Graph theory and statistical physics1 (1971) 83–112Essam, J.W.,seeD.K. Arrowsmith 27 (1979) 215–223Essert, M.,seeV. Cepulic 71 (1988) 9–17Estabrook, G.F., C.S. Johnson Jr. and F.R. McMorris, An algebraic analysis of cladistic characters16 (1976)

141–147Eswarathasan, A. and E. Levine,p-Integral harmonic sums91 (1991) 249–257Etienne, G., Linear extensions of finite posets and a conjecture of G. Kreweras on permutations (Communication)

52 (1984) 107–112Etienne, G. and M.L. Vergnas, External and internal elements of a matroid basis179(1-3) (1998) 111–119Ettinger, J.M., Finitely presented partially ordered abelian groups175(1-3) (1997) 133–141Etzion, T., Hamiltonian decomposition ofK∗n , patterns with distinct differences, and Tuscan squares91 (1991)

259–276Etzion, T., Combinatorial designs with Costas arrays properties93 (1991) 143–154Etzion, T., Optimal constant weight codes overZk and generalized designs169(1-3) (1997) 55–82Eugeni, F.,seeA. Beutelspacher 54 (1985) 241–257Eugeni, F.,seeA. Barlotti 174(1-3) (1997) 1Euler, R., Rank-axiomatic characterizations of independence systems32 (1980) 9–17Euler, R., R.E. Burkard and R. Grommes, On latin squares and the facial structure of related polytopes62

(1986) 155–181Evako, A.V., Topological properties of the intersection graph of covers ofn-dimensional surfaces147 (1-3)

(1995) 107–120Evans, A.B., Orthomorphisms ofZp 64 (1987) 147–156Evans, A.B., Generating orthomorphisms of GF(q)+ 63 (1987) 21–26Evans, C.W., Net structure and cages27 (1979) 193–204Evans, R.J., On additive partitions of sets of positive integers36 (1981) 239–245Evdokimov, S., M. Karpinski and I. Ponomarenko, Compact cellular algebras and permutation groups197-198

(1-3) (1999) 247–267Everett, C.J. and P.R. Stein, The asymptotic number of integer stochastic matrices1 (1971) 55–72


Everett, C.J. and P.R. Stein, The asymptotic number of (0,1)-matrices with zero permanent6 (1973) 29–34Everett, C.J. and P.R. Stein, The combinatorics of random walk with absorbing barriers17 (1977) 27–45Everett, C.J.,seeP.R. Stein 21 (1978) 309–318Everett, C.J.,seeP.R. Stein 63 (1987) 67–79Everett, H., C.M.H. de Figueiredo, C. Linhares-Sales, F. Maffray, O. Porto and B.A. Reed, Path parity and

perfection 165-166(1-3) (1997) 223–242Everett, M.G. and S.B. Seidman, The hull number of a graph57 (1985) 217–223Exoo, G. and F. Harary, The smallest graphs with certain adjacency properties29 (1980) 25–32Exoo, G.,seeJ. Akiyama 34 (1981) 209–218Exoo, G.,seeT. Asano 38 (1982) 1–6Exoo, G., On line disjoint paths of bounded length (Note) 44 (1983) 317–318Exoo, G. and D.F. Reynolds, Ramsey numbers based onC5-decompositions 71 (1988) 119–127Exoo, G., Three color Ramsey number ofK4− e (Note) 89 (1991) 301–305Eynden, C.V.,seeS. El-Zanati 189(1-3) (1998) 267–275Ezell, C.L., Observations on the construction of covers using permutation voltage assignments28 (1979) 7–20Faber, V. and J. Mycielski, Graphs with valencyk, edge connectivityk, chromatic indexk+ 1 and arbitrary girth

4 (1973) 339–345Faber, V.,seeA. Ehrenfeucht 52 (1984) 159–164Faber, V.,seeT.L. Brewster 147(1-3) (1995) 35–55Fàbrega, J.,seeM.A. Fiol 125(1994) 169–176Fàbrega, J. and M.A. Fiol, Extraconnectivity of graphs with large girth127(1-3) (1994) 163–170Fàbrega, J. and M.A. Fiol, On the extraconnectivity of graphs155(1-3) (1996) 49–57Fàbrega, J.,seeC. Balbuena 167-168(1-3) (1997) 85–100Fàbrega, J.,seeM.C. Balbuena 174(1-3) (1997) 3–17Fàbrega, J.,seeM.C. Balbuena 174(1-3) (1997) 19–27Fàbrega, J.,seeC. Balbuena 197-198(1-3) (1999) 61–75Fabrici, I. and S. Jendrol’, Subgraphs with restricted degrees of their vertices in planar graphs191(1-3) (1998)

83–90Fagin, R., The number of finite relational structures19 (1977) 17–21Faigle, U., The Greedy algorithm for partially ordered sets28 (1979) 153–159Faigle, U. and R. Schrader, A combinatorial bijection between linear extensions of equivalent orders

(Communication) 58 (1986) 295–301Faigle, U. and Gy. Turán, On the complexity of interval orders and semiorders63 (1987) 131–141Faigle, U.,seeP.L. Erdos 144(1-3) (1995) 11–22Faina, G. and F. Pambianco, Small complete caps in PG(r, q), r ≥ 3 174(1-3) (1997) 117–123Fajtlowicz, S., On conjectures of Graffiti72 (1988) 113–118Fajtlowicz, S.,seeP. Erdos 92 (1991) 85–88Fajtlowicz, S.,seeJ.A. Bondy 200(1-3) (1999) 21–25Falmagne, J.-C.,seeJ.-P. Doignon 173(1-3) (1997) 35–44Fan, C., D.R. Lick and J. Liu, Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on

abelian groups 158(1-3) (1996) 49–62Fan, C.K., Matchings and the sum function (Communication) 120(1993) 205–209Fan, G.,seeJ.A. Bondy 67 (1987) 205–208Fan, G., On diameter 2-critical graphs67 (1987) 235–240Fan, G.,seeD. Bauer 96 (1991) 33–49Fan, H.,seeB. Xu 152(1-3) (1996) 325–328Fan, S., On End-regular graphs159(1-3) (1996) 95–102Fanelli, S., An unresolved conjecture on nonmaximal planar graphical sequences (Communication) 36 (1981)

109–112Fang, X.G., C.H. Li and C.E. Praeger, On orbital regular graphs and frobenius graphs182(1-3) (1998) 85–99Fanning, J.D., A family of symmetric designs146(1-3) (1995) 307–312Faradzev, I.A., Association schemes on the set of antiflags of a projective plane127(1-3) (1994) 171–179Farber, M., Characterizations of strongly chordal graphs43 (1983) 173–189Farber, M. and R.E. Jamison, On local convexity in graphs66 (1987) 231–247Farber, M., Bridged graphs and geodesic convexity66 (1987) 249–257


Farber, M., Basis pair graphs of transversal matroids are connected73 (1989) 245–248Farber, M., On diameters and Radii of bringed graphs73 (1989) 249–260Farhi, G., On a problem of Chvatal (Communication) 30 (1980) 303–304Farkas, D.R., Radicals and primes in incidence algebras10 (1974) 257–268Farley, A., S. Hedetniemi, S. Mitchell and A. Proskurowski, Minimum broadcast graphs (Note) 25 (1979) 189–

193Farley, J.D., Perfect sequences of chain-complete posets167-168(1-3) (1997) 271–296Farmakis, N. and S. Kounias, The excess of Hadamard matrices and optimal designs67 (1987) 165–176Farmakis, N.,seeS. Kounias 68 (1988) 59–69Farmer, F.D., Homology of products and joins of reflexive relations11 (1975) 23–27Farr, G., The complexity of multicolouring69 (1988) 219–223Farr, G., The subgraph homeomorphism problem for small wheels71 (1988) 129–142Farrell, E.J., On graphical partitions and planarity18 (1977) 149–153Farrell, E.J., On a class of polynomials obtained from the circuits in a graph and its application to characteristic

polynomials of graphs 25 (1979) 121–133Farrell, E.J., Chromatic roots—Some observations and conjectures29 (1980) 161–167Farrell, E.J., On chromatic coefficients29 (1980) 257–264Farrell, E.J., Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 233 (1981) 259–266Farrell, E.J., Cycle decompositions of complete graphs38 (1982) 157–162Farrell, E.J., A note on the circuit polynomials and characteristic polynomials of wheels and ladders39 (1982)

31–36Farrell, E.J., Forest decompositions of ladders44 (1983) 267–274Farrell, E.J., J.M. Guo and G.M. Constantine, On matching coefficients (Note) 89 (1991) 203–210Farrell, E.J.,seeR.A. Beezer 137(1-3) (1995) 7–18Farrell, P.G.,seeR.M. Campello de Souza 56 (1985) 111–116Fateen, L.A.,seeM.H. El-Zahar 185(1-3) (1998) 249–253Faudree, R.,seeP. Erdos 72 (1988) 93–101Faudree, R.,seeP. Erdos 141(1-3) (1995) 285–290Faudree, R., E. Flandrin and Z. Ryjácek, Claw-free graphs — A survey164(1-3) (1997) 87–147Faudree, R.J., C.C. Rousseau and R.H. Schelp, Theory of path length distributions I6 (1973) 35–52Faudree, R.J. and R.H. Schelp, All Ramsey numbers for cycles in graphs8 (1974) 313–329Faudree, R.J., S.L. Lawrence, T.D. Parsons and R.H. Schelp, Path-cycle Ramsey numbers10 (1974) 269–277Faudree, R.J. and R.H. Schelp, Ramsey numbers for all linear forests16 (1976) 149–155Faudree, R.J., R.H. Schelp and J. Sheehan, Ramsey numbers for matchings32 (1980) 105–123Faudree, R.J.,seeS.A. Burr 33 (1981) 227–237Faudree, R.J.,seeS.A. Burr 38 (1982) 23–32Faudree, R.J. and J. Sheehan, Size Ramsey numbers involving stars46 (1983) 151–157Faudree, R.J. and J. Sheehan, Regular graphs and edge chromatic number48 (1984) 197–204Faudree, R.J.,seeP. Erdös 67 (1987) 227–233Faudree, R.J.,seeP. Erdos 72 (1988) 103–112Faudree, R.J., C.C. Rousseau and R.H. Schelp, Small order graph-tree Ramsey numbers72 (1988) 119–127Faudree, R.J., R.H. Schelp, M.S. Jacobson and J. Lehel, Irregular networks, regular graphs and integer matrices

with distinct row and column sums76 (1989) 223–240Faudree, R.J., A. Gyárfas, R.H. Schelp and Zs. Tuza, Induced matchings in bipartite graphs78 (1989) 83–87Faudree, R.J.,seeP. Erdos 85 (1990) 53–58Faudree, R.J., R.J. Gould and L.M. Lesniak, Neighborhood conditions and edge-disjoint perfect matchings91

(1991) 33–43Faudree, R.J., M.S. Jacobson, L. Kinch and J. Lehel, Irregularity strength of dense graphs91 (1991) 45–59Faudree, R.J.,seeP. Erdos 101(1992) 23–31Faudree, R.J., R.J. Gould, M.S. Jacobson, L.M. Lesniak and T.E. Lindquester, On independent generalized

degrees and independence numbers inK(1,m)-free graphs 103(1992) 17–24Faudree, R.J., R.J. Gould, M.S. Jacobson and L.M. Lesniak, Neighborhood unions and a generalization of Dirac’s

theorem 105(1992) 61–71Faudree, R.J. and D.J. Knisley, A neighborhood condition which implies the existence of a complete multipartite

subgraph 118(1993) 57–68


Faudree, R.J., R.H. Schelp, L. Lesniak, A. Gyárfás and J. Lehel, On the rotation distance of graphs126(1994)121–135

Faudree, R.J.,seeP. Erdos 127(1-3) (1994) 139–152Faudree, R.J.,seeP. Erdos 127(1-3) (1994) 153–161Faudree, R.J., R.J. Gould, M.S. Jacobson and L.M. Lesniak, Degree conditions and cycle extendability141

(1-3) (1995) 109–122Faudree, R.J., R.J. Gould, M.S. Jacobson, J. Lehel and L.M. Lesniak, Graph spectra150(1-3) (1996) 103–113Faudree, R.J. and R.J. Gould, Characterizing forbidden pairs for hamiltonian properties173(1-3) (1997) 45–60Faudree, R.J. and J. Sheehan, The maximum number of edges in a graph with fixed edge-degree183 (1-3)

(1998) 81–101Faudree, R.J.,seeP. Erdos 200(1-3) (1999) 55–60Faulkner, G.B. and D.H. Younger, Non-Hamiltonian cubic planar maps7 (1974) 67–74Favaron, O.,seeE.J. Cockayne 33 (1981) 249–258Favaron, O., Very well covered graphs42 (1982) 177–187Favaron, O. and O. Ordaz, A sufficient condition for oriented graphs to be Hamiltonian58 (1986) 243–252Favaron, O., Two relations between the parameters of independence and irredundance70 (1988) 17–20Favaron, O.,seeE.J. Cockayne 90 (1991) 313–317Favaron, O., M.C. Heydemann, J.C. Meyer and D. Sotteau, A parameter linked withG-factors and the binding

number (Note) 91 (1991) 311–316Favaron, O., M. Mahéo and J.-F. Saclé, Some eigenvalue properties in graphs (conjectures of Graffiti — II)111

(1993) 197–220Favaron, O., A note on the irredundance number after vertex deletion121(1993) 51–54Favaron, O., P. Mago and O. Ordaz, On the bipartite independence number of a balanced bipartite graph121

(1993) 55–63Favaron, O. and J.L. Fouquet, Onm-centers inPt -free graphs 125(1994) 147–152Favaron, O., Least domination in a graph150(1-3) (1996) 115–122Favaron, O., Signed domination in regular graphs158(1-3) (1996) 287–293Favaron, O.,seeE.J. Cockayne 159(1-3) (1996) 57–68Favaron, O., H. Li and R.H. Schelp, Strong edge colorings of graphs159(1-3) (1996) 103–109Favaron, O. and Y. Redouane, Minimum independent generalizedt-degree and independence number inK1,r+1-

free graphs 165-166(1-3) (1997) 243–251Favaron, O. and J. Puech, Irredundance in grids179(1-3) (1998) 257–265Favaron, O.,seeA. Ainouche 184(1-3) (1998) 1–13Favaron, O.,seeJ. Brousek 196(1-3) (1999) 29–50Favaron, O. and J. Puech, Irredundant and perfect neighborhood sets in graphs and claw-free graphs197-198

(1-3) (1999) 269–284Favreau, L.,seeF. Bergeron 139(1-3) (1995) 19–32Favreau, L.,seeF. Bergeron 139(1-3) (1995) 463–468Fedeli, A., J. Reiterman and A. Tozzi, Onwα -compactness 108(1992) 13–23Fedou, J.M.,seeM.P. Delest 112(1993) 65–79Fédou, J.-M.,seeM. Bousquet-Mélou 137(1-3) (1995) 53–75Fedou, J.M., Sur les fonctions de Bessel139(1-3) (1995) 473–480Fedou, J.-M. and D. Rawlings, Statistics on pairs of permutations143(1-3) (1995) 31–45Fédou, J.M.,seeE. Barcucci 189(1-3) (1998) 21–42Feigenbaum, J.,seeD. Eppstein 91 (1991) 239–248Feigenbaum, J. and A.A. Schäffer, Finding the prime factors of strong direct product graphs in polynomial time

109(1992) 77–102Feinberg, R.B., Characterization of incidence algebras17 (1977) 47–70Feinberg, R.B., The circular dimension of a graph25 (1979) 27–31Feinsilver, P. and R. Schott, Formal power series, operator calculus, and duality on Lie algebras180(1-3) (1998)

157–171Feix, R., On a property of graphs containing infinitely many isomorphic copies of themselves68 (1988) 197–

209Fellows, M.,seeD.J. Kleitman 73 (1988/89) 119–125Felsner, S. and W.T. Trotter, On the fractional dimension of partially ordered sets136(1-3) (1994) 101–117


Felsner, S. and W.T. Trotter, Colorings of diagrams of interval orders andα-sequences of sets144(1-3) (1995)23–31

Felzenbaum, A.,seeM.A. Berger 65 (1987) 23–46Felzenbaum, A., R. Holzman and D.J. Kleitman, Packing lines in a hypercube117(1993) 107–112Fendel, J.,seeJ. Berenbom 175(1-3) (1997) 23–33Feng, G.-L., Generalized threshold decoding of cyclic codes56 (1985) 147–154Feng, G.L.,seeK.K. Tzeng 56 (1985) 281–290Feng, X.,seeZ. Dai 123(1993) 17–34Fenner, T.I. and G. Loizou, Combinatorial aspects of rectangular non-negative matrices20 (1977) 217–234Fenner, T.I. and A.M. Frieze, On the existence of Hamiltonian cycles in a class of random graphs (Note) 45

(1983) 301–305Fenton, W.E., Completeness in oriented matroids66 (1987) 79–89Ferapontova, E.,seeA. Apartsin 178(1-3) (1998) 229–231Feretic, S. and D. Svrtan, Combinatorics of diagonally convex directed polyominoes157(1-3) (1996) 147–168Feretic, S., A new way of counting the column-convex polyominoes by perimeter180(1-3) (1998) 173–184Fernández, A. and V. Müller, Embedding of a separable locally pseudoconvex algebra into a locally pseudoconvex

algebra with two generators108(1992) 25–30Fernandez de la Vega, W., Sur la cardinalite maximum des couplages d’hypergraphes aleatoires uniformes (Note)

40 (1982) 315–318Fernandez de la Vega, W., On the maximum density of graphs which have no subcontraction toKs

(Communication) 46 (1983) 109–110Fernandez de la Vega, W., Kernels in random graphs (Note) 82 (1990) 213–217Fernández-Merchant, S.,seeB. Ábrego 194(1-3) (1999) 1–11Ferrarese, G.,seeM. Burzio 181(1-3) (1998) 275–281Ferrero, D. and C. Padró, Disjoint paths of bounded length in large generalized cycles197-198(1-3) (1999)

285–298Fezzi, S.,seeE. Barcucci 170(1-3) (1997) 211–217Fich, F.E.,seeJ.A. Brzozowski 50 (1984) 153–169Fichet, B.,seeJ. Diatta 192(1-3) (1998) 87–102Fickett, J.W., High valency subgraphs of cubes (Note) 27 (1979) 211–212Fiduccia, C.M., E.R. Scheinerman, A. Trenk and J.S. Zito, Dot product representations of graphs181 (1-3)

(1998) 113–138Fiedler, M., An extremal problem for the spectral radius of a graph108(1992) 149–158Fiedler, M., Some minimax problems for graphs121(1993) 65–74Fiedler, M., Additive compound graphs187(1-3) (1998) 97–108Filipoiu, A., Representation theorems for Lukasiewicz algebras (Communication) 27 (1979) 107–110Filipoiu, A., Representation of Lukasiewicz algebras by means of ordered stone spaces30 (1980) 111–116Filipoiu, A., Representation theorems forθ -valued Lukasiewicz algebras33 (1981) 21–27Filipoiu, A., Some remarks on the representation theorem of Moisil33 (1981) 163–170Filipoiu, A. and G. Georgescu, On values in relatively normal lattices161(1-3) (1996) 87–100Finbow, A., B. Hartnell and C. Whitehead, A characterization of graphs of girth eight or more with exactly two

sizes of maximal independent sets125(1994) 153–167Finizio, N.J.,seeI. Anderson 125(1994) 5–10Finizio, N.J.,seeI. Anderson 138(1-3) (1995) 31–41Finizio, N.J. and P.A. Leonard, Inductive extensions of someZ-cyclic whist tournaments 197-198(1-3) (1999)

299–307Fink, J.F. and H.J. Straight, A note on path-perfect graphs (Note) 33 (1981) 95–98Fink, J.F., M.S. Jacobson, L.F. Kinch and J. Roberts, The bondage number of a graph86 (1990) 47–57Finke, G.,seeM. Dror 195(1-3) (1999) 103–109Fiol, M.A., Congruences inZn, finite Abelian groups and the Chinese remainder theorem (Note) 67 (1987)

101–105Fiol, M.A., seeP. Esqué 114(1993) 147–157Fiol, M.A., seeJ. Gómez 114(1993) 219–235Fiol, M.A., The superconnectivity of large digraphs and graphs124(1994) 67–78Fiol, M.A. and J. Fàbrega, On the distance connectivity of graphs and digraphs125(1994) 169–176


Fiol, M.A., seeJ. Fàbrega 127(1-3) (1994) 163–170Fiol, M.A., seeF. Aguiló 138(1-3) (1995) 15–29Fiol, M.A., seeJ.M. Brunat 138(1-3) (1995) 147–159Fiol, M.A., On congruence inZn and the dimension of a multidimensional circulant141(1-3) (1995) 123–134Fiol, M.A., seeJ. Fàbrega 155(1-3) (1996) 49–57Fiol, M.A., seeF. Aguiló 167-168(1-3) (1997) 3–16Fiol, M.A., seeC. Balbuena 167-168(1-3) (1997) 85–100Fiol, M.A., E. Garriga and J.L.A. Yebra, The alternating polynomials and their relation with the spectra and

conditional diameters of graphs167-168(1-3) (1997) 297–307Fiol, M.A., seeM.C. Balbuena 174(1-3) (1997) 3–17Fiol, M.A., seeM.C. Balbuena 174(1-3) (1997) 19–27Fiol, M.A., seeJ.M. Brunat 174(1-3) (1997) 73–86Fiol, M.A., E. Garriga and J.L.A. Yebra, Boundary graphs — II The limit case of a spectral property182(1-3)

(1998) 101–111Fiol, M.A., seeC. Balbuena 197-198(1-3) (1999) 61–75Fiol, M.L., seeJ.M. Brunat 174(1-3) (1997) 73–86Fiorini, S.,seeL.W. Beineke 16 (1976) 109–121Fiorini, S.,seeI. Sciriha 174(1-3) (1997) 293–308Fischer, E.,seeN. Alon 152(1-3) (1996) 13–23Fischer, E., Cycle factors in dense graphs197-198(1-3) (1999) 309–323Fischer, K.G., Symmetric polynomials and Hall’s theorem69 (1988) 225–234Fischer, K.G., AdditiveK-colorable extensions of the rational plane82 (1990) 181–195Fishburn, P.,seeP. Erdos 160(1-3) (1996) 115–125Fishburn, P.,seeP. Erdos 175(1-3) (1997) 97–132Fishburn, P.C., On the sum-of-ranks winner when losers are removed8 (1974) 25–30Fishburn, P.C., Operations on binary relations21 (1978) 7–22Fishburn, P.C., Aspects of semiorders within interval orders40 (1982) 181–191Fishburn, P.C., Interval lengths for interval orders: A minimization problem47 (1983) 63–82Fishburn, P.C., Paradoxes of two-length interval orders52 (1984) 165–175Fishburn, P.C., Interval graphs and interval orders55 (1985) 135–149Fishburn, P.C., F.K. Hwang and H. Lee, Do local majorities force a global majority?61 (1986) 165–179Fishburn, P.C. and N.J.A. Sloane, The solution to Berlekamp’s switching game74 (1989) 263–290Fishburn, P.C. and W.V. Gehrlein, The three-permutations problem79 (1989/90) 259–264Fishburn, P.C., J.C. Lagarias, J.A. Reeds and L.A. Shepp, Sets uniquely determined by projections on axes II

Discrete case 91 (1991) 149–159Fishburn, P.C. and L.A. Shepp, On the FKB conjecture for disjoint intersections98 (1991) 105–122Fishburn, P.C. and W.T. Trotter, Linear extensions of semiorders: A maximization problem103(1992) 25–40Fishburn, P.C. and P.L. Hammer, Bipartite dimensions and bipartite degrees of graphs160(1-3) (1996) 127–148Fishburn, P.C. and W.T. Trotter, Split semiorders195(1-3) (1999) 111–126Fishel, S., Nonnegativity results for generalizedq-binomial coefficients 147(1-3) (1995) 121–137Fisher, D.,seeC. Barefoot 138(1-3) (1995) 93–99Fisher, D.C., The number of triangles in aK4-free graph (Communication) 69 (1988) 203–205Fisher, D.C. and A.E. Solow, Dependence polynomials82 (1990) 251–258Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs (Note) 103(1992) 313–320Fisher, D.C. and J. Ryan, Bounds on the largest root of the matching polynomial (Note) 110(1992) 275–278Fisher, J.C., An existence theorem for simple convex polyhedra7 (1974) 75–97Fisher, J.C.,seeA.A. Bruen 106/107(1992) 93–96Fisher, P.H., T. Penttila and G.F. Royle, Symmetric designs, polarities and sub-designs71 (1988) 19–32Fisk, S., D. Abbw-Jackson and D. Kleitman, Helly-type theorems about sets32 (1980) 19–25Fisk, S., Complementary colorings134(1-3) (1994) 41–47Fisk, S. and B. Mohar, Surface triangulations with isometric boundary134(1-3) (1994) 49–62Flach, P. and L. Volkmann, Estimations for the domination number of a graph80 (1990) 145–151Flahive, M.,seeI. Borosh 58 (1986) 215–220Flajolet, P., Combinatorial aspects of continued fractions32 (1980) 125–161


Flajolet, P., On congruences and continued fractions for some classical combinatorial quantities41 (1982) 145–153

Flajolet, P. and H. Prodinger, Level number sequences for trees65 (1987) 149–156Flajolet, P., D.E. Knuth and B. Pittel, The first cycles in an evolving graph75 (1989) 167–215Flajolet, P. and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails114

(1993) 159–180Flament, C., Hypergraphes arbores21 (1978) 223–227Flament, C. and B. Leclerc, Arbres minimaux d’un graphe preordonne46 (1983) 159–171Flament, C., Comparability graphs with constraint, partial semi-orders and interval orders53 (1985) 79–89Flandre, O., Four results about self-blocking clutters178(1-3) (1998) 51–62Flandrin, E.,seeD. Amar 46 (1983) 327Flandrin, E.,seeD. Amar 89 (1991) 111–131Flandrin, E., H.A. Jung and H. Li, Hamiltonism, degree sum and neighborhood intersections90 (1991) 41–52Flandrin, E., J.L. Fouquet and H. Li, On hamiltonian claw-free graphs111(1993) 221–229Flandrin, E.,seeD. Barraez 146(1-3) (1995) 11–18Flandrin, E.,seeR. Faudree 164(1-3) (1997) 87–147Flandrin, E.,seeM. El Kadi Abderrezzak 165-166(1-3) (1997) 11–20Fleischner, H., The uniquely embeddable planar graphs4 (1973) 347–358Fleischner, H., Even cycles with prescribed chords in planar cubic graphs44 (1983) 275–280Fleischner, H., Spanning eulerian subgraphs, the Splitting Lemma, and Petersen’s Theorem101(1992) 33–37Fleischner, H. and M. Stiebitz, A solution to a colouring problem of P. Erdos 101(1992) 39–48Fleischner, H., G. Sabidussi and E. Wenger, Transforming eulerian trails109(1992) 103–116Fleischner, H., A numbering of the vertices of special networks165-166(1-3) (1997) 253–266Fliess, M., Transductions de series formelles10 (1974) 57–74Florence, J.B., Consanguinity graphs32 (1980) 225–228Flores, C. and O. Ordaz, On the Erdos–Ginzburg–Ziv theorem152(1-3) (1996) 321–324Flotow, C.,seeT. Andreae 149(1-3) (1996) 299–302Floudas, C.A.,seeC.D. Maranas 142(1-3) (1995) 287–293Foata, D., Enumeratingk-trees 1 (1971) 181–186Foata, D.,seeJ. Désarménien 87 (1991) 133–148Foata, D.,seeJ. Désarménien 99 (1992) 49–58Foata, D., Les distributions Euler–Mahoniennes sur les mots139(1-3) (1995) 167–187Foldes, S., A characterization of hypercubes17 (1977) 155–159Foldes, S. and G. Gabor, Note on discrete random walks (Note) 24 (1978) 103–104Foldes, S. and G. Sabidussi, On semigroups of graph endomorphisms30 (1980) 117–120Foldes, S., I. Rival and J. Urrutia, Light sources, obstructions and spherical orders102(1992) 13–23Fomin, S. and A.N. Kirillov, The Yang-Baxter equation, symmetric functions, and Schubert polynomials153

(1-3) (1996) 123–143Fomin, S. and C. Greene, Noncommutative Schur functions and their applications193(1-3) (1998) 179–200Fon-Der-Flaass, D.,seeM. Axenovich 138(1-3) (1995) 57–62Fon-Der-Flaass, D.G. and A.V. Kostochka, Covering boxes by points (Note) 120(1993) 269–275Fon-Der-Flaass, D.G., Arrays of distinct representatives — a very simple NP-complete problem171 (1-3)

(1997) 295–298Fonlupt, J. and A. Zemirline, On the number of common bases of two matroids45 (1983) 217–228Fonlupt, J., A.R. Mahjoub and J.P. Uhry, Compositions in the bipartite subgraph polytope105(1992) 73–91Fonlupt, J.,seeM. Burlet 130(1-3) (1994) 39–55Fonseca, A.,seeJ.A. Dias da Silva 141(1-3) (1995) 85–93Fonseca, A.,seeR.A. Brualdi 146(1-3) (1995) 293–297Foo, M.F.,seeH.H. Teh 72 (1988) 347–353Forbes, F. and B. Ycart, Counting stable sets on Cartesian products of graphs186(1-3) (1998) 105–116Forcade, R., Parity of paths and circuits in tournaments6 (1973) 115–118Foregger, M.F., Hamiltonian decompositions of products of cycles24 (1978) 251–260Foregger, M.F., The skew chromatic index of a graph49 (1984) 27–39Forge, D. and J.L. Ramírez Alfonsín, Connected coverings and an application to oriented matroids187 (1-3)

(1998) 109–122


Fortin, D. and R. Rudolf, Weak Monge arrays in higher dimensions189(1-3) (1998) 105–115Fouché, W.L., Symmetry and the Ramsey degree of posets167-168(1-3) (1997) 309–315Fouché, W.L., Symmetries and Ramsey properties of trees197-198(1-3) (1999) 325–330Fouché, W.L., L.M. Pretorius and C.J. Swanepoel, Partition theorems for factorisations of ascending parameter

words 197-198(1-3) (1999) 331–350Foulds, L.R. and R.W. Robinson, Enumerating phylogenetic trees with multiple labels72 (1988) 129–139Foulkes, H.O., Paths in ordered structures of partitions9 (1974) 365–374Foulkes, H.O., Enumeration of permutations with prescribed up-down and inversion sequences15 (1976) 235–

252Foulkes, H.O., Tangent and secant numbers and representations of symmetric groups15 (1976) 311–324Foulkes, H.O., Recurrences for characters of the symmetric group21 (1978) 137–144Foulkes, H.O., Eulerian numbers, Newcomb’s problem and representations of symmetric groups30 (1980) 3–

49Fouquet, J.L., Note sur la non existence d’un snark d’ordre 1638 (1982) 163–171Fouquet, J.L.,seeJ.C. Bermond 52 (1984) 123–132Fouquet, J.-L.,seeD. Benard 62 (1986) 261–270Fouquet, J.-L.,seeA. Benhocine 66 (1987) 21–26Fouquet, J.-L. and H. Thuillier, On some conjectures on cubic 3-connected graphs80 (1990) 41–57Fouquet, J.L.,seeE. Flandrin 111(1993) 221–229Fouquet, J.L. and H. Thuillier, Decomposition of 3-connected cubic graphs114(1993) 181–198Fouquet, J.L., A decomposition for a class of(P5,P5)-free graphs 121(1993) 75–83Fouquet, J.-L. and A.P. Wojda, Mutual placement of bipartite graphs121(1993) 85–92Fouquet, J.L.,seeO. Favaron 125(1994) 147–152Fouquet, J.L. and R. Rosenstiehl, Preface165-166(1-3) (1997) 1–2Fouquet, J.-L. and V. Giakoumakis, On semi-P4-sparse graphs165-166(1-3) (1997) 267–290Fouquet, J.-L., F. Maire, I. Rusu and H. Thuillier, On transversals in minimal imperfect graphs165-166(1-3)

(1997) 291–302Fouquet, J.-L.,seeC. Berge 169(1-3) (1997) 169–175Fournier, G.,seeJ. Constantin 53 (1985) 21–33Fournier, G.,seeM.-F. Bélanger 130(1-3) (1994) 9–17Fournier, G. and L. Gagnon, Théorème de point fixe asymptotique dans les ordonnés infinis130 (1-3) (1994)

69–76Fournier, I.,seeD. Amar 46 (1983) 327Fournier, I.,seeD. Amar 89 (1991) 111–131Fournier, J.C. and M. Las Vergnas, Une classe d’hypergraphes bichromatiques (Note) 2 (1972) 407–410Fournier, J.-C. and M. Las Vergnas, Une classe d’hypergraphes bichromatiques II7 (1974) 99–106Fournier, J.-C., Demonstration simple du theoreme de Kuratowski et de sa forme duale (Communication) 31

(1980) 329–332Fournier, J.-C., Hypergraphes de chaines d’aretes d’un arbre43 (1983) 29–36Fournier, J.C., Tiling pictures of the plane with dominoes165-166(1-3) (1997) 303–310Fournier, R., Note sur la decomposition deKℵ0 (Note) 37 (1981) 115–117Fra, A.D. and D. Ghinelli,Af*.Af geometries, the Klein quadric andHnq 129(1-3) (1994) 53–74Fraenkel, A.S., J. Levitt and M. Shimshoni, Characterization of the set of valuesf (n) = [nα], n = 1,2, . . . 2

(1972) 335–345Fraenkel, A.S., A characterization of exactly covering congruences4 (1973) 359–366Fraenkel, A.S., Further characterizations and properties of exactly covering congruences12 (1975) 93–100Fraenkel, A.S.,seeM. Boshernitzan 34 (1981) 325–327Fraenkel, A.S.,seeM. Mor 48 (1984) 101–112Fraenkel, A.S.,seeM.A. Berger 65 (1987) 23–46Fraenkel, A.S.,seeZ. Agur 70 (1988) 295–302Fraenkel, A.S.,seeN. Duvdevani 76 (1989) 197–221Fraenkel, A.S.,seeR.B. Eggleton 111(1993) 165–178Fraenkel, A.S. and C. Kimberling, Generalized Wythoff arrays, shuffles and interspersions126(1994) 137–149Fraenkel, A.S., H. Porta and K.B. Stolarsky, The almost PV behavior of some far from PV algebraic integers

135(1-3) (1994) 93–101


Fraenkel, A.S. and M. Loebl, Complexity of circuit intersection in graphs141(1-3) (1995) 135–151Fraisse, P., A note on distance-dominating cycles71 (1988) 89–92Fraisse, P. and O. Ordaz, A Chvátal–Erdös condition for(t, t)-factors in digraphs using given arcs71 (1988)

143–148Francel, M.A., Possible orders for the stabilizer of a set of M.O.L.S.84 (1990) 119–134Francke, J. and J.J.H. Meijers, Super-visible codes110(1992) 119–134Françon, J., Preuves combinatoires des identites d’Abel8 (1974) 331–343Françon, J. and G. Viennot, Permutations selon leurs pics, creux, doubles montées et double descentes, nombres

d’Euler et nombres de Genocchi28 (1979) 21–35Franek, F. and V. Rödl, 2-Colorings of complete graphs with a small number of monochromaticK4 subgraphs

114(1993) 199–203Frank, A., On a class of balanced hypergraphs20 (1977) 11–20Frank, A., A note onk-strongly connected orientations of an undirected graph (Note) 39 (1982) 103–104Frank, A., On a theorem of Mader101(1992) 49–57Frank, A., Submodular functions in graph theory111(1993) 231–243Frank, O.,seeM. Capobianco 46 (1983) 133–143Frank, O., Triad count statistics72 (1988) 141–149Frank Hsu, D.,seeF. Cao 183(1-3) (1998) 27–38Frankl, F., A lower bound on the size of a complex generated by an antichain (Communication) 76(1989) 51–56Frankl, P., Families of finite sets satisfying a union condition26 (1979) 111–118Frankl, P.,seeA. Békéssy 30 (1980) 83–88Frankl, P.,seeJ.-C. Bermond 30 (1980) 295–298Frankl, P.,seeG. Cohen 31 (1980) 271–277Frankl, P. and Z. Füredi, A short proof for a theorem of Harper about Hamming-spheres (Note) 34 (1981)

311–313Frankl, P., A probabilistic proof for the LYM-inequality (Communication) 43 (1983) 325Frankl, P. and Z. Füredi, A new extremal property of Steiner triple-systems48 (1984) 205–212Frankl, P., A new short proof for the Kruskal–Katona theorem (Communication) 48 (1984) 327–329Frankl, P. and Z. Füredi, An exact result for 3-graphs (Communication) 50 (1984) 323–328Frankl, P.,seeG. Cohen 56 (1985) 125–131Frankl, P., What must be contained in every orientedk-uniform hypergraph (Communication) 62 (1986) 311–

313Frankl, P. and H. Maehara, Open-interval graphs versus closed-interval graphs (Note) 63 (1987) 97–100Frankl, P.,seeA.R. Calderbank 83 (1990) 201–204Frankl, P., An intersection problem for codes84 (1990) 135–141Frankl, P. and Z. Füredi, A sharpening of Fisher’s inequality (Note) 90 (1991) 103–107Frankl, P., On cross-intersecting families108(1992) 291–295Frankl, P., H. Maehara and J. Nakashima, On the section of a convex polyhedron140(1-3) (1995) 265–267Fraughnaugh, K.,seeC. Barefoot 138(1-3) (1995) 93–99Frazer Lock, P.,seeC.J. Kinckerbocker 88 (1991) 33–48Fredman, M.L., On computing the length of longest increasing subsequences11 (1975) 29–35Fredricksen, H. and J. Maiorana, Necklaces of beads ink colors andk-ary de Bruijn sequences23 (1978)

207–210Fredricksen, H. and I.J. Kessler, An algorithm for generating necklaces of beads in two colors61 (1986) 181–

188Fredricksen, H.,seeR.D. Bryant 89 (1991) 133–148Freeman, J.M. and F. Hoffman, A semigroup and Gaussian polynomials36 (1981) 247–260Freese, R., An application of Dilworth’s lattice of maximal antichains7 (1974) 107–109Freiman, G., E. Lipkin and L. Levitin, A polynomial algorithm for constructing families ofk-independent sets

70 (1988) 137–147Freiman, G.A., New analytical results in subset-sum problem114(1993) 205–218Frick, M., seeI. Broere 82 (1990) 225–232Frick, M. and M.A. Henning, Extremal results on defective colorings of graphs126(1994) 151–158Frick, M., seeG. Benadé 162(1-3) (1996) 13–22Fricke, G.,seeE.J. Cockayne 138(1-3) (1995) 199–205


Fricke, G.H., T.W. Haynes, S. Hedetniemi, S.T. Hedetniemi and M.A. Henning, A note on perfect neighborhoodsets in graphs 199(1-3) (1999) 221–225

Friedlander, R.J.,seeM.D. Miller 19 (1977) 77–84Frieze, A. and B. Reed, Polychromatic Hamilton cycles118(1993) 69–74Frieze, A.M.,seeT.I. Fenner 45 (1983) 301–305Frieze, A.M., On large matchings and cycles in sparse random graphs59 (1986) 243–256Frieze, A.M., Partitioning random graphs into large cycles70 (1988) 149–158Frieze, A.M., On the independence number of random graphs81 (1990) 171–175Frieze, A.M.,seeM.H. Albert 87 (1991) 1–8Fripertinger, H., Enumeration of mosaics199(1-3) (1999) 49–60Fröberg, R., A characterization ofk-trees (Note) 104(1992) 307–309Froncek, D., e-Realization of double-stars (Note) 126(1994) 399–402Froncek, D., Almost self-complementary factors of complete bipartite graphs167-168(1-3) (1997) 317–327Frydrych, W., All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions121(1993)

93–104Fu, C.-M.,seeC.-C. Chou 197-198(1-3) (1999) 195–203Fu, H.-L., Intersection problem of Steiner systemsS(3,4,2v) 67 (1987) 241–247Fu, H.-L., A note on the ascending subgraph decomposition problem (Note) 84 (1990) 315–318Fu, H.-L. and K.-C. Huang, On prime labellings127(1-3) (1994) 181–186Fu, H.-L. and W.-H. Hu, Disjoint odd integer subsets having a constant odd sum128(1-3) (1994) 143–150Fu, H.-L.,seeB.-L. Chen 132(1-3) (1994) 29–35Fu, H.-L.,seeN.-P. Chiang 141(1-3) (1995) 61–66Fu, H.-L.,seeN.-P. Chiang 175(1-3) (1997) 79–86Fu, H.L., C.C. Lindner and C.A. Rodger, Two Doyen–Wilson theorems for maximum packings with triples178

(1-3) (1998) 63–71Fu, H.-L. and C.C. Lindner, The Doyen–Wilson theorem for maximum packings ofKn with 4-cycles 183(1-3)

(1998) 103–117Fu, H.-L.,seeB.-L. Chen 184(1-3) (1998) 49–60Fu, T.-S., Erdos–Ko–Rado-type results overJq (n,d),Hq(n,d) and their designs 196(1-3) (1999) 137–151Fuglister, F.J., The nonexistence of Moore geometries of diameter 445 (1983) 229–238Fuglister, F.J., On generalized Moore geometries, I67 (1987) 249–258Fuglister, F.J., On generalized Moore geometries, II67 (1987) 259–269Fuji-Hara, R. and S.A. Vanstone, Orthogonal resolutions of lines in AG(n, q) 41 (1982) 17–28Fuji-Hara, R., S. Kuriki and M. Jimbo, On balanced complementation for regulart-wise balanced designs76

(1989) 29–35Fuji-Hara, R. and S. Kuriki, Mutually balanced nested designs97 (1991) 167–176Fujikoshi, Y., Two-way ANOVA models with unbalanced data116(1993) 315–334Fujishige, S., A decomposition of distributive lattices55 (1985) 35–55Fujishige, S.,seeK. Ando 148(1-3) (1996) 299–303Fujita, H.,seeA. Odaka 14 (1976) 269–271Fukuchi, Y., Graph labelings in elementary abelian groups189(1-3) (1998) 117–122Fukuda, K.,seeR. Cordovil 89 (1991) 161–171Fukuda, K. and K. Handa, Antipodal graphs and oriented matroids111(1993) 245–256Fukuda, K.,seeM. Deza 119(1993) 21–48Fukuda, T.,seeY. Egawa 58 (1986) 93–95Fulman, J., A generalization of Vizing’s theorem on domination (Note) 126(1994) 403–406Fulmek, M. and C. Krattenthaler, A bijection between Proctor’s and Sundaram’s odd orthogonal tableaux161

(1-3) (1996) 101–120Fulmek, M., Dual rook polynomials 177(1-3) (1997) 67–81Fulton, J.D., Generalized inverses of matrices over a finite field21 (1978) 23–29Füredi, Z.,seeP. Frankl 34 (1981) 311–313Füredi, Z., Set-systems with prescribed cardinalities for pairwise intersections40 (1982) 53–67Füredi, Z., On finite set-systems whose every intersection is a kernel of a star (Communication) 47 (1983)

129–132Füredi, Z.,seeP. Frankl 48 (1984) 205–212


Füredi, Z.,seeP. Frankl 50 (1984) 323–328Füredi, Z. and Zs. Tuza, Hypergraphs without a large star (Note) 55 (1985) 317–321Füredi, Z.,seeP. Erdös 59 (1986) 21–34Füredi, Z.,seeR.P. Anstee 62 (1986) 225–243Füredi, Z., J.R. Griggs, A.M. Odlyzko and J.B. Shearer, Ramsey–Sperner theory63 (1987) 143–152Füredi, Z. and I.G. Rosenberg, Multicolored lines in a finite geometry71 (1988) 149–163Füredi, Z., A projective plane is an outstanding 2-cover (Communication) 74 (1989) 321–324Füredi, Z., Covering the complete graph by partitions75 (1989) 217–226Füredi, Z., J. Kahn and D.J. Kleitman, Sphere coverings of the hypercube with incomparable centers (Note) 83

(1990) 129–134Füredi, Z.,seeP. Frankl 90 (1991) 103–107Füredi, Z.,seeP. Erdos 98 (1991) 95–104Füredi, Z., Indecomposable regular graphs and hypergraphs101(1992) 59–64Füredi, Z. and P. Hajnal, Davenport–Schinzel theory of matrices103(1992) 233–251Füredi, Z.,seeP. Erdos 111(1993) 189–196Füredi, Z., Random Ramsey graphs for the four-cycle (Note) 126(1994) 407–410Füredi, Z., Intersecting designs from linear programming and graphs of diameter two127(1-3) (1994) 187–207Fürer, M.,seeG.J. Chang 199(1-3) (1999) 11–25Furino, S., Difference families from rings97 (1991) 177–190Furstenberg, H. and Y. Katznelson, A density version of the Hales–Jewett theorem fork = 3 75(1989) 227–241Fzouquet, J.-L., V. Giakoumakis, F. Maire and H. Thuillier, On graphs withoutP5 andP5 146 (1-3) (1995)

33–44Gabor, G.,seeS. Foldes 24 (1978) 103–104Gabow, H.N., Algorithmic proofs of two relations between connectivity and the 1-factors of a graph26 (1979)

33–40Gagliardi, C., Cobordant crystallizations45 (1983) 61–73Gagnon, L.,seeG. Fournier 130(1-3) (1994) 69–76Gaillard, A.,seeM. Cochand 110(1992) 61–80Galagain, D., Sur une majoration du nombre de groupes definis par generateurs et ayant une seule relation67

(1987) 15–26Galeana-Sánchez, H., A counterexample to a conjecture of meyniel on kernel-perfect graphs (Communication)

41 (1982) 105–107Galeana-Sánchez, H. and V. Neumann-Lara, On kernels and semikernels of digraphs48 (1984) 67–76Galeana-Sánchez, H., A theorem about a conjecture of H. Meyniel on kernel-perfect graphs59 (1986) 35–41Galeana-Sánchez, H. and V. Neumann-Lara, On kernel-perfect critical digraphs59 (1986) 257–265Galeana-Sánchez, H., A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Communi-

cation) 69 (1988) 207–209Galeana-Sánchez, H., On the existence of(k, l)-kernels in digraphs (Note) 85 (1990) 99–102Galeana-Sánchez, H. and V. Neumann-Lara, Orientations of graphs in kernel theory87 (1991) 271–280Galeana-Sánchez, H. and V. Neumann-Lara, Extending kernel perfect digraphs to kernel perfect critical digraphs

94 (1991) 181–187Galeana-Sánchez, H., On the existence of kernels andh-kernels in directed graphs (Communication) 110(1992)

251–255Galeana-Sánchez, H., Normal fraternally orientable graphs satisfy the strong perfect graph conjecture122

(1993) 167–177Galeana-Sánchez, H.,B1- andB2-orientable graphs in kernel theory143(1-3) (1995) 269–274Galeana-Sánchez, H. and H.A. Rincón-Mejía, Independent sets which meet all longest paths152 (1-3) (1996)

141–145Galeana-Sánchez, H., On monochromatic paths and monochromatic cycles in edge coloured tournaments156

(1-3) (1996) 103–112Galeana-Sánchez, H., A characterization of normal fraternally orientable perfect graphs169(1-3) (1997) 221–

225Galeana-Sánchez, H. and X. Li, Kernels in a special class of digraphs178(1-3) (1998) 73–80Galeana-Sánchez, H., Kernels in edge-colored digraphs184(1-3) (1998) 87–99Gallai, T.,seeP. Erdos 108(1992) 279–289


Gallai, T.,seeP. Erdos 150(1-3) (1996) 89–101Gallant, R. and C.J. Colbourn, Tight 4-factor orthogonal main effect plans184(1-3) (1998) 101–110Gallant, S., On the group and the circuit group of a graph (Note) 6 (1973) 101–103Gallian, J.A. and D.J. Rusin, Cyclotomic polynomials and nonstandard dice27 (1979) 245–259Gallian, J.A.,seeD. Witte 43 (1983) 297–307Gallian, J.A.,seeD. Witte 51 (1984) 293–304Gallian, J.A.,seeS.J. Curran 156(1-3) (1996) 1–18Gallivan, S., E.R. Lockeberg and P. Mcmullen, Complete subgraphs of the graphs of convex polytopes34(1981)

25–29Galluccio, A.,seeC. De Simone 131(1-3) (1994) 67–79Galovich, J. and D. White, Recursive statistics on words157(1-3) (1996) 169–191Galvin, F., G. Hesse and K. Steffens, On the number of automorphisms of structures24 (1978) 161–166Galvin, F.,seeP. Erdos 87 (1991) 261–269Galvin, F.,seeP. Erdos 113(1993) 59–70Gamble, B.,seeE.J. Cockayne 58 (1986) 221–227Gangopadhyay, T. and S.P. Rao Hebbare, Paths inr-partite self-complementary graphs32 (1980) 229–244Gangopadhyay, T. and S.P. Rao Hebbare,r-partite self-complementary graphs — Diameters32(1980) 245–255Gangopadhyay, T., Characterisation of potentially bipartite self-complementary bipartitioned sequences38

(1982) 173–184Gangopadhyay, T., Packing graphs in their complements186(1-3) (1998) 117–124Gani, J., A note on a stochastic model for the incubation of transfusion-associated AIDS92 (1991) 89–94Gannon, D.,seeD. Barnette 16 (1976) 291–298Gansner, E.R., On the equality of two plane partition correspondences30 (1980) 121–132Gansner, E.R., On the lattice of order ideals of an up-down poset39 (1982) 113–122Ganter, B., Finite partial quadruple systems can be finitely embedded (Note) 10 (1974) 397–400Ganter, B., G. Häfner and W. Poguntke, On linear extensions of ordered sets with a symmetry63 (1987) 153–

156Ganter, B. and H.-D.O.F. Gronau, Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions

88 (1991) 149–155Gao, B., D.-Z. Du and R.L. Graham, A tight lower bound for the Steiner ratio in Minkowski planes142 (1-3)

(1995) 49–63Gao, G. and X. Zhu, Star-extremal graphs and the lexicographic product152(1-3) (1996) 147–156Gao, G.-G., On consecutive numbers of the same height in the Collatz problem (Note) 112(1993) 261–267Gao, G.-G. and G. Hahn, Minimal graphs that fold ontoKn 142(1-3) (1995) 277–280Gao, S. and W. Wei, On non-Abelian group difference sets112(1993) 93–102Gao, S.,seeW.-D. Wei 123(1993) 151–177Gao, W.,seeF. Li 137(1-3) (1995) 371–376Gao, W., An addition theorem for finite cyclic groups163(1-3) (1997) 257–265Gao, W., On the number of zero sum subsequences163(1-3) (1997) 267–273Gao, W., On the number of subsequences with given sum195(1-3) (1999) 127–138Gao, Z., The number of degree restricted maps on general surfaces123(1993) 47–63Gao, Z. and X. Yu, Tutte cycles in circuit graphs182(1-3) (1998) 113–124Garcia, C. and P. Solé, Diameter lower bounds for Waring graphs and multiloop networks111(1993) 257–261Garcia, C.,seeF. Aguiló 167-168(1-3) (1997) 3–16Gardiner, A., Almost rank three graphs103(1992) 253–257Gardiner, A., Distance-transitive antipodal covers: the extremal case134(1-3) (1994) 63–64Gardiner, A.D., C.D. Godsil, A.D. Hensel and G.F. Royle, Second neighbourhoods of strongly regular graphs

103(1992) 161–170Gardner, M.L., Forbidden configurations in intersection graphs ofr-graphs (Note) 31 (1980) 85–88Gardner, M.L., Hypergraphs and Whitney’s theorem on edge-isomorphisms of graphs51 (1984) 1–9Gardner, R., B. Micale, M. Pennisi and R. Zijlstra, Cyclic and rotational hybrid triple systems171(1-3) (1997)

121–139Gardner, R., B. Micale, M. Pennisi and R. Zijlstra, Cyclic and rotational hybrid triple systems175(1-3) (1997)

143–161Gardner, R.B.,seeR. Calahan-Zijlstra 128(1-3) (1994) 35–44


Gardner, R.B., Steiner triple systems with transrotational automorphisms131(1-3) (1994) 99–104Gardy, D., Some results on the asymptotic behaviour of coefficients of large powers of functions139 (1-3)

(1995) 189–217Garey, M.R., Optimal task sequencing with precedence constraints4 (1973) 37–56Garey, M.R.,seeM. Edelberg 14 (1976) 23–39Garner, L.E., On heights in the Collatz 3n+ 1 problem 55 (1985) 57–64Garoche, F. and M. Leonard, On a class of boolean functions with matroid property (Communication) 49(1984)

323–325Garriga, E.,seeM.A. Fiol 167-168(1-3) (1997) 297–307Garriga, E.,seeM.A. Fiol 182(1-3) (1998) 101–111Garsia, A.M.,seeN. Bergeron 99 (1992) 3–15Garsia, A.M., Orthogonality of Milne’s polynomials and raising operators99 (1992) 247–264Garsia, A.M. and M. Haiman, Factorizations of Pieri rules for Macdonald polynomials139 (1-3) (1995) 219–

256Gasharov, V., Incomparability graphs of (3+1)-free posets ares-positive 157(1-3) (1996) 193–197Gasparian, G.,seeS. Markossian 178(1-3) (1998) 137–153Gasse, E., A proof of a circle graph characterization173(1-3) (1997) 277–283Gassman, L.D.,seeR.C. Entringer 10 (1974) 43–55Gates, W.H. and C.H. Papadimitriou, Bounds for sorting by prefix reversal27 (1979) 47–57Gavlas, H.,seeG. Chartrand 147(1-3) (1995) 73–86Gavlas, H.,seeE. Dobson 189(1-3) (1998) 69–78Gavril, F., A recognition algorithm for the intersection graphs of directed paths in directed trees13 (1975)

237–249Gavril, F., Algorithms on clique separable graphs19 (1977) 159–165Gavril, F., A recognition algorithm for the intersection graphs of paths in trees23 (1978) 211–227Gehrke, M. and E. Walker, Iterating conditionals and symmetric Stone algebras148(1-3) (1996) 49–63Gehrlein, W.V.,seeP.C. Fishburn 79 (1989/90) 259–264Geist, J.M.,seeJ.L. Massey 3 (1972) 163–175Geldenhuys, G.,seeW.F.D. Theron 178(1-3) (1998) 213–220Gelfand, I.,seeA.V. Borovik 179(1-3) (1998) 59–72Gelfand, I.M.,seeT.V. Alekseyevskaya 180(1-3) (1998) 23–44Geller, D.P., Generalization of a theorem of Fleck, Hedetniemi and Oehmke onS∗-semigroups of automata8

(1974) 345–349Geller, D.P., Walkwise and admissible mappings between digraphs9 (1974) 375–390Geller, D.P.,r-tuple colorings of uniquely colorable graphs16 (1976) 9–12Geller, M.M., M.A. Harrison and I.M. Havel, Normal forms of deterministic grammars16 (1976) 313–321Gennero, M.C. and O. Papini, Utilization of error correcting codes for data transmission simulations56 (1985)

155–168Geoffroy, D.P., Nuclei for totally point determining graphs21 (1978) 145–162Geoffroy, D.P., On 1-factors of point determining graphs24 (1978) 167–175George, O.T.,seeM.R. Sridharan 41 (1982) 101–104Georges, J.P., D.W. Mauro and M.A. Whittlesey, Relating path coverings to vertex labellings with a condition at

distance two 135(1-3) (1994) 103–111Georgescu, G.,seeA. Filipoiu 161(1-3) (1996) 87–100Gerards, A.M.H. and F.B. Shepherd, Strong orientations without even directed circuits188 (1-3) (1998) 111–

125Geréb-Graus, M., An extremal theorem on divisors of a number46 (1983) 241–248Gergely, E., A remark on doubly diagonalized orthogonal Latin squares (Note) 10 (1974) 185–188Gerl, P., Natural spanning trees ofZd are recurrent (Note) 61 (1986) 333–336Gerlits, J., A. Hajnal and Z. Szentmiklóssy, On the cardinality of certain Hausdorff spaces108(1992) 31–35Germa, A.,seeD. Amar 46 (1983) 327Germa, A.,seeD. Amar 89 (1991) 111–131Germina, K.A.,seeS. Arumugam 161(1-3) (1996) 285–289Gernert, D., Inequalities between the domination number and the chromatic number of a graph (Communication)

76 (1989) 151–153


Geroldinger, A. and R. Schneider, The cross number of finite abelian groups III150(1-3) (1996) 123–130Gerth III, F., Some probabilities for eigenvalues of matrices with entries in finite fields154 (1-3) (1996) 269–

275Gervacio, S.,seeK. Ando 82 (1990) 7–11Gervacio, S.,seeK. Ando 150(1-3) (1996) 403–406Gervacio, S.V., Score sequences: Lexicographic enumeration and tournament construction72 (1988) 151–155Gervacio, S.V.,seeE.B. Arugay 151(1-3) (1996) 49–53Gervacio, S.V., Trees with diameter less than 5 and non-singular complement151(1-3) (1996) 91–97Gessel, I.M., Aq-analog of the exponential formula40 (1982) 69–80Gessel, I.M., Some generalized durfee square identities49 (1984) 41–44Gessel, I.M., Enumerative applications of a decomposition for graphs and digraphs139(1-3) (1995) 257–271Gessel, I.M., Counting acyclic digraphs by sources and sinks160(1-3) (1996) 253–258Geyer, W., On Tamari lattices133(1-3) (1994) 99–122Ghier, L.,seeA. Bouchet 161(1-3) (1996) 25–44Ghinelli, D.,seeA. Del Fra 105(1992) 13–23Ghinelli, D.,seeA.D. Fra 129(1-3) (1994) 53–74Ghorpade, S.R.,seeS.S. Abhyankar 96 (1991) 1–32Giakoumakis, V.,seeJ.-L. Fzouquet 146(1-3) (1995) 33–44Giakoumakis, V.,seeJ.-L. Fouquet 165-166(1-3) (1997) 267–290Giakoumakis, V., F. Roussel and H. Thuillier, Scattering number and modular decomposition165-166(1-3)

(1997) 311–332Giakoumakis, V., On the closure of graphs under substitution177(1-3) (1997) 83–97Gibbons, P.B. and E. Mendelsohn, The construction of antipodal triple systems by simulated annealing155

(1-3) (1996) 59–76Gibbs, R.A. and P.J. Slater, Distinct distance sets in a graph93 (1991) 155–165Gibson, P. and R. Maltby, Posets in which every cutset meets every fibre194(1-3) (1999) 107–127Gierz, G. and F. Hergert, The bandwidth problem for distributive lattices of breadth 388 (1991) 157–177Gierz, G., Level sets in finite distributive lattices of breadth 3132(1-3) (1994) 51–63Gil, J., W. Steiger and A. Wigderson, Geometric medians108(1992) 37–51Gilbert, G.T.,seeJ. Berenbom 175(1-3) (1997) 23–33Gilbey, J.D. and L.H. Kalikow, Parking functions, valet functions and priority queues197-198(1-3) (1999)

351–373Giles, R. and D. Hausmann, Characterizations of adjacency on the branching polyhedron26 (1979) 219–226Giles, R. and R. Kannan, A characterization of threshold matroids (Note) 30 (1980) 181–184Giles, W.B., On reconstructing maximal outerplanar graphs8 (1974) 169–172Giles, W.B., Reconstructing trees from two point deleted subtrees15 (1976) 325–332Gill, M.K. and G.A. Patwardhan, Switching invariant two-path signed graphs61 (1986) 189–196Gill, P.S., A note on constructions of symmetrical PBIB designs (Note) 51 (1984) 305–307Gill, R., The number of elements in a generalized partition semilattice186(1-3) (1998) 125–134Gillett, S.,seeD.W. Barnette 195(1-3) (1999) 239–243Gilpin, M. and R. Shelton, Predicates whose maximal length functions increase periodically84 (1990) 15–21Gimbel, J.,seeD. Skrien 55 (1985) 213–216Gimbel, J., M. Mahéo and C. Virlouvet, Double total domination of graphs165-166(1-3) (1997) 333–341Gimbert, J., On the existence of (d ,k)-digraphs 197-198(1-3) (1999) 375–391Ginocchio, M., On the Hopf algebra of functional graphs and differential algebras183(1-3) (1998) 119–140Ginsburg, J., Extensions of ordered sets having the finite cutset property58 (1986) 143–157Gionfriddo, M. and C.C. Lindner, Construction of Steiner quadruple systems having a prescribed number of

blocks in common 34 (1981) 31–42Gionfriddo, M., On the setJ(v) for Steiner Quadruple Systems of orderv = 2n with n> 4 44 (1983) 155–160Gionfriddo, M. and S. Milici, On the parameterv2(h) for L2-coloured graphs (Note) 68 (1988) 107–110Gionfriddo, M., F. Milazzo and V. Vacirca, Transitive multipermutation graphs: case 46 n 6 m 97 (1991)

191–198Gionfriddo, M. and G. Lo Faro, 2-Colourings inS(t, t + 1, v) 111(1993) 263–268Gionfriddo, M. and Z. Tuza, On conjectures of Berge and Chvátal124(1994) 79–86Gionfriddo, M. and S. Milici, A result concerning two conjectures of Berge and Chvátal155(1-3) (1996) 77–79


Gionfriddo, M., F. Harary and Z. Tuza, The color cost of a caterpillar174(1-3) (1997) 125–130Giorgio Spera, A., Transitive extensions of imprimitive groups155(1-3) (1996) 233–241Giraud, G., Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des arêtes dun-emble 16 (1976) 13–38

Giraud, G.R., Remarques sur deux problemes extremaux (Note) 84 (1990) 319–321Gire, S.,seeS. Dulucq 153(1-3) (1996) 85–103Gire, S.,seeS. Dulucq 187(1-3) (1998) 71–96Giudici, R.E.,seeP.M. Salzberg 58 (1986) 285–294Giudici, R.E.,seeP. Berrizbeitia 149(1-3) (1996) 11–18Givant, S., Possible cardinalities of irredundant bases for finite closure structures12 (1975) 201–204Glebov, N.I. and A.V. Kostochka, On the independent domination number of graphs with given minimum degree

188(1-3) (1998) 261–266Glover, F., Convexity cuts for multiple choice problems6 (1973) 221–234Glover, F., First facets of the octahedron9 (1974) 109–117Glover, H. and J.P. Huneke, Graphs with bounded valency that do not embed in the projective plane18 (1977)

155–165Glover, H. and J.P. Huneke, The set of irreducible graphs for the projective plane is finite22 (1978) 243–256Glover, H.H. and J.P. Huneke, Cubic irreducible graphs for the projective plane13 (1975) 341–355Glover, H.H. and T.Y. Yang, A Hamilton cycle in the Cayley graph of the〈2,p,3〉 presentation of PSL2(p) 160

(1-3) (1996) 149–163Gluck, D., A note on permutation polynomials and finite geometries (Note) 80 (1990) 97–100Glynn, D.G.,seeL.R.A. Casse 48 (1984) 173–186Glynn, D.G., The non-classical 10-arc of PG(4,9) 59 (1986) 43–51Göbel, F., J.O. Cerdeira and H.J. Veldman, Label-connected graphs and the gossip problem87 (1991) 29–40Göbel, F.,seeH.J. Broersma 118(1993) 23–31Göbel, F.,seeT. Böhme 170(1-3) (1997) 219–222Godbole, A.P., L.K. Potter and E.J. Sandquist, Sign-balanced covering matrices190(1-3) (1998) 79–93Goddard, W., Acyclic colorings of planar graphs (Note) 91 (1991) 91–94Goddard, W. and D.J. Kleitman, An upper bound for the Ramsey numbersr(K3,G) 125(1994) 177–182Goddard, W., O.R. Oellermann and H.C. Swart, Steiner distance stable graphs132(1-3) (1994) 65–73Goddard, W., Mistilings with dominoes137(1-3) (1995) 361–365Goddard, W. and H.C. Swart, Distances between graphs under edge operations161(1-3) (1996) 121–132Goddard, W., M.D. Plummer and H.C. Swart, Maximum and minimum toughness of graphs of small genus

167-168(1-3) (1997) 329–339Goddard, W. and M.A. Henning, Real and integer domination in graphs199(1-3) (1999) 61–75Goddard, W.D.,seeL.W. Beineke 125(1994) 45–54Godlewski, P., WOM-codes construits à partir des codes de Hamming65 (1987) 237–243Godsil, C.D., More odd graph theory (Communication) 32 (1980) 205–207Godsil, C.D., Polynomial spaces73 (1988/89) 71–88Godsil, C.D.,seeA.D. Gardiner 103(1992) 161–170Goecke, O. and R. Schrader, Minor characterization of undirected branching greedoids – A short proof (Note)

82 (1990) 93–99Goemans, M.X., A generalization of Petersen’s theorem (Note) 115(1993) 277–282Goethals, J.M. and S.L. Snover, Nearly perfect binary codes3 (1972) 65–88Goethals, J.M. and J.J. Seidel, The regular two-graph on 276 vertices12 (1975) 143–158Goethals, J.M.,seeP. Delsarte 12 (1975) 211–224Goh, B.H.,seeK.M. Koh 82 (1990) 13–24Goldbach, R.W. and H.L. Claasen, Feasibility conditions for non-symmetric 3-class association schemes159

(1-3) (1996) 111–118Goldman, A.J.,seeA.G. Robinson 80 (1990) 297–312Goldman, A.J.,seeA.G. Robinson 84 (1990) 261–283Goldman, A.J.,seeA.G. Robinson 90 (1991) 153–167Goldman, A.J.,seeA.G. Robinson 112(1993) 173–184Goldreich, O., On the number of monochromatic close pairs of beads in a rosary80 (1990) 59–68


Goldsmith, D.L. and A.T. White, On graphs with equal edge-connectivity and minimum degree23 (1978) 31–36

Goldstein, R.Z. and E.C. Turner, Counting orbits of a product of permutations80 (1990) 267–272Goldstern, M., R. Grossberg and M. Kojman, Infinite homogeneous bipartite graphs with unequal sides149

(1-3) (1996) 69–82Goldstine, J., A simplified proof of Parikh’s theorem19 (1977) 235–239Goldwasser, J.L.,seeR.A. Brualdi 48 (1984) 1–21Goldwasser, J.L., Permanent of the Laplacian matrix of trees with a given matching61 (1986) 197–212Goldwurm, M.,seeC. Choffrut 194(1-3) (1999) 239–247Golemac, A., Construction of new symmetric designs with parameters (70, 24, 8)120(1993) 51–58Goles, E. and J. Olivos, Periodic behaviour of generalized threshold functions (Communication) 30 (1980)

187–189Golomb, S.W., Probability, information theory, and prime number theory106/107(1992) 219–229Golumbic, M.C., Trivially perfect graphs (Note) 24 (1978) 105–107Golumbic, M.C. and Y. Perl, Generalized Fibonacci maximum path graphs28 (1979) 237–245Golumbic, M.C., D. Rotem and J. Urrutia, Comparability graphs and intersection graphs43 (1983) 37–46Golumbic, M.C.,seeM.A. Buckingham 44 (1983) 45–54Golumbic, M.C., Interval graphs and related topics55 (1985) 113–121Golumbic, M.C. and R.E. Jamison, Edge and vertex intersection of paths in a tree55 (1985) 151–159Golumbic, M.C.,seeA. Belfer 114(1993) 23–39Gómez, J., M.A. Fiol and O. Serra, On large (1,D)-graphs 114(1993) 219–235Gondran, M., Remarque sur le polytope des couplages d’Edmonds9 (1974) 235–238Gondran, M., Les elementsp-reguliers dans les dioïdes25 (1979) 33–39Good, I.J. and J.F. Crook, The enumeration of arrays and a generalization related to contingency tables19

(1977) 23–45Goodey, P.R. and M. Rosenfeld, Hamiltonian circuits in prisms over certain simple 3-polytopes21 (1978) 229–

235Goodman, A.W., Triangles in a complete chromatic graph with three colors57 (1985) 225–235Goodman, J.E., Proof of a conjecture of Burr, Grünbaum, and Sloane32 (1980) 27–35Gordon, B. and L. Houten, Notes on plane partitions VI26 (1979) 41–45Gordon, B., Tilings of lattice points in Euclideann-space 29 (1980) 169–174Gordon, D., Minimal determining sets of locally finitely-determined functionals29 (1980) 175–190Gordon, D.M., R.W. Robinson and F. Harary, Minimum degree games for graphs128(1-3) (1994) 151–163Gordon, G., Matroids overFp which are rational excluded minors49 (1984) 51–65Gordon, G. and L. Traldi, Generalized activities and the Tutte polynomial85 (1990) 167–176Gordon, G. and E. McDonnell, Trees with the same degree sequence and path numbers147(1-3) (1995) 297–

300Gordon, G., Series–parallel posets and the Tutte polynomial158(1-3) (1996) 63–75Gorgol, I., On bounds for size Ramsey numbers of a complete tripartite graph164(1-3) (1997) 149–153Gotoh, S.,seeS. Ueno 72 (1988) 355–360Gould, F.J. and J.W. Tolle, A unified approach to complementarity in optimization7 (1974) 225–271Gould, R.J., On line graphs and the hamiltonian index34 (1981) 111–117Gould, R.J. and M.S. Jacobson, Forbidden subgraphs and hamiltonian properties of graphs42 (1982) 189–196Gould, R.J. and R. Roth, Cayley digraphs and(1, j, n)-sequencings of the alternating groupsAn 66 (1987)

91–102Gould, R.J.,seeR.J. Faudree 91 (1991) 33–43Gould, R.J.,seeR.J. Faudree 103(1992) 17–24Gould, R.J.,seeR.J. Faudree 105(1992) 61–71Gould, R.J. and V. Rödl, On isomorphic subgraphs (Note) 118(1993) 259–262Gould, R.J.,seeR.J. Faudree 141(1-3) (1995) 109–122Gould, R.J.,seeR.J. Faudree 150(1-3) (1996) 103–113Gould, R.J.,seeR.J. Faudree 173(1-3) (1997) 45–60Gould, R.J. and J.M. Harris, Traceability in graphs with forbidden triples of subgraphs189 (1-3) (1998) 123–

132Gould, R.J.,seeG. Chen 197-198(1-3) (1999) 185–194


Goulden, I.P. and D.M. Jackson, The enumeration of generalised alternating subsets with congruences22(1978)99–104

Goulden, I.P.,seeC.B. Collins 36 (1981) 139–153Goulden, I.P., A bijective proof of theq-Saalschütz theorem57 (1985) 39–44Goulden, I.P., A linear operator for symmetric functions and tableaux in a strip with given trace99(1992) 69–77Goulden, I.P. and S. Pepper, Labelled trees and factorizations of a cycle into transpositions (Note) 113 (1993)

263–268Goulden, I.P., D.M. Jackson and C.M. Springer, An umbral relation between pattern and commutation in strings

158(1-3) (1996) 77–85Goulet, J.,seeB. Courteau 56 (1985) 133–139Goupil, A., On products of conjugacy classes of the symmetric group (Invited paper) 79 (1989/90) 49–57Goupil, A., Reflection decompositions in the classical Weyl groups137(1-3) (1995) 195–209Gourdon, X. and B. Salvy, Effective asymptotics of linear recurrences with rational coefficients153 (1-3)

(1996) 145–163Gourdon, X. and H. Prodinger, A generating function approach to random subgraphs of then-cycle 169 (1-3)

(1997) 227–232Gourdon, X., Largest component in random combinatorial structures180(1-3) (1998) 185–209Grabiner, D.J., Posets in which every interval is a product of chains, and natural local actions of the symmetric

group 199(1-3) (1999) 77–84Grable, D.A., Hypergraphs and sharpened sieve inequalities132(1-3) (1994) 75–82Grable, D.A.,seeD. Archdeacon 142(1-3) (1995) 21–37Grabner, P.J., R.F. Tichy and U.T. Zimmermann, Inequalities for the gamma function with applications to

permanents 154(1-3) (1996) 53–62Grady, M.,seeJ. Bevis 186(1-3) (1998) 25–38Gräf, A., Distance graphs and theT -coloring problem 196(1-3) (1999) 153–166Graham, R.,seeP. Diaconis 106/107(1992) 181–188Graham, R.,seeF. Chung 110(1992) 43–59Graham, R.L., D.E. Knuth and T.S. Motzkin, Complements and transitive closures2 (1972) 17–29Graham, R.L.,seeM. Edelberg 14 (1976) 23–39Graham, R.L., A.C.-C. Yao and F.-F. Yao, Addition chains with multiplicative cost23 (1978) 115–119Graham, R.L.,seeV. Chvátal 26 (1979) 83–92Graham, R.L.,seeF.R.K. Chung 111(1993) 125–129Graham, R.L., Recent trends in Euclidean Ramsey theory136(1-3) (1994) 119–127Graham, R.L.,seeB. Gao 142(1-3) (1995) 49–63Graham, R.L.,seeP.-J. Wan 171(1-3) (1997) 261–275Graham, R.L., B.D. Lubachevsky, K.J. Nurmela and P.R.J. Östergård, Dense packings of congruent circles in a

circle 181(1-3) (1998) 139–154Grams, G.,seeD. Jungnickel 58 (1986) 199–203Grannell, M.J. and T.S. Griggs, A cyclic Steiner quadruple system of order 32 (Note) 38 (1982) 109–111Grannell, M.J., T.S. Griggs and J.S. Phelan, On infinite Steiner systems97 (1991) 199–202Grannell, M.J. and T.S. Griggs, A Steiner systemS(5,6,108) 125(1994) 183–186Grannell, M.J., T.S. Griggs and J.S. Phelan, Continuity of Mendelsohn and Steiner triple systems138 (1-3)

(1995) 247–253Grannell, M.J., T.S. Griggs and J.P. Murphy, Twin Steiner triple systems167-168(1-3) (1997) 341–352Granot, F.,seeA. Charnes 11 (1975) 233–248Granot, F. and M. Penn, On the integral 4-packing ofT -cuts 142(1-3) (1995) 65–75Grant, D.D.,seeK.L. McAvaney 9 (1974) 277–288Grant, D.D.,seeC.H.C. Little 13 (1975) 41–54Grant, D.D., A generalisation of the diameter of a graph (Note) 90 (1991) 321–324Granville, A., On a paper of Agur, Fraenkel and Klein (Note) 94 (1991) 147–151Grasselli, L.,seeM.R. Casali 87 (1991) 9–22Grasselli, L. and S. Piccarreta, Tetrahedron manifolds via coloured graphs182(1-3) (1998) 125–137Grassl, R.M. and A.P. Hillman, Functions on tableau frames25 (1979) 245–255Grassl, R.M. and A.P. Mullhaupt, Hook and shifted hook numbers79 (1989/90) 153–167Graver, J.E.,seeJ.K. Doyle 17 (1977) 147–154


Graves, J.S.,seeR.A. Brualdi 147(1-3) (1995) 57–72Graves, W.H., Cohomology of incidence coalgebras10 (1974) 75–92Gravier, S. and A. Khelladi, On the domination number of cross products of graphs145(1-3) (1995) 273–277Gravier, S., A Hajós-like theorem for list coloring152(1-3) (1996) 299–302Gravier, S.,seeH. Ait Haddadene 159(1-3) (1996) 237–240Gravier, S. and F. Maffray, Choice number of 3-colorable elementary graphs165-166(1-3) (1997) 343–348Gravier, S., Hamiltonicity of the cross product of two Hamiltonian graphs170(1-3) (1997) 253–257Gravier, S.,seeH. Aït Haddadène 183(1-3) (1998) 1–16Gravier, S.,seeM. Dror 195(1-3) (1999) 103–109Gray, J.M.,seeC.R. Deeter 10 (1974) 29–42Greco, G., Capacities of graphs and 2-matchings186(1-3) (1998) 135–143Greene, C.,seeE. Bird 11 (1975) 191–198Greene, C. and G.A. Iba, Cayley’s formula for multidimensional trees13 (1975) 1–11Greene, C.,seeS. Fomin 193(1-3) (1998) 179–200Greene, J., Bijections related to statistics on words68 (1988) 15–29Greene, T., Descriptively sufficient subcollections of flats in matroids87 (1991) 149–161Greenough, P.P. and R. Hill, Optimal linear codes over GF(4)125(1994) 187–199Greenwell, D.L. and R.L. Hemminger, Forbidden subgraphs for graphs with planar line graphs2 (1972) 31–34Greenwell, R.N.,seeB.M. Landman 68 (1988) 77–83Greferath, M., Cyclic codes over finite rings177(1-3) (1997) 273–277Gregory, D.A. and N.J. Pullman, On a clique covering problem of Orlin (Note) 41 (1982) 97–99Gregory, D.A., S. McGuinness and W. Wallis, Clique partitions of the cocktail party graph59 (1986) 267–273Greibach, S.A., A generalization of Parikh’s semilinear theorem2 (1972) 347–355Grekos, G.P., Nonexistence of maximal asymptotic union nonbases33 (1981) 267–270Grieser, D., Some results on the complexity of families of sets88 (1991) 179–192Griffel, D.H. and C.A.N. Morris, Complete latin squares of order 2k 145(1-3) (1995) 291–293Griggs, J. and O. Murphy, Edge density and independence ratio in triangle-free graphs with maximum degree

three 152(1-3) (1996) 157–170Griggs, J.G. and J.P. Hutchinson, On ther-domination number of a graph101(1992) 65–72Griggs, J.R. and D.J. Kleitman, A three part Sperner theorem17 (1977) 281–289Griggs, J.R., Extremal values of the interval number of a graph, II28 (1979) 37–47Griggs, J.R.,seeZ. Füredi 63 (1987) 143–152Griggs, J.R., C.M. Grinstead and D.R. Guichard, The number of maximal independent sets in a connected graph

68 (1988) 211–220Griggs, J.R., Problems on chain partitions72 (1988) 157–162Griggs, J.R., Iterated exponentials of two numbers88 (1991) 193–209Griggs, J.R. and M. Wu, Spanning trees in graphs of minimum degree 4 or 5104(1992) 167–183Griggs, J.R. and D.J. Kleitman, Independence and the Havel–Hakimi residue127(1-3) (1994) 209–212Griggs, J.R. and Y.-C. Lin, Planar graphs with few vertices of small degree143(1-3) (1995) 47–70Griggs, J.R., Matchings, cutsets, and chain partitions in graded posets144(1-3) (1995) 33–46Griggs, J.R.,seeR.P. Anstee 156(1-3) (1996) 253–256Griggs, J.R. and Y.-C. Lin, The maximum sum of degrees above a threshold in planar graphs169(1-3) (1997)

233–243Griggs, T.S.,seeM.J. Grannell 38 (1982) 109–111Griggs, T.S.,seeM.J. Grannell 97 (1991) 199–202Griggs, T.S.,seeM.J. Grannell 125(1994) 183–186Griggs, T.S.,seeM.J. Grannell 138(1-3) (1995) 247–253Griggs, T.S.,seeB.E. Brunton 155(1-3) (1996) 19–26Griggs, T.S.,seeM.J. Grannell 167-168(1-3) (1997) 341–352Griggs, T.S. and B.J. Wilson, Distance-regular graphs, MH-colourings and MLD-colourings174 (1-3) (1997)

131–135Grimmett, G.R., An upper bound for the number of spanning trees of a graph16 (1976) 323–324Grimson, R.C., Enumeration of dimer (domino) configurations18 (1977) 167–177Grinstead, C.M., On circular critical graphs51 (1984) 11–24Grinstead, C.M.,seeJ.R. Griggs 68 (1988) 211–220


Grinstead, C.M., B. Hahne and D. Van Stone, On the queen domination problem86 (1990) 21–26Grinstead, D.L. and P.J. Slater, On minimum dominating sets with minimum intersection86 (1990) 239–254Grishukhin, V.,seeM. Deza 165-166(1-3) (1997) 185–190Grishukhin, V.,seeA. Deza 192(1-3) (1998) 41–80Gritzmann, P.,seeU. Betke 58 (1986) 81–85Gritzmann, P. and V. Klee, On the complexity of some basic problems in computational convexity: I. Containment

problems 136(1-3) (1994) 129–174Gröflin, H.,seeM. Cochand 110(1992) 61–80Grommes, R.,seeR. Euler 62 (1986) 155–181Gronau, H.-D.O.F.,seeG.F. Clements 33 (1981) 239–247Gronau, H.-D.O.F., On maximal families of subsets of a finite set34 (1981) 119–130Gronau, H.-D.O.F., Coverings of the complete (di-)graph withn vertices by complete bipartite (di-)graphs withn vertices I 37 (1981) 67–72

Gronau, H.-D.O.F.,seeK. Engel 54 (1985) 153–159Gronau, H.-D.O.F. and R. Labahn, An extremal coloring problem on matrices (Communication) 61 (1986)

321–324Gronau, H.-D.O.F.,seeB. Ganter 88 (1991) 149–155Gronau, H.-D.O.F.,seeH. Brandes 125(1994) 73–86Gronau, H.-D.O.F.,seeG. Burosch 152(1-3) (1996) 69–91Grone, R. and R. Merris, A bound for the complexity of a simple graph (Note) 69 (1988) 97–99Gropp, H., The elementary abelian Steiner systemsS(2,4,49) (Communication) 64 (1987) 87–90Gropp, H., Enumeration of regular graphs 100 years ago101(1992) 73–85Gropp, H., Configurations and graphs111(1993) 269–276Gropp, H., Nonsymmetric configurations with natural index124(1994) 87–98Gropp, H., On symmetric spatial configurations125(1994) 201–209Gropp, H., Configurations and (r ,1)-designs 129(1-3) (1994) 113–137Gropp, H., Graph-like combinatorial structures in (r ,1)-designs 134(1-3) (1994) 65–73Gropp, H., On tactical configurations, regular bipartite graphs, and (v,k,even)-designs 155(1-3) (1996) 81–98Gropp, H., Configurations and graphs — II164(1-3) (1997) 155–163Gropp, H., Blocking set free configurations and their relations to digraphs and hypergraphs165-166(1-3)

(1997) 349–360Gropp, H., Configurations and their realization174(1-3) (1997) 137–151Gropp, H., On configurations and the book of Sainte-Laguë191(1-3) (1998) 91–99Gross, J.L., Voltage graphs9 (1974) 239–246Gross, J.L. and T.W. Tucker, Generating all graph coverings by permutation voltage assignments18 (1977)

273–283Gross, J.L.,seeJ. Chen 128(1-3) (1994) 73–94Gross, J.L. and T.W. Tucker, Stratified graphs for imbedding systems143(1-3) (1995) 71–85Gross, J.L.,seeJ. Chen 149(1-3) (1996) 19–29Gross, J.L.,seeJ. Chen 156(1-3) (1996) 83–102Gross, K.B., Some new classes of strong starters12 (1975) 225–243Gross, K.B.,seeB.A. Anderson 28 (1979) 113–134Grossberg, R.,seeM. Goldstern 149(1-3) (1996) 69–82Grossman, J.W., F. Harary and M. Klawe, Generalized Ramsey theory for graphs, X: Double starts28 (1979)

247–254Grossman, J.W.,seeS.A. Burr 41 (1982) 223–227Grossman, J.W.,seeJ.E. Dunbar 167-168(1-3) (1997) 261–269Grossman, J.W., Dominating sets whose closed stars form spanning trees169(1-3) (1997) 83–94Grötschel, M. and Y. Wakabayashi, On the structure of the monotone asymmetric travelling salesman polytope I:

Hypohamiltonian facets 34 (1981) 43–59Grubb, A.,seeG.E. Nicholson 52 (1984) 235–242Grünbaum, B., Intersecting all edges of centrally symmetric polyhedra by planes5 (1973) 241–246Grünbaum, B. and J. Zaks, The existence of certain planar maps10 (1974) 93–115Grünbaum, B. and G.C. Shephard, Perfect colorings of transitive tilings and patterns in the plane20 (1977)

235–247


Grünbaum, B. and G.C. Shephard, An extension to the catalogue of isonemal fabrics60 (1986) 155–192Gruszka, J.,seeT. Łuczak 148(1-3) (1996) 311–316Grytczuk, J., Infinite self-similar words161(1-3) (1996) 133–141Gu, W.,seeK.B. Reid 101(1992) 231–249Gu, W.,seeK.B. Reid 147(1-3) (1995) 185–196Guan, M., W. Li and Z. Wang, The convex weighting of a graph and an alternative definition of a matroid48

(1984) 77–81Guan, P.,seeS.-y. Choi 117(1993) 275–277Gubser, B.S., Planar graphs with no 6-wheel minor120(1993) 59–73Gudder, S.,seeL. Haskins 2 (1972) 357–382Gudder, S.P. and G.T. Rüttimann, Finite function spaces and measures on hypergraphs68 (1988) 221–244Gudder, S.P. and G.T. Rüttimann, Positive sets in finite linear function spaces68 (1988) 245–255Guelzow, A.J., Representation of finite nilpotent squags154(1-3) (1996) 63–76Guenoche, A., Enumeration des tableaux standards25 (1979) 257–267Guénoche, A., Enumération des partitions de diamètre minimum111(1993) 277–287Guénoche, A.,seeI. Charon 165-166(1-3) (1997) 139–153Guénoche, A., Ordinal properties of tree distances192(1-3) (1998) 103–117Guerra, L. and E. Ughi, On the distribution of Legendre symbols in Galois fields42 (1982) 197–208Guha, S. and S. Padmanabhan, A new derivation of the generating function for the major index (Communication)

81 (1990) 211–215Guibert, O.,seeS. Dulucq 157(1-3) (1996) 91–106Guibert, O.,seeS. Dulucq 180(1-3) (1998) 143–156Guibert, O.,seeS. Dulucq 187(1-3) (1998) 71–96Guichard, D.R.,seeJ.R. Griggs 68 (1988) 211–220Guichard, D.R., Two theorems on the addition of residue classes81 (1990) 11–18Guido, C., A larger class of reconstructible tournaments152(1-3) (1996) 171–184Guiduli, B., On incidence coloring and star arboricity of graphs163(1-3) (1997) 275–278Guiduli, B. and Z. Király, On intersecting hypergraphs182(1-3) (1998) 139–151Gulliver, T.A., Two new optimal ternary two-weight codes and strongly regular graphs149(1-3) (1996) 83–92Gulliver, T.A. and M. Harada, Extremal double circulant Type II codes overZ4 and construction of 5-(24,10,36)

designs 194(1-3) (1999) 129–137Gulliver, T.A.,seeS.T. Dougherty 196(1-3) (1999) 117–135Guo, J.M.,seeE.J. Farrell 89 (1991) 203–210Guo, X.,seeF. Zhang 105(1992) 285–291Guo, X. and F. Zhang,k-Cycle resonant graphs135(1-3) (1994) 113–120Guo, X.-f.,seeF.-j. Zhang 64 (1987) 289–298Guo, X.-f.,seeF.-j. Zhang 72 (1988) 405–415Guo, Y. and L. Volkmann, On complementary cycles in locally semicomplete digraphs135 (1-3) (1994) 121–

127Guo, Y., A. Pinkernell and L. Volkmann, On cycles through a given vertex in multipartite tournaments164(1-3)

(1997) 165–170Guo, Y.,seeJ. Bang-Jensen 167-168(1-3) (1997) 101–114Guo, Y., Path-connectivity in local tournaments167-168(1-3) (1997) 353–372Guo, Z.-Y.,seeC.-Y. Chao 172(1-3) (1997) 9–16Guo, Z.-Y., On T-chromatic uniqueness of graphs172(1-3) (1997) 45–51Guo, Z.-Y. and E.G. Whitehead Jr., Chromaticity of a family ofK4 homeomorphs 172(1-3) (1997) 53–58Gupta, P.,seeB.D. Acharya 195(1-3) (1999) 1–13Gupta, R.P., An edge-coloration theorem for bipartite graphs with applications23 (1978) 229–233Gupta, R.P., J. Kahn and N. Robertson, On the maximum number of diagonals of a circuit in a graph32 (1980)

37–43Gupta, S.,seeR. Mukerjee 91 (1991) 105–108Gurgel, M.A.C.M. and Y. Wakabayashi, Adjacency of vertices of the complete pre-order polytope175 (1-3)

(1997) 163–172Gurvich, V.,seeL. Libkin 145(1-3) (1995) 321–327Gurvich, V.,seeE. Boros 159(1-3) (1996) 35–55


Gurvich, V. and L. Khachiyan, On the frequency of the most frequently occurring variable in dual monotoneDNFs 169(1-3) (1997) 245–248

Gurvich, V.,seeA. Apartsin 178(1-3) (1998) 229–231Gurvich, V.,seeE. Boros 179(1-3) (1998) 231–233Gustav Meyer, P.J., On the structure of orthomodular posets9 (1974) 119–146Gutierrez, M. and L. Oubiña, Minimum proper interval graphs142(1-3) (1995) 77–85Gutin, G.,seeJ. Bang-Jensen 138(1-3) (1995) 63–74Gutin, G., Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs141

(1-3) (1995) 153–162Gutin, G.,seeJ. Bang-Jensen 161(1-3) (1996) 1–12Gutin, G.,seeJ. Bang-Jensen 162(1-3) (1996) 1–11Gutin, G.,seeJ. Bang-Jensen 163(1-3) (1997) 217–223Gutin, G.,seeJ. Bang-Jensen 164(1-3) (1997) 5–19Gutin, G.,seeJ. Bang-Jensen 165-166(1-3) (1997) 39–60Gutin, G.,seeJ. Bang-Jensen 167-168(1-3) (1997) 101–114Gutin, G., A note on the cardinality of certain classes of unlabeled multipartite tournaments186 (1-3) (1998)

277–280Gutin, G.,seeJ. Bang-Jensen 188(1-3) (1998) 61–72Gutin, G. and V.E. Zverovich, Upper domination and upper irredundance perfect graphs190 (1-3) (1998) 95–

105Gutin, G., B. Sudakov and A. Yeo, Note on alternating directed cycles191(1-3) (1998) 101–107Gutman, I.,seeM.M. Petrovic 126(1994) 239–244Gutman, I.,seeY.-N. Yeh 135(1-3) (1994) 359–365Gutman, I. and A. Ivic, On Matula numbers 150(1-3) (1996) 131–142Gutner, S., The complexity of planar graph choosability159(1-3) (1996) 119–130Guy, R.K. and A. Hill, The crossing number of the complement of a circuit5 (1973) 335–344Gvozdjak, P. and J. Nešetril, High girth and extendability 154(1-3) (1996) 77–84Gvozdjak, P., On the Oberwolfach problem for complete multigraphs173(1-3) (1997) 61–69Gyárfás, A., A note on hypergraphs with the Helly-property (Note) 24 (1978) 221–223Gyárfás, A., Still another triangle-free infinite-chromatic graph (Note) 30 (1980) 185Gyárfás, A., E. Szemeredi and Zs. Tuza, Induced subtrees in graphs of large chromatic number30 (1980) 235–

244Gyárfás, A., J. Lehel and Zs. Tuza, The structure of rectangle families dividing the plane into maximum number

of atoms 52 (1984) 177–198Gyárfás, A., On the chromatic number of multiple interval graphs and overlap graphs55 (1985) 161–166Gyárfás, A. and J. Lehel, Covering and coloring problems for relatives of intervals55 (1985) 167–180Gyárfás, A. and Z. Tuza, An upper bound on the Ramsey number of trees (Note) 66 (1987) 309–310Gyárfás, A., M.S. Jacobson and L.F. Kinch, On a generalization of transitivity for digraphs69 (1988) 35–41Gyárfás, A., J. Lehel and Zs. Tuza, Clumsy packing of dominoes71 (1988) 33–46Gyárfas, A., The irregularity strength ofKm,m is 4 for oddm (Note) 71 (1988) 273–274Gyárfas, A.,seeR.J. Faudree 78 (1989) 83–87Gyárfás, A.,seeF.R.K. Chung 81 (1990) 129–135Gyárfás, A., A simple lower bound on edge coverings by cliques (Note) 85 (1990) 103–104Gyárfás, A., Graphs withk odd cycle lengths 103(1992) 41–48Gyárfás, A.,seeR.J. Faudree 126(1994) 121–135Gyárfás, A.,seeP. Erdos 154(1-3) (1996) 263–268Gyárfás, A., Z. Király and J. Lehel, On-line 3-chromatic graphs — II Critical graphs177(1-3) (1997) 99–122Gyárfás, A.,seeP. Erdos 177(1-3) (1997) 267–271Gyárfás, A.,seeG. Chen 191(1-3) (1998) 65–82Gyárfás, A.,seeP. Erdos 200(1-3) (1999) 79–86Györi, E., On the structures induced by bipartite graphs and infinite matroids22 (1978) 257–261Györi, E. and E.C. Milner, A theorem of the transversal theory for matroids of finite character23 (1978) 235–

240Györi, E. and M.D. Plummer, The Cartesian product of ak-extendable and anl-extendable graph is(k + l+ 1)-

extendable 101(1992) 87–96


Györi, E., A.V. Kostochka and T. Łuczak, Graphs without short odd cycles are nearly bipartite163(1-3) (1997)279–284

Györi, E.,C6-free bipartite graphs and product representation of squares165-166(1-3) (1997) 361–365Haas, R.,seeM.O. Albertson 148(1-3) (1996) 1–7Haas, R.,seeM.O. Albertson 177(1-3) (1997) 1–8Habib, M.,seeM. Chein 37 (1981) 35–50Habib, M. and B. Peroche, Some problems about linear arboricity (Communication) 41 (1982) 219–220Habib, M.,seeJ.C. Bermond 52 (1984) 123–132Habib, M. and M.C. Maurer, 1-intersecting families53 (1985) 91–101Habib, M. and R.H. Möhring, On some complexity properties ofN-free posets and posets with bounded

decomposition diameter63 (1987) 157–182Habib, M., D. Kelly and R.H. Möhring, Interval dimension is a comparability invariant88 (1991) 211–229Habib, M., M. Morvan and J.-X. Rampon, On the calculation of transitive reduction–closure of orders111

(1993) 289–303Habsieger, L., Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité

115(1993) 167–174Habsieger, L.,seeM. Bousquet-Mélou 139(1-3) (1995) 57–72Habsieger, L., Binary codes with covering radius one: Some new lower bounds176(1-3) (1997) 115–130Hachenberger, D. and D. Jungnickel, Translation nets: a survey106/107(1992) 231–242Haddad, L. and H. Zhou, Star chromatic numbers of hypergraphs and partial Steiner triple systems146 (1-3)

(1995) 45–58Haddadène, H.A. and F. Maffray, Coloring perfect degenerate graphs163(1-3) (1997) 211–215Hadjiat, M. and J.F. Maurras, A strongly polynomial algorithm for the minimum cost tension problem165-166

(1-3) (1997) 367–384Haemers, W.H.,seeA.E. Brouwer 106/107(1992) 77–82Haemers, W.H.,seeA.E. Brouwer 106/107(1992) 83–92Haemers, W.H.,seeE.R. van Dam 182(1-3) (1998) 293–307Haemers, W.H., Minimum resolvable coverings with small parallel classes197-198(1-3) (1999) 393–396Häfner, G.,seeB. Ganter 63 (1987) 153–156Hagauer, J.,seeF. Aurenhammer 109(1992) 3–12Hagauer, J. and S. Klavžar, Clique-gated graphs161(1-3) (1996) 143–149Hager, M., On Halin-lattices in graphs47 (1983) 235–246Hager, M., On score sets for tournaments58 (1986) 25–34Hager, M., Path-connectivity in graphs59 (1986) 53–59Haggard, G., The least number of edges for graphs having dihedral automorphism group6 (1973) 53–78Haggard, G., D. McCarthy and A. Wohlgemuth, Extremal edge problems for graphs with given hyperoctahedral

automorphism group 14 (1976) 139–156Haggard, G. and T.R. Mathies, The computation of chromatic polynomials199(1-3) (1999) 227–231Häggkvist, R.,seeL. Caccetta 28 (1979) 223–229Häggkvist, R. and C. Thomassen, Circuits through specified edges41 (1982) 29–34Häggkvist, R., P.-O. Lindberg and B. Lindström, Dissecting a square into rectangles of equal area (Note) 47

(1983) 321–323Häggkvist, R., On the path-complete bipartite Ramsey number75 (1989) 243–245Häggkvist, R., Towards a solution of the Dinitz problem?75 (1989) 247–251Häggkvist, R., A note on latin squares with restricted support75 (1989) 253–254Häggkvist, R. and J.C.M. Janssen, All-even latin squares157(1-3) (1996) 199–206Hahn, G., More star sub-ramsey numbers34 (1981) 131–139Hahn, G., D. Sotteau and H. Sun, Short cycles in mediate graphs44 (1983) 281–284Hahn, G.,seeC. Delorme 49 (1984) 261–266Hahn, G. and C. Thomassen, Path and cycle sub-Ramsey numbers and an edge-colouring conjecture62 (1986)

29–33Hahn, G. and B. Jackson, A note concerning paths and independence number in digraphs (Note) 82 (1990)

327–329Hahn, G.,seeG.-G. Gao 142(1-3) (1995) 277–280Hahn, S.G.,seeJ.K. Kim 187(1-3) (1998) 291–295


Hahne, B.,seeC.M. Grinstead 86 (1990) 21–26Haile, D.,seeL.H. Clark 171(1-3) (1997) 287–293Haiman, M.,seeA.M. Garsia 139(1-3) (1995) 219–256Haiman, M.,t, q-Catalan numbers and the Hilbert scheme193(1-3) (1998) 201–224Haiman, M.D., Dual equivalence with applications, including a conjecture of Proctor99 (1992) 79–113Haiman, M.D. and D. Kim, A characterization of generalized staircases99 (1992) 115–122Hajiabolhassan, H., M.L. Mehrabadi, R. Tusserkani and M. Zaker, A characterization of uniquely vertex colorable

graphs using minimal defining sets199(1-3) (1999) 233–236Hajnal, A.,seeP. Erdös 53 (1985) 281–285Hajnal, A.,seeP. Erdös 59 (1986) 21–34Hajnal, A. and N. Sauer, Complete subgraphs of infinite multipartite graphs and antichains in partially ordered

sets 59 (1986) 61–67Hajnal, A.,seeP. Erdos 75 (1989) 145–154Hajnal, A.,seeJ. Gerlits 108(1992) 31–35Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders117(1993) 113–125Hajnal, P.,seeZ. Füredi 103(1992) 233–251Haken, W.,seeK. Appel 16 (1976) 179–180Hakimi, S.L.,seeA.N. Patrinos 15 (1976) 347–358Hakimi, S.L., J. Mitchem and E. Schmeichel, Star arboricity of graphs149(1-3) (1996) 93–98Halbeisen, L. and N. Hungerbühler, The general counterfeit coin problem147(1-3) (1995) 139–150Hale Jr., M.P.,seeD.A. Drake 8 (1974) 257–268Halin, R., A note on infinite triangulated graphs (Note) 31 (1980) 325–326Halin, R., Bounded graphs95 (1991) 91–99Halin, R., Tree-partitions of infinite graphs97 (1991) 203–217Halin, R., Some finiteness results concerning separation in graphs101(1992) 97–106Hall, J.I., A.J.E.M. Jansen, A.W.J. Kolen and J.H. Van Lint, Equidistant codes with distance 1217(1977) 71–83Hall, J.I., Bounds for equidistant codes and partial projective planes17 (1977) 85–94Hall, J.I., Local indecomposability of certain geometric graphs106/107(1992) 243–254Hall, R.R.,seeP. Erdos 200(1-3) (1999) 87–94Hall, T.E. and M.V. Sapir, Idempotents, regular elements and sequences from finite semigroups161(1-3) (1996)

151–160Halperin, E.,seeN. Alon 181(1-3) (1998) 19–29Halsey, M.,seeP. Dolan 112(1993) 259–260Halsey, M.D., Line-closed combinatorial geometries65 (1987) 245–248Halsey, M.D., Extensions of line-closed combinatorial geometries82 (1990) 259–262Hamada, N. and M. Deza, Characterization of{2(q + 1)+ 2,2; t, q}-min · hypers in PG(t, q) (t ≥ 3, q ≥ 5) and

its applications to error-correcting codes71 (1988) 219–231Hamada, 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 geometry77 (1989) 75–87Hamada, N. and M. Deza, A characterization of{2vα+1 + 2vβ+1,2vα + 2vβ ; t, q}-minihypers in PG(t, q)

(t > 2, q > 5 and 06 α < β < t) and its applications to error-correcting codes93 (1991) 19–33Hamada, N. and T. Helleseth, A characterization of some{2vα+1 + vγ+1,2vα + vγ ; k − 1,3}-minihypers and

some(n, k,3k−1−2·3α −3γ ;3)-codes(k > 3,06 α < γ < k−1)meeting the Griesmer bound104(1992)67–81

Hamada, N., T. Helleseth and Ø. Ytrehus, Characterization of{2(q + 1) + 2,2; t, q}-minihypers in PG(t, q)(t > 3, q ∈ {3,4}) 115(1993) 175–185

Hamada, N., A characterization of some[n, k, d;q]-codes meeting the Griesmer bound using a minihyper in afinite projective geometry 116(1993) 229–268

Hamada, N. and T. Helleseth, A characterization of some{3vµ+1, 3vµ ; k − 1, q}-minihypers and some

[n, k, qk−1 − 3qµ;q]-codes (k ≥ 3, q ≥ 5, 16 µ < k − 1) meeting the Griesmer bound146 (1-3) (1995)59–67

Hamada, T. and I. Yoshimura, Traversability and connectivity of the middle graph of a graph14(1976) 247–255Hamada, T.,seeJ. Akiyama 26 (1979) 203–208Hamburger, P.,seeK.B. Chilakamarri 118(1993) 253–257Hamburger, P.,seeL.W. Beineke 125(1994) 45–54


Hamburger, P.,seeL.W. Beineke 160(1-3) (1996) 41–47Hamidoune, Y.,seeP. Duchet 46 (1983) 319–321Hamidoune, Y.O., Sur les parcours hamiltoniens dans les graphes orientes26 (1979) 227–234Hamidoune, Y.O., On the decomposition of a minimally stronglyh-connected digraph intoh + 1 acircuitic

subgraphs (Note) 31 (1980) 89–90Hamidoune, Y.O., A property ofα-fragments of a digraph (Communication) 31 (1980) 105–106Hamidoune, Y.O., On criticallyh-connected simple graphs32 (1980) 257–262Hamidoune, Y.O., On a conjecture of Entringer and Slater (Note) 41 (1982) 323–326Hamidoune, Y.O., Sur la separation dans les graphes de Cayley abeliens (Note) 55 (1985) 323–326Hamidoune, Y.O. and M. Las Vergnas, A solution to the box game65 (1987) 157–171Hamidoune, Y.O.,seeP. Duchet 65 (1987) 231–235Hamidoune, Y.O. and M. Las Vergnas, A solution to the Misère Shannon Switching Game72 (1988) 163–166Hamidoune, Y.O., Sur les atomes d’un graphe de Cayley infini (Communication) 73 (1989) 297–300Hamidoune, Y.O., Connectivite des graphes de Cayley abeliens sansK4 83 (1990) 21–26Hamidoune, Y.O., On a subgroup contained in some words with a bounded length103(1992) 171–176Hamidoune, Y.O., A.S. Lladó and O. Serra, Small cutsets in quasiminimal Cayley graphs159 (1-3) (1996)

131–142Hamidoune, Y.O., On weighted sums in abelian groups162(1-3) (1996) 127–132Hamidoune, Y.O. and M.L. Vergnas, Directed switching games II The Arborescence Game165-166 (1-3)

(1997) 385–392Hamilton, G.M. and D.G. Rogers, Further results on irregular, critical perfect systems of difference sets I: split

systems 102(1992) 25–45Hamilton, G.M., C. Ramsay, I.T. Roberts and D.G. Rogers, Uniform perfect systems of sets of iterated differences

of size 4 162(1-3) (1996) 133–150Hamm, R.C.,seeD.G. Sarvate 92 (1991) 321–328Hammer, J. and D.G. Sarvate, Generalizations of results of Stanton on BIBDs102(1992) 149–154Hammer, P.L.,seeC. Benzaken 55 (1985) 123–127Hammer, P.L.,seeC. Benzaken 56 (1985) 7–34Hammer, P.L.,seeE. Boros 75 (1989) 81–88Hammer, P.L., N.V.R. Mahadev and U.N. Peled, Bipartite bithreshold graphs119(1993) 79–96Hammer, P.L.,seeP.C. Fishburn 160(1-3) (1996) 127–148Hammer, P.L.,seeG. Ding 165-166(1-3) (1997) 201–207Hammond, P., Nearly perfect codes in distance-regular graphs14 (1976) 41–56Hammond, P., On the non-existence of perfect and nearly perfect codes (Note) 39 (1982) 105–109Han, Z.-Y.,seeP.A. Catlin 160(1-3) (1996) 81–91Hanani, H., D.K. Ray-Chaudhuri and R.M. Wilson, On resolvable designs3 (1972) 343–357Hanani, H., Balanced incomplete block designs and related designs11 (1975) 255–369Hanani, H.,seeA.E. Brouwer 20 (1977) 1–10Hanani, H., A. Hartman and E.S. Kramer, On three-designs of small order45 (1983) 75–97Hanani, H., On the original Steiner systems (Note) 51 (1984) 309–310Hanani, H., BIBD’s with block-size seven77 (1989) 89–96Handa, B.R. and S.G. Mohanty, Higher dimensional lattice paths with diagonal steps15 (1976) 137–140Handa, B.R. and S.G. Mohanty, Enumeration of higher-dimensional paths under restrictions26(1979) 119–128Handa, B.R. and S.G. Mohanty, On the distribution in a graph process (Note) 50 (1984) 319–322Handa, K.,seeK. Fukuda 111(1993) 245–256Hanlon, P., The enumeration of bipartite graphs28 (1979) 49–57Hanlon, P., A Markov chain on the symmetric group and Jack symmetric functions99 (1992) 123–140Hannák, L.,seeA. Békéssy 30 (1980) 83–88Hansel, G., Baionnettes et cardinaux (Note) 39 (1982) 331–335Hansen, D.J., An axiomatic characterization of multilattices (Note) 33 (1981) 99–101Hansen, P. and M. Lorea, Degrees and independent sets of hypergraphs14 (1976) 305–309Hansen, P. and J. Kuplinsky, The smallest hard-to-color graph96 (1991) 199–212Hansen, P., A. Hertz and J. Kuplinsky, Bounded vertex colorings of graphs111(1993) 305–312Hansen, P. and M. Zheng, A linear algorithm for perfect matching in hexagonal systems122(1993) 179–196Hansen, P., A. Hertz and N. Quinodoz, Splitting trees165-166(1-3) (1997) 393–409


Hansen, P., F. Zhang and M. Zheng, Perfect matchings and ears in elementary bipartite graphs176(1-3) (1997)131–138

Hansen, P.,seeO. du Merle 194(1-3) (1999) 229–237Hanson, D.,seeH.L. Abbott 8 (1974) 1–12Hanson, D.,seeH.L. Abbott 12 (1975) 389–392Hanson, D., Sum-free sets and Ramsey numbers14 (1976) 57–61Hanson, D.,seeH.L. Abbott 17 (1977) 121–126Hanson, D. and J. Hanson, Sum-free sets and Ramsey numbers II (Note) 20 (1977) 295–296Hanson, D., A quick proof thatK10 6= P +P + P 101(1992) 107–108Hanson, D., P. Wang and L.K. Jørgensen, On cages with given degree sets101(1992) 109–114Hanson, J.,seeD. Hanson 20 (1977) 295–296Hansoul, G., Algebres de Boole primitives53 (1985) 103–116Harada, M., T. Aaron Gulliver and H. Kaneta, Classification of extremal double-circulant self-dual codes of length

up to 62 188(1-3) (1998) 127–136Harada, M.,seeT.A. Gulliver 194(1-3) (1999) 129–137Harada, M.,seeS.T. Dougherty 196(1-3) (1999) 117–135Harant, J., Toughness and nonhamiltonicity of polyhedral graphs (Communication) 113(1993) 249–253Harant, J., An upper bound for the radius of a 3-connected graph (Communication) 122(1993) 335–341Harant, J. and P.J. Owens, Non-hamiltonian5

4-tough maximal planar graphs147(1-3) (1995) 301–305Harant, J., P.J. Owens, M. Tkác and H. Walther, 5-regular 3-polytopal graphs with edges of only two types and

shortness exponents less than one150(1-3) (1996) 143–153Harant, J., A lower bound on the independence number of a graph188(1-3) (1998) 239–243Harant, J.,seeT. Böhme 191(1-3) (1998) 25–30Harant, J.,seeT. Böhme 191(1-3) (1998) 31–43Harary, F. and P.A. Ostrand, The cutting center theorem for trees1 (1971) 7–18Harary, F., M.J. Piff and D.J.A. Welsh, On the automorphism group of a matroid2 (1972) 163–171Harary, F. and A.J. Schwenk, The number of caterpillars6 (1973) 359–365Harary, F., E.M. Palmer and R.C. Read, On the cell-growth problem for arbitrary polygons11 (1975) 371–389Harary, F. and H.J. Kommel, The graphs with only self-dual signings26 (1979) 235–241Harary, F.,seeJ.W. Grossman 28 (1979) 247–254Harary, F.,seeG. Exoo 29 (1980) 25–32Harary, F.,seeA.K. Dewdney 33 (1981) 149–162Harary, F.,seeT. Asano 38 (1982) 1–6Harary, F., R.A. Melter, U.N. Peled and I. Tomescu, Boolean distance for graphs39 (1982) 123–127Harary, F.,seeD. Bauer 47 (1983) 153–161Harary, F., S. Lawrencenko and V. Korzhik, Realizing the chromatic numbers of triangulations of surfaces122

(1993) 197–204Harary, F., Sum graphs over all the integers124(1994) 99–105Harary, F.,seeD.M. Gordon 128(1-3) (1994) 151–163Harary, F. and T.A. McKee, The square of a chordal graph128(1-3) (1994) 165–172Harary, F.,seeC. Barefoot 138(1-3) (1995) 93–99Harary, F. and T.W. Haynes, Nordhaus–Gaddum inequalities for domination in graphs155(1-3) (1996) 99–105Harary, F.,seeM. Gionfriddo 174(1-3) (1997) 125–130Harary, F.,seeG. Chartrand 197-198(1-3) (1999) 179–183Harborth, H. and I. Mengersen, Point sets with many unit circles60 (1986) 193–197Harborth, H.,seeK. Dehnhardt 73 (1988/89) 65–70Harborth, H., P. Oertel and T. Prellberg, No-three-in-line for seventeen and nineteen73 (1988/89) 89–90Harborth, H. and I. Mengersen, All Ramsey numbers for five vertices and seven or eight edges73 (1988/89)

91–98Harborth, H., Plane four-regular graphs with vertex-to-vertex unit triangles97 (1991) 219–222Harborth, H.,seeH. Brandes 125(1994) 73–86Harborth, H., Empty triangles in drawings of the complete graph191(1-3) (1998) 109–111Harborth, H. and S. Maasberg, All two-color Rado numbers fora(x+y)=bz 197-198(1-3) (1999) 397–407Harcos, G.,seeP. Erdos 200(1-3) (1999) 95–99Hardin, R.H. and N.J.A. Sloane, New spherical 4-designs106/107(1992) 255–264


Hare, D.,seeB. Alspach 97 (1991) 17–24Hare, D.R., Cycles in the block-intersection graph of pairwise balanced designs137(1-3) (1995) 211–221Hare, D.R.,seeH.L. Abbott 182(1-3) (1998) 3–11Hare, D.R.,seeH.L. Abbott 197-198(1-3) (1999) 3–13Harju, T.,seeA. Ehrenfeucht 128(1-3) (1994) 113–141Harju, T.,seeA. Ehrenfeucht 190(1-3) (1998) 259–264Harkat-Benhamdine, A.,seeM. El Kadi Abderrezzak 165-166(1-3) (1997) 11–20Harper, L.H., On a problem of Kleitman and West93 (1991) 169–182Harris, J.M.,seeR.J. Gould 189(1-3) (1998) 123–132Harris Jr., F.C.,seeJ.E. Dunbar 138(1-3) (1995) 229–246Harrison, M.A.,seeR.V. Book 9 (1974) 329–332Harrison, M.A.,seeM.M. Geller 16 (1976) 313–321Hart, M.R. and X. Yu, On a problem of Hendry (Note) 102(1992) 107–108Hart, S., A note on the edges of then-cube 14 (1976) 157–163Hartfiel, D.J. and C.J. Maxson, The chainable matrix, a special combinatorial matrix12 (1975) 245–256Hartfiel, D.J. and C.J. Maxson, Algebraic models for two-edge-connected graphs15 (1976) 141–150Hartfiel, D.J. and C.J. Maxson, A note on two conjectures of Geller16 (1976) 325–328Hartfiel, D.J. and C.J. Maxson, Groups which are isomorphic to a semigroup of a linear nonsingular subautomaton

22 (1978) 105–109Hartfiel, D.J. and C.J. Maxson, The construction and decomposition of patterns induced by a positive cone of

functions 34 (1981) 261–274Hartfiel, D.J., Stochastic eigenvectors for qualitative stochastic matrices43 (1983) 191–197Hartman, A., Quadruple systems containing AG(3,2) 39 (1982) 293–299Hartman, A.,seeH. Hanani 45 (1983) 75–97Hartman, A., On small packing and covering designs with block size 459 (1986) 275–281Hartman, A., Partial triple systems and edge colourings62 (1986) 183–196Hartman, A.,seeA.M. Assaf 77 (1989) 5–20Hartman, A.,seeA.M. Assaf 79 (1989/90) 111–121Hartman, A.,seeC.J. Colbourn 97 (1991) 119–137Hartman, A.,seeA.M. Assaf 103(1992) 121–128Hartman, A. and Z. Yehudai, Intersections of Steiner quadruple systems104(1992) 227–244Hartman, A., The fundamental construction for 3-designs124(1994) 107–132Hartman, I.B.-A., Variations on the Gallai–Milgram theorem71 (1988) 95–105Hartman, I.B.-A., I. Newman and R. Ziv, On grid intersection graphs87 (1991) 41–52Hartman, I.B.-A.,seeS. Bellantoni 114(1993) 41–49Hartman, J., The homeomorphic embedding ofKn in them-cube 16 (1976) 157–160Hartmann, M. and M.H. Schneider, Max-balanced flows in oriented matroids137(1-3) (1995) 223–240Hartnell, B.,seeA. Finbow 125(1994) 153–167Hartnell, B.L.,seeE.J. Cockayne 21 (1978) 129–136Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs92 (1991) 95–105Hartnell, B.L. and D.F. Rall, Bounds on the bondage number of a graph128(1-3) (1994) 173–177Hartnell, B.L. and D.F. Rall, A bound on the size of a graph with given order and bondage number197-198

(1-3) (1999) 409–413Hartsfield, N., The toroidal splitting number of the complete graphKn 62 (1986) 35–47Hartsfield, N., B. Jackson and G. Ringel, Hamilton surfaces for the complete even symmetric bipartite graph78

(1989) 89–94Hartsfield, N. and G. Ringel, Quadrangular embeddings of the complete evenk-partite graph 81 (1990) 19–23Hartsfield, N. and W.F. Smyth, A family of sparse graphs of large sum number141(1-3) (1995) 163–171Hartvigsen, D. and R. Mardon, Cycle bases from orderings and coverings94 (1991) 81–94Hartvigsen, D., Generalizing the all-pairs min cut problem147(1-3) (1995) 151–169Hartwig, R.E.,seeS.B. Morris 15 (1976) 333–346Harzheim, E., Combinatorial theorems on contractive mappings in power sets40 (1982) 193–201Harzheim, E., A constructive proof for a theorem on contractive mappings in power sets45 (1983) 99–106Harzheim, E., Weakly arithmetic progressions in sets of natural numbers (Note) 89 (1991) 105–107Harzheim, E., On weakly arithmetic progressions138(1-3) (1995) 255–260


Hasan, Z., Intersection of the Steiner systems ofM24 78 (1989) 267–289Hasan, Z., Behavior of steiner systems ofM24 85 (1990) 257–279Haskins, L. and S. Gudder, Height on posets and graphs2 (1972) 357–382Hasratian, A.S. and N.K. Khachatrian, Stable properties of graphs90 (1991) 143–152Hassin, R.,seeE.M. Arkin 190(1-3) (1998) 55–65Hatcher, R.L.,seeJ. Berenbom 175(1-3) (1997) 23–33Hattingh, J.H.,seeI. Broere 138(1-3) (1995) 125–135Hattingh, J.H.,seeJ.E. Dunbar 167-168(1-3) (1997) 261–269Hattingh, J.H. and E. Ungerer, Minusk-subdomination in graphs II 171(1-3) (1997) 141–151Hattingh, J.H.,seeE.J. Cockayne 176(1-3) (1997) 43–61Hattingh, J.H. and E. Ungerer, The signed and minusk-subdomination numbers of comets183 (1-3) (1998)

141–152Hattingh, J.H. and M.A. Henning, Star-path bipartite Ramsey numbers185(1-3) (1998) 255–258Hauge, E.R., On the cycles and adjacencies in the complementary circulating register145(1-3) (1995) 105–132Hauge, E.R. and J. Mykkeltveit, On the classification of deBruijn sequences148(1-3) (1996) 65–83Hauge, E.R. and T. Helleseth, De Bruijn sequences, irreducible codes and cyclotomy159(1-3) (1996) 143–154Hauge, E.R. and J. Mykkeltveit, The analysis of De Bruijn sequences of non-extremal weight189(1-3) (1998)

133–147Haukkanen, P., An abstract Möbius inversion formula with number-theoretic applications142(1-3) (1995) 87–

96Hausmann, D. and B. Korte, Lower bounds on the worst-case complexity of some oracle algorithms24 (1978)

261–276Hausmann, D.,seeR. Giles 26 (1979) 219–226Hausmann, D., Adjacent vertices on theb-matching polyhedron 33 (1981) 37–51Haussler, D., Another generalization of Higman’s well quasi order result on6∗ 57 (1985) 237–243Haussler, D.,seeH. Edelsbrunner 60 (1986) 139–146Haussler, D.,seeE. Knill 141(1-3) (1995) 185–194Havel, I.,seeG. Burosch 110(1992) 9–16Havel, I.,seeT. Dvorák 171(1-3) (1997) 89–102Havel, I.M.,seeM.M. Geller 16 (1976) 313–321Haviland, J. and A. Thomason, Pseudo-random hypergraphs75 (1989) 255–278Haviland, J., On minimum maximal independent sets of a graph94 (1991) 95–101Haviland, J. and A. Thomason, On testing the ‘pseudo-randomness’ of a hypergraph (Note) 103(1992) 321–327Haviland, J., Independent domination in regular graphs143(1-3) (1995) 275–280Havlicek, H., Affine circle geometry over quaternion skew fields174(1-3) (1997) 153–165Haxell, P.E., Atoms of set systems with a fixed number of pairwise unions150(1-3) (1996) 155–166Haxell, P.E., Packing and covering triangles in graphs195(1-3) (1999) 251–254Hay, L., Convex subsets of 2n and bounded truth-table reducibility21 (1978) 31–46Hayasaka, T.,seeS. Saito 28 (1979) 81–88Hayasaka, T.,seeS. Saito 84 (1990) 63–70Hayasaka, T., S. Saito and D.G. Rogers, Further results on irregular, critical perfect systems of difference sets II:

systems without splits 110(1992) 135–154Haynes, T.W.,seeF. Harary 155(1-3) (1996) 99–105Haynes, T.W.,seeG.H. Fricke 199(1-3) (1999) 221–225Hazan, S. and I.G. Rosenberg, TC-clones maximaux, graphes et relations130(1-3) (1994) 77–82Headley, P.,R-sequenceability andR*-sequenceability of abelian 2-groups131(1-3) (1994) 345–350Hearne, T. and C. Wagner, Minimal covers of finite sets5 (1973) 247–251Heath, J. and A.J.W. Hilton, At mostk-to-1 mappings between graphs, II154(1-3) (1996) 85–102Hechler, S.H., On infinite graphs with a specified number of colorings19 (1977) 241–255Hechler, S.H.,seeP. Erdös 24 (1978) 235–249Heden, O., Maximal partial spreads and two-weight codes62 (1986) 277–293Heden, O., No partial 1-spread of class[0,> 2]d in PG(2d − 1, q) exists (Note) 87 (1991) 215–216Heden, O., On the modularn-queen problem 102(1992) 155–161Heden, O., Maximal partial spreads and the modularn-queen problem 120(1993) 75–91Heden, O., Maximal partial spreads and the modularn-queen problem II 142(1-3) (1995) 97–106


Heden, O., On Bruen chains146(1-3) (1995) 69–96Heden, O., Another Bruen chain188(1-3) (1998) 267Hedetniemi, S.,seeA. Farley 25 (1979) 189–193Hedetniemi, S.,seeR.B. Allan 49 (1984) 7–13Hedetniemi, S.,seeJ. Dunbar 149(1-3) (1996) 311–312Hedetniemi, S.,seeJ. Dunbar 199(1-3) (1999) 35–47Hedetniemi, S.,seeG.H. Fricke 199(1-3) (1999) 221–225Hedetniemi, S.M.,seeJ.E. Dunbar 138(1-3) (1995) 229–246Hedetniemi, S.M.,seeE.J. Cockayne 176(1-3) (1997) 43–61Hedetniemi, S.M.,seeE.J. Cockayne 188(1-3) (1998) 253–260Hedetniemi, S.T.,seeE.J. Cockayne 15 (1976) 213–222Hedetniemi, S.T.,seeE.J. Cockayne 21 (1978) 129–136Hedetniemi, S.T.,seeE.J. Cockayne 72 (1988) 35–47Hedetniemi, S.T.,seeM.O. Albertson 74 (1989) 33–49Hedetniemi, S.T. and R.C. Laskar, Introduction86 (1990) 3–9Hedetniemi, S.T. and R.C. Laskar, Bibliography on domination in graphs and some basic definitions of

domination parameters86 (1990) 257–277Hedetniemi, S.T.,seeJ.E. Dunbar 138(1-3) (1995) 229–246Hedetniemi, S.T.,seeJ.E. Dunbar 167-168(1-3) (1997) 261–269Hedetniemi, S.T.,seeE.J. Cockayne 176(1-3) (1997) 43–61Hedetniemi, S.T.,seeE.J. Cockayne 188(1-3) (1998) 253–260Hedetniemi, S.T.,seeG.H. Fricke 199(1-3) (1999) 221–225Hedlíková, J.,seeH.-J. Bandelt 45 (1983) 1–30Hedman, B., The maximum number of cliques in dense graphs54 (1985) 161–166Hedman, B., Another extremal problem for Turan graphs65 (1987) 173–176Hedrlin, Z.,seeV. Chvatal 3 (1972) 301–304Hegde, M. and M.R. Sridharan, Enumeration of hypergraphs45 (1983) 239–243Hegde, N., R.C. Read and M.R. Sridharan, The enumeration of transitive self-complementary digraphs (Note)

47 (1983) 109–112Hegde, S.M.,seeB.D. Acharya 93 (1991) 123–129Hegyvári, N.,seeB. Bollobás 175(1-3) (1997) 253–257Heijnen, P. and H. van Tilborg, Two observations concerning optimum cyclic burst-correcting codes184 (1-3)

(1998) 111–120Heilmann, O.J., D.J. Kleitman, E.H. Lieb and S. Sherman, Some positive definite functions on sets and their

application to the Ising model1 (1971) 19–27Heim, U., Proper blocking sets in projective spaces174(1-3) (1997) 167–176Heinrich, K. and A.J.W. Hilton, Doubly diagonal orthogonal latin squares46 (1983) 173–182Heinrich, K. and L. Zhu, Existence of orthogonal latin squares with aligned subsquares59 (1986) 69–78Heinrich, K., P. Horák and A. Rosa, On Alspach’s conjecture77 (1989) 97–121Heinrich, K., P. Hell, D.G. Kirkpatrick and G. Liu, A simple existence criterion for(g < f )-factors

(Communication) 85 (1990) 313–317Heinrich, K., L. Wu and L. Zhu, Incomplete self-orthogonal latin squares ISOLS(6m+6,2m) exist for allm 87

(1991) 281–290Heinrich, K., M. Kobayashi and G. Nakamura, Dudeney’s round table problem92 (1991) 107–125Heinrich, K., Simple direct constructions for hybrid triple designs97 (1991) 223–227Hell, P. and A. Rosa, Graph decompositions, handcuffed prisoners and balancedP -designs 2 (1972) 229–252Hell, P. and D.J. Miller, Graph with given achromatic number16 (1976) 195–207Hell, P.,seeJ.A. Bondy 44 (1983) 217–220Hell, P. and D.G. Kirkpatrick, Packings by cliques and by finite families of graphs49 (1984) 45–59Hell, P.,seeK. Heinrich 85 (1990) 313–317Hell, P.,seeJ. Bang-Jensen 92 (1992) 27–44Hell, P. and D.J. Miller, Achromatic numbers and graph operations108(1992) 297–305Hell, P. and J. Nešetril, The core of a graph 109(1992) 117–126Hell, P. and K. Seyffarth, Largest planar graphs of diameter two and fixed maximum degree111(1993) 313–322Hell, P., X. Yu and H. Zhou, Independence ratios of graph powers127(1-3) (1994) 213–220


Hell, P.,seeJ. Bang-Jensen 128(1-3) (1994) 395–398Hell, P. and X. Zhu, Homomorphisms to oriented paths132(1-3) (1994) 107–113Hell, P.,seeJ. Bang-Jensen 138(1-3) (1995) 75–92Hell, P.,seeR.C. Brewster 167-168(1-3) (1997) 145–154Helleseth, T., Some results about the cross-correlation function between two maximal linear sequences16

(1976) 209–232Helleseth, T., T. Kløve and J. Mykkeltveit, The weight distribution of irreducible cyclic codes with block lengthsn1((q

l − 1)/N) 18 (1977) 179–211Helleseth, T., The weight enumerator polynomials of some classes of codes with composite parity-check

polynomials 20 (1977) 21–31Helleseth, T., A note on the cross-correlation function between two binary maximal length linear sequences (Note)

23 (1978) 301–307Helleseth, T., The weight distribution of the coset leaders for some classes of codes with related parity-check

matrices 28 (1979) 161–171Helleseth, T. and H.F. Mattson Jr., On the cosets of the simplex code56 (1985) 169–189Helleseth, T.,seeN. Hamada 104(1992) 67–81Helleseth, T., Projective codes meeting the Griesmer bound106/107(1992) 265–271Helleseth, T.,seeN. Hamada 115(1993) 175–185Helleseth, T. and P.V. Kumar, The weight hierarchy of the Kasami codes145(1-3) (1995) 133–143Helleseth, T.,seeN. Hamada 146(1-3) (1995) 59–67Helleseth, T. and P.V. Kumar, On the weight hierarchy of the semiprimitive codes152(1-3) (1996) 185–190Helleseth, T.,seeE.R. Hauge 159(1-3) (1996) 143–154Helleseth, T., C. Rong and K. Yang, New infinite families of 3-designs from preparata codes overZ4 195(1-3)

(1999) 139–156Hemmeter, J.,seeG. Ebert 93 (1991) 131–142Hemminger, R.L.,seeD.L. Greenwell 2 (1972) 31–34Hemminger, R.L. and B.D. McKay, Integer sequences with proscribed differences and bounded growth rate55

(1985) 255–265Hemminger, R.L. and X. Yu, On 3-connected graphs with contractible edge covers of sizek 101(1992) 115–133Hemminger, R.L.,seeM.N. Ellingham 133(1-3) (1994) 89–98Hendry, G.R.T., Graphs uniquely hamiltonian-connected from a vertex49 (1984) 61–74Hendry, G.R.T., The size of graphs uniquely hamiltonian-connected from a vertex61 (1986) 57–60Hendry, G.R.T., The multiplicity of 1-factors in total graphs70 (1988) 21–25Hendry, G.R.T., Scattering number and extremal non-hamiltonian graphs71 (1988) 165–175Hendry, G.R.T., Extending cycles in graphs85 (1990) 59–72Hendry, G.R.T., An Ore-type sufficient condition for a bipancyclic ordering102(1992) 47–49Hendry, G.R.T., C.J. Knickerbocker, P.F. Lock and M. Sheard, Forbidden subgraphs of graphs uniquely

Hamiltonian-connected from a vertex187(1-3) (1998) 281–290Hendy, M.D., A combinatorial description of the closest tree algorithm for finding evolutionary trees96 (1991)

51–58Henkmann, A.,seeH.-J. Bandelt 145(1-3) (1995) 37–60Henning, M.A. and H.C. Swart, Bounds relating generalized domination parameters120(1993) 93–105Henning, M.A.,seeM. Frick 126(1994) 151–158Henning, M.A.,seeI. Broere 138(1-3) (1995) 125–135Henning, M.A., Irredundance perfect graphs142(1-3) (1995) 107–120Henning, M.A.,seeJ. Dunbar 149(1-3) (1996) 311–312Henning, M.A. and P.J. Slater, Inequalities relating domination parameters incubic graphs158 (1-3) (1996)

87–98Henning, M.A., O.R. Oellermann and H.C. Swart, The diversity of domination161(1-3) (1996) 161–173Henning, M.A., O.R. Oellermann and H.C. Swart, Local edge domination critical graphs161(1-3) (1996) 175–

184Henning, M.A.,seeL.W. Beineke 167-168(1-3) (1997) 127–139Henning, M.A.,seeJ.H. Hattingh 185(1-3) (1998) 255–258Henning, M.A., Packing in trees186(1-3) (1998) 145–155Henning, M.A., Graphs with large restrained domination number197-198(1-3) (1999) 415–429


Henning, M.A.,seeJ. Dunbar 199(1-3) (1999) 35–47Henning, M.A.,seeW. Goddard 199(1-3) (1999) 61–75Henning, M.A.,seeG.H. Fricke 199(1-3) (1999) 221–225Hensel, A.D.,seeA.D. Gardiner 103(1992) 161–170Henstridge, J.D. and C.E. Praeger, Note on primitive permutation groups and a diophantine equation31 (1980)

181–183Hergert, F.,seeG. Gierz 88 (1991) 157–177Hergert, F.B., On the Delsarte–Goethals codes and their formal duals83 (1990) 249–263Hering, F., R.C. Read and G.C. Shephard, The enumeration of stack polytopes and simplicial clusters40 (1982)

203–217Herman, G.T. and J.A. Jackowski, A decision procedure using discrete geometry5 (1973) 131–144Herman, G.T., K.P. Lee, J. van Leeuwen and G. Rozenberg, Characterization of unary developmental languages

6 (1973) 235–247Herman, G.T.,seeR. Aharoni 171(1-3) (1997) 1–16Herman, J.E. and F.R.K. Chung, Some results on hook lengths20 (1977) 33–40Herscovici, D.S. and A.W. Higgins, The pebbling number ofC5×C5 187(1-3) (1998) 123–135Hershkowitz, D., Linear mappings which preserve acyclicity properties of graphs and digraphs and applications

to matrices 64 (1987) 157–190Hertz, A., Quelques utilisations de la struction59 (1986) 79–89Hertz, A. and D. de Werra, Perfectly orderable graphs are quasi-parity graphs: A short proof (Note) 68 (1988)

111–113Hertz, A. and D. de Werra, Connected sequential colorings74 (1989) 51–59Hertz, A., Skeletal graphs—A new class of perfect graphs78 (1989) 291–296Hertz, A., Bipolarizable graphs81 (1990) 25–32Hertz, A.,seeP. Hansen 111(1993) 305–312Hertz, A.,seeP. Hansen 165-166(1-3) (1997) 393–409Hertz, A.,seeD. de Werra 195(1-3) (1999) 93–101Herzog, M. and J. Schönheim, On certain sets of divisors of a number1 (1972) 329–332Hespel, C. and G. Jacob, First steps towards exact algebraic identification180(1-3) (1998) 211–219Hesse, G.,seeF. Galvin 24 (1978) 161–166Heuvers, K.,seeD. Moak 131(1-3) (1994) 195–204Heuvers, K.J.,seeR. Shelton 61 (1986) 107–114Heuvers, K.J. and D.S. Moak, The solution of the Binet–Cauchy functional equation for square matrices88

(1991) 21–32Hevia, H.,seeG. Chartrand 100(1992) 303–311Hevia, H.,seeG. Chartrand 170(1-3) (1997) 63–79Hevia, H.,seeI.J. Dejter 182(1-3) (1998) 69–83Heydemann, M.C.,seeJ.C. Bermond 18 (1977) 235–241Heydemann, M.C., On cycles and paths in digraphs (Communication) 31 (1980) 217–219Heydemann, M.C., Cycles in strong oriented graphs38 (1982) 185–190Heydemann, M.-C., Degrees and cycles in digraphs41 (1982) 241–251Heydemann, M.C. and D. Sotteau, Number of arcs and cycles in digraphs52 (1984) 199–207Heydemann, M.C.,seeO. Favaron 91 (1991) 311–316Hibi, T., H. Narushima, M. Tsuchiya and K.-i. Watanabe, A graph-theoretical characterization of the order

complexes on the 2-sphere72 (1988) 167–174Hibi, T., Some results on Ehrhart polynomials of convex polytopes (Communication) 83 (1990) 119–121Hibi, T., seeN. Terai 157(1-3) (1996) 311–320Higgins, A.W.,seeD.S. Herscovici 187(1-3) (1998) 123–135Higuchi, A., Lattices of closure operators179(1-3) (1998) 267–272Hill, A., seeR.K. Guy 5 (1973) 335–344Hill, R., Caps and codes22 (1978) 111–137Hill, R. and J.P. Karim, Searching with lies: the Ulam problem106/107(1992) 273–283Hill, R., seeP.P. Greenough 125(1994) 187–199Hill, R., seeE. Kolev 197-198(1-3) (1999) 483–489Hillman, A.P.,seeR.M. Grassl 25 (1979) 245–255


Hilton, A.J.W. and S.H. Scott, A further construction of double diagonal orthogonal latin squares7 (1974)111–127

Hilton, A.J.W., Embedding incomplete double diagonal Latin squares12 (1975) 257–268Hilton, A.J.W. and A.D. Keedwell, Further results concerning P-quasigroups and complete graph decompositions

14 (1976) 311–318Hilton, A.J.W.,seeL.D. Andersen 31 (1980) 125–152Hilton, A.J.W.,seeL.D. Andersen 31 (1980) 235–260Hilton, A.J.W.,seeK. Heinrich 46 (1983) 173–182Hilton, A.J.W. and C.A. Rodger, Hamiltonian decompositions of complete regulars-partite graphs 58 (1986)

63–78Hilton, A.J.W., Recent progress on edge-colouring graphs (Communication) 64 (1987) 303–307Hilton, A.J.W. and P.D. Johnson, Reverse class critical multigraphs (Note) 69 (1988) 309–311Hilton, A.J.W., Two conjectures on edge-colouring74 (1989) 61–64Hilton, A.J.W.,seeA.G. Chetwynd 75 (1989) 103–112Hilton, A.J.W., A total-chromatic number analogue of Plantholt’s theorem79 (1989/90) 169–175Hilton, A.J.W.,seeA.G. Chetwynd 97 (1991) 101–117Hilton, A.J.W. and Z. Cheng, The chromatic index of a graph whose core has maximum degree two101(1992)

135–147Hilton, A.J.W., Recent results on the total chromatic number111(1993) 323–331Hilton, A.J.W. and H.R. Hind, The total chromatic number of graphs having large maximum degree117(1993)

127–140Hilton, A.J.W.,seeJ.K. Dugdale 126(1994) 87–98Hilton, A.J.W. and D. de Werra, A sufficient condition for equitable edge-colourings of simple graphs128(1-3)

(1994) 179–201Hilton, A.J.W.,seeJ. Heath 154(1-3) (1996) 85–102Hilton, A.J.W.,seeL.D. Andersen 167-168(1-3) (1997) 17–34Hind, H. and Y. Zhao, Edge colorings of graphs embeddable in a surface of low genus190(1-3) (1998) 107–114Hind, H.R.,seeB. Bollobás 74 (1989) 65–75Hind, H.R.,seeB. Bollobás 87 (1991) 119–131Hind, H.R.,seeA.J.W. Hilton 117(1993) 127–140Hind, H.R., Recent developments in total colouring125(1994) 211–218Hindman, N.,seeP. Erdös 48 (1984) 61–65Hindman, N., On creating sets with large lower density90 (1990) 153–157Hindman, N. and H. Lefmann, Canonical partition relations for (m,p,c)-systems 162(1-3) (1996) 151–174Hine, T.C. and V.C. Mavron, Embeddable transversal designs29 (1980) 191–200Hirschfeld, J., A lower bound for Ramsey’s theorem (Note) 32 (1980) 89–91Hirschfeld, J.W.P. and T. Szönyi, Sets in a finite plane with few intersection numbers and a distinguished point

97 (1991) 229–242Hirschfeld, J.W.P.,seeP.V. Ceccherini 106/107(1992) 117–126Hirschfeld, J.W.P. and G. Kiss, Tangent sets in finite spaces155(1-3) (1996) 107–119Hirschfeld, J.W.P., Complete arcs174(1-3) (1997) 177–184Hirschhorn, M., Calkin’s binomial identity 159(1-3) (1996) 273–278Hirschhorn, M.D., Simple proofs of identities of MacMahon and Jacobi16 (1976) 161–162Hirschhorn, M.D., Ramanujan’s partition congruences131(1-3) (1994) 351–355Hirschhorn, M.D. and J.A. Sellers, On representations of a number as a sum of three squares199 (1-3) (1999)

85–101Hjelmeland, L.,seeH. Brown 7 (1974) 1–30Ho, Y.-S.,seeS.-C. Shee 117(1993) 225–243Ho, Y.-S.,seeS.-C. Shee 151(1-3) (1996) 221–229Hoàng, C.T. and B. Reed, A note on short cycles in digraphs66 (1987) 103–107Hoàng, C.T. and N.V.R. Mahadev, A note on perfect orders74 (1989) 77–84Hoàng, C.T. and B.A. Reed,P4-comparability graphs 74 (1989) 173–200Hoàng, C.T., F. Maffray and M. Preissmann, New properties of perfectly orderable graphs and strongly perfect

graphs 98 (1991) 161–174


Hoàng, C.T., F. Maffray, S. Olariu and M. Preissmann, A charming class of perfectly orderable graphs(Communication) 102(1992) 67–74

Hoàng, C.T. and F. Maffray, On slim graphs, even pairs, and star-cutsets105(1992) 93–102Hoàng, C.T., Hamiltonian degree conditions for tough graphs142(1-3) (1995) 121–139Hoàng, C.T., Some properties of minimal imperfect graphs160(1-3) (1996) 165–175Hoare, M.J.,seeN.L. Biggs 30 (1980) 299–301Hobart, S.,seeD.G. Hoffman 146(1-3) (1995) 97–108

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

2 24

)94 (1991) 103–127

Hobbs, A.M. and J. Mitchem, The entire graph of a bridgeless connected plane graph is hamiltonian16 (1976)233–239

Hobbs, A.M.,seeP. Erdös 42 (1982) 57–61Hobbs, A.M. and E. Schmeichel, On the maximum number of independent edges in cubic graphs (Note) 42

(1982) 317–320Hobbs, A.M., B.A. Bourgeois and J. Kasiraj, Packing trees in complete graphs67 (1987) 27–42Hochberg, M., Restricted Sperner families and s-systems3 (1972) 359–364Hochberg, R., C. McDiarmid and M. Saks, On the bandwidth of triangulated triangles138(1-3) (1995) 261–265Hochstättler, W., M. Loebl and C. Moll, Generating convex polyominoes at random153(1-3) (1996) 165–176Hochstrasser, B., A note on Winkler’s algorithm for factoring a connected graph109(1992) 127–132Hodel, M.J., Enumeration of rectangular arrays of zeros and ones21 (1978) 163–176Hoede, C. and H.J. Veldman, Contraction theorems in Hamiltonian graph theory34 (1981) 61–67Hoede, C., Hand graphs for the maximum clique problem72 (1988) 175–179Hoede, C. and X. Li, Clique polynomials and independent set polynomials of graphs125(1994) 219–228Hofbauer, J., A short proof of the Lagrange–Good formula25 (1979) 135–139Hoffman, A.J., On simple combinatorial optimization problems106/107(1992) 285–289Hoffman, D.G., C.C. Lindner and K.T. Phelps, Blocking sets in designs with block size four II89 (1991) 221–

229Hoffman, D.G.,seeE.J. Billington 92 (1991) 25–37Hoffman, D.G.,seeC.J. Colbourn 97 (1991) 139–148Hoffman, D.G. and P.J. Schellenberg, The existence ofCk -factorizations ofK2n − F 97 (1991) 243–250Hoffman, D.G., S. Hobart and R.C. Mullin, Near subgroups of groups146(1-3) (1995) 97–108Hoffman, D.G. and C.A. Rodger, On the number of edge-disjoint one factors and the existence ofk-factors in

complete multipartite graphs160(1-3) (1996) 177–187Hoffman, D.G.,seeE.J. Billington 179(1-3) (1998) 217–222Hoffman, F.,seeJ.M. Freeman 36 (1981) 247–260Hoffman, I. and A. Soifer, Another six-coloring of the plane150(1-3) (1996) 427–429Hoffman, P., Products of representations of wreath products23 (1978) 37–48Hoffmann, P., Counting maximal cycles in binary matroids162(1-3) (1996) 291–292Hofmeister, M., Isomorphisms and automorphisms of graph coverings98 (1991) 175–183Hofmeister, M., Graph covering projections arising from finite vector spaces over finite fields143(1-3) (1995)

87–97Hoggar, S.G. and I. McFarlane, Faster fractal pictures by finite fields and far rings138(1-3) (1995) 267–280Hoggar, S.G., Weight enumerators of codes derived from polynomial product algorithms167-168(1-3) (1997)

373–391Hoggatt Jr., V.E.,seeK. Alladi 22 (1978) 201–211Hohberg, W., The decomposition of graphs intok-connected components109(1992) 133–145Hoke, K.W. and M.F. Troyon, The struction algorithm for the maximum stable set problem revisited131 (1-3)

(1994) 105–113Ho Kwak, J. and J. Lee, Isomorphism classes of cycle permutation graphs105(1992) 131–142Hollmann, H., Pseudocyclic 3-class association schemes on 28 points52 (1984) 209–224Holroyd, F.C. and W.J.G. Wingate, Cycles in the complement of a tree or other graph55 (1985) 267–282Holroyd, F.C., Reconstructing finite group actions and characters from subgroup information (Note) 110(1992)

283–287Holsztynski, W. and R.F.E. Strube, Paths and circuits in finite groups22 (1978) 263–272Holton, D.A., Two applications of semi-stable graphs4 (1973) 151–158


Holton, D.A.,seeK.L. McAvaney 9 (1974) 277–288Holton, D.A.,seeC.H.C. Little 13 (1975) 41–54Holton, D.A., D. Lou and M.D. Plummer, On the 2-extendability of planar graphs96 (1991) 81–99Holton, D.A.,seeD. Lou 112(1993) 139–150Holton, D.A.,seeR.E.L. Aldred 127(1-3) (1994) 23–29Holyer, I.J. and E.J. Cockayne, On the sum of cardinalities of extremum maximal independent sets26 (1979)

243–246Holzman, R.,seeA. Felzenbaum 117(1993) 107–112Holzmann, W.H. and H. Kharaghani, A D-optimal design of order 150190(1-3) (1998) 265–269Homobono, N. and C. Peyrat, Graphs such that every two edges are contained in a shortest cycle76 (1989)

37–44Homobono, N.,seeJ.-C. Bermond 114(1993) 51–62Hong, S., J.H. Kwak and J. Lee, Regular graph coverings whose covering transformation groups have the

isomorphism extension property148(1-3) (1996) 85–105Hong, Y., Bounds of eigenvalues of graphs123(1993) 65–74Honghui, W. and L. Qiao, On the number of tournaments with prescribed score vector61 (1986) 213–219Honkala, I., All binary codes with covering radius one are subnormal (Note) 94 (1991) 229–232Honkala, I., On lengthening of covering codes106/107(1992) 291–295Honkala, I., On the normality of multiple covering codes125(1994) 229–239Hooker, J.N., Networklike metric spaces68 (1988) 31–43Hopkins, G. and W. Staton, Graphs with unique maximum independent sets57 (1985) 245–251Horák, P.,seeJ. Širán 64 (1987) 263–268Horák, P.,seeK. Heinrich 77 (1989) 97–121Horák, P. and J. Širán, Solution of two problems of P. Erdos concerning Hamiltonian cycles84 (1990) 23–29Horák, P., Extending partial systems of distinct representatives (Note) 91 (1991) 95–98Horák, P. and Z. Tuza, Larges-representable set systems with low maximum degree122(1993) 205–217Horák, P.,seeA. Cerný 167-168(1-3) (1997) 189–196Hornák, M., R. Lauff and R. Soták, On existence of hypergraphs with prescribed edge degree profile146(1-3)

(1995) 109–121Hornák, M.,seeP. Bugata 158(1-3) (1996) 37–47Hornák, M. and S. Jendrol’, On thed-distance face chromatic number of plane graphs164(1-3) (1997) 171–174Hornák, M. and R. Soták, Asymptotic behaviour of the observability ofQn 176(1-3) (1997) 139–148Horng, M.-C.,seeS. Tseng 148(1-3) (1996) 205–216Horton, J.D., On two-factors of bipartite regular graphs41 (1982) 35–41Horton, J.D., The construction of Kotzig factorizations43 (1983) 199–206Horton, J.D., Orthogonal starters in finite abelian groups79 (1989/90) 265–278Horton, J.D., A hyperfactorization of order 8, index 292 (1991) 127–129Horton, J.D. and G.M. Nonay, Self-orthogonal Hamilton path decompositions97 (1991) 251–264Hosono, K.,seeJ. Akiyama 116(1993) 291–298Hosono, K., M. Urabe and M. Watanabe, Topics on line segments and polygons151(1-3) (1996) 99–104Host, L.H.,seeD.W. Bange 159(1-3) (1996) 1–11Host, L.H.,seeD.W. Bange 178(1-3) (1998) 1–14Hotje, H., M. Marchi and S. Pianta, On a class of point-reflection geometries129(1-3) (1994) 139–147Hotje, H., Kinematic mappings of plane affinities155(1-3) (1996) 121–125Hotje, H., A remark on the Beckman/Quarles theorem174(1-3) (1997) 185–186Hou, X.-d., Classification of cosets of the Reed–Muller codeR(m-3,m) 128(1-3) (1994) 203–224Hou, X.-d.,GL(m,2) Acting onR(r ,m)/R(r-1,m) 149(1-3) (1996) 99–122Hou, X.-d., Cubic bent functions189(1-3) (1998) 149–161Hougardy, S., Counterexamples to three conjectures concerning perfect graphs (Communication) 117 (1993)

245–251Hougardy, S., H.J. Prömel and A. Steger, Probabilistically checkable proofs and their consequences for

approximation algorithms 136(1-3) (1994) 175–223Hougardy, S., Even pairs and the strong perfect graph conjecture154(1-3) (1996) 277–278Hougardy, S., Perfect graphs with uniqueP4-structure 165-166(1-3) (1997) 411–420Houten, L.,seeB. Gordon 26 (1979) 41–45


Hovey, M.,A-cordial graphs 93 (1991) 183–194Howard, F.T., A theorem relating potential and bell polynomials39 (1982) 129–143Howard, F.T., Degenerate weighted Stirling numbers57 (1985) 45–58Howard, F.T., Explicit formulas for degenerate Bernoulli numbers162(1-3) (1996) 175–185Howorka, E.,seeD. Cenzer 23 (1978) 105–113Hsiao, M.Y., Incomplete block design codes for ultra high speed computer applications3 (1972) 89–108Hsieh, W.N., Intersection theorems for systems of finite vector spaces12 (1975) 1–16Hsu, D.F.,seeD.-Z. Du 87 (1991) 23–28Hsu, D.F. and T. Łuczak, On thek-diameter ofk-regulark-connected graphs133(1-3) (1994) 291–296Hsu, D.F.,seeD.Z. Du 151(1-3) (1996) 81–85Hsu, F. and L.C. Hsu, A unified treatment of a class of combinatorial sums (Note) 90 (1991) 191–197Hsu, L.C.,seeF. Hsu 90 (1991) 191–197Hsu, L.C.,seeW. Chu 123(1993) 3–15Hsu, L.-H., On a multiplicative graph function conjecture45 (1983) 245–253Hsu, L.-H., Dependence of tree copy functions55 (1985) 283–290Hsu, L.-H., C. Chen and E.-Y. Jean, A class of additive multiplicative graph functions65 (1987) 53–63Hsu, L.-H., Generalized homomorphism graph functions84 (1990) 31–37Hsu, W.-L. and G.L. Nemhauser, Algorithms for minimum covering by cliques and maximum clique in claw-free

perfect graphs 37 (1981) 181–191Hsu, W.-l. and G.L. Nemhauser, A polynomial algorithm for the minimum weighted clique cover problem on

claw-free perfect graphs38 (1982) 65–71Hu, B.,seeK. Xing 135(1-3) (1994) 387–393Hu, G.,seeC. Lin 141(1-3) (1995) 291–297Hu, T.C.,seeP.J. Koutas 11 (1975) 125–132Hu, W.-H.,seeH.-L. Fu 128(1-3) (1994) 143–150Hu, Z., A generalization of Fan’s condition and forbidden subgraph conditions for hamiltonicity196 (1-3)

(1999) 167–175Huang, C., On the existence of balanced bipartite designs, II9 (1974) 147–159Huang, C.,seeA. Rosa 12 (1975) 269–293Huang, C., Resolvable balanced bipartite designs14 (1976) 319–335Huang, C., A. Kotzig and A. Rosa, On a variation of the Oberwolfach problem27 (1979) 261–277Huang, H. and N.L. Johnson, 8 semifield planes of order 82 80 (1990) 69–79Huang, H.-C.,seeR.G. Bland 27 (1979) 11–22Huang, J.,seeJ. Bang-Jensen 138(1-3) (1995) 63–74Huang, J.,seeJ. Bang-Jensen 161(1-3) (1996) 1–12Huang, J.,seeJ. Bang-Jensen 185(1-3) (1998) 19–27Huang, K.-C.,seeH.-L. Fu 127(1-3) (1994) 181–186Huang, K.-C.,seeB.-L. Chen 184(1-3) (1998) 49–60Huang, K.-C.,seeB.-L. Chen 194(1-3) (1999) 59–65Huang, Q.,seeJ. Meng 178(1-3) (1998) 267–269Huang, R. and G.-C. Rota, On the relations of various conjectures on Latin squares and straightening coefficients

128(1-3) (1994) 225–236Huang, R., Muir’s identity — A supersymmetric approach146(1-3) (1995) 123–131Huang, T., An analogue of the Erdös–Ko–Rado theorem for the distance-regular graphs of bilinear forms64

(1987) 191–198Huang, T. and M. Laurent,(s, r;µ)-nets and alternating forms graphs114(1993) 237–252Huang, W.-C.,seeC.-C. Chou 197-198(1-3) (1999) 195–203Huang, Y. and Y. Liu, Maximum genus and maximum nonseparating independent set of a 3-regular graph176

(1-3) (1997) 149–158Huang, Y. and Y. Liu, The maximum genus of graphs with diameter three194(1-3) (1999) 139–149Huang, Y., Maximum genus and girth of graphs194(1-3) (1999) 253–259Hubaut, X., Two new families of 4-designs9 (1974) 247–249Hubaut, X.L., Strongly regular graphs13 (1975) 357–381Huck, A., Independent branchings in acyclic digraphs199(1-3) (1999) 245–249Hudry, O.,seeI. Charon 165-166(1-3) (1997) 139–153


Huffman, W.C., The biweight enumerator of self-orthogonal binary codes26 (1979) 129–143Huffman, W.C., On automorphism groups of certain 2-(v,3,2) designs induced by group actions59 (1986)

283–296Huffman, W.C., On the equivalence of codes and codes with an automorphism having two cycles83 (1990)

265–283Huffman, W.C., The equivalence of two cyclic objects onpq elements 154(1-3) (1996) 103–127Hughes, R.B. and M.R. Anderson, A triangulation of the 6-cube with 308 simplices (Communication) 117

(1993) 253–256Hughes, R.B., Minimum-cardinality triangulations of thed-cube ford = 5 andd = 6 118(1993) 75–118Hughes, R.B., Lower bounds on cube simplexity133(1-3) (1994) 123–138Hughes, R.B. and M.R. Anderson, Simplexity of the cube158(1-3) (1996) 99–150Huguet, Ll., Coding scheme for a wire-tap channel using regular codes56 (1985) 191–201Huhn, A.P. and L. Megyesi, On disjoint residue classes (Note) 41 (1982) 327–330Hujter, M.,seeM. Biró 100(1992) 267–279Hujter, M.,seeZ. Blázsik 115(1993) 51–55Hull, B., Two algorithms for matroids 13 (1975) 121–128Huneke, J.P.,seeH.H. Glover 13 (1975) 341–355Huneke, J.P.,seeH. Glover 18 (1977) 155–165Huneke, J.P.,seeH. Glover 22 (1978) 243–256Hung, L.T.Q., M.M. Sysło, M.L. Weaver and D.B. West, Bandwidth and density for block graphs189 (1-3)

(1998) 163–176Hung, S.H.Y. and N.S. Mendelsohn, Handcuffed designs18 (1977) 23–33Hungerbühler, N.,seeL. Halbeisen 147(1-3) (1995) 139–150Hurkens, C.A.J., A. Schrijver and É. Tardos, On fractional multicommodity flows and distance functions73

(1988/89) 99–109Hurlbert, G., The antipodal layers problem128(1-3) (1994) 237–245Hurlbert, G., Multicover Ucycles 137(1-3) (1995) 241–249Hurlbert, G. and G. Isaak, Equivalence class universal cycles for permutations149(1-3) (1996) 123–129Hurley, S.,seeD.H. Smith 167-168(1-3) (1997) 571–582Hurley, S.,seeS.M. Allen 197-198(1-3) (1999) 41–52Hurtado, F. and M. Noy, Ears of triangulations and Catalan numbers149(1-3) (1996) 319–324Hurtado, F., O. Serra and J. Urrutia, Hiding points in arrangements of segments162(1-3) (1996) 187–197Hutchinson, J.P.,seeM.O. Albertson 29 (1980) 1–11Hutchinson, J.P. and G.F. McNulty, Connected graphs of genusg with complementary orbits 45 (1983) 255–

275Hutchinson, J.P.,seeJ.G. Griggs 101(1992) 65–72Huybrechts, C., L· L∗-geometries and Dn-building 197-198(1-3) (1999) 431–451Hwang, F.K. and J.C. Lagarias, Minimum range sequences of allk-subsets of a set19 (1977) 257–264Hwang, F.K., An explicit expression for the cost of a class of huffman trees32 (1980) 163–165Hwang, F.K., Complete balanced Howell rotations for 8k + 5 teams 39 (1982) 145–151Hwang, F.K., J.F. Weng and D.Z. Du, A class of full Steiner minimal trees45 (1983) 107–112Hwang, F.K. and V.K. Wei, A partition identity (Note) 46 (1983) 323–326Hwang, F.K.,seeD. Borkovitz 47 (1983) 1–11Hwang, F.K.,seeP.C. Fishburn 61 (1986) 165–179Hwang, F.K. and J.F. Weng, Hexagonal coordinate systems and Steiner minimal trees62 (1986) 49–57Hwang, F.K. and Y.H. Xu, Double loop networks with minimum delay66 (1987) 109–118Hwang, F.K., U.G. Rothblum and Y.-C. Yao, Localizing combinatorial properties of partitions160(1-3) (1996)

1–23Hwang, L.,seeF. Cao 183(1-3) (1998) 27–38Hwang, S.G., The monotonicity of the permanent function (Note) 91 (1991) 99–104Hwang, S.G., Doubly stochastic circulant matrices (Note) 94 (1991) 69–74Iba, G.A.,seeC. Greene 13 (1975) 1–11Ibaraki, T., Integer programming formulation of combinatorial optimization problems16 (1976) 39–52Ibaraki, T.,seeJ.C. Bioch 140(1-3) (1995) 23–46


Idzik, A., J. Komar and M. Malawski, Edge-coloured complete graphs: Connectedness of some subgraphs66(1987) 119–125

Idzik, A., seeS. Bylka 194(1-3) (1999) 39–58Ihrig, E.,seeH. Barcelo 193(1-3) (1998) 61–68Ikeda, H.,seeF. Kitagawa 72 (1988) 195–211Ille, P., Indecomposable graphs173(1-3) (1997) 71–78Ille, P.,seeA. Cournier 183(1-3) (1998) 61–80Imase, M.,seeT. Soneoka 63 (1987) 53–66Imrich, W.,seeL. Babai 5 (1973) 101–103Imrich, W. and N. Seifter, A note on the growth of transitive graphs73 (1988/89) 111–117Imrich, W. and G. Sabidussi, Focality and graph isomorphism81 (1990) 237–245Imrich, W. and N. Seifter, A survey on graphs with polynomial growth95 (1991) 101–117Imrich, W. and J. Nešetril, Simple tournaments and sharply transitive groups108(1992) 159–165Imrich, W. and S. Klavžar, Retracts of strong products of graphs109(1992) 147–154Imrich, W.,seeC.P. Bonnington 145(1-3) (1995) 61–72Imrich, W. and J. Žerovnik, On the weak reconstruction of Cartesian-product graphs150(1-3) (1996) 167–178Imrich, W., T. Pisanski and J. Žerovnik, Recognizing Cartesian graph bundles167-168(1-3) (1997) 393–403Imrich, W., Factoring cardinal product graphs in polynomial time192(1-3) (1998) 119–144Innamorati, S.,seeL. Berardi 174(1-3) (1997) 35–46Inukai, T. and L. Weinberg, Theorems on matroid connectivity (Note) 22 (1978) 311–312Iorgulescu, A., On the construction of three-valued Lukasiewicz–Moisil algebras48 (1984) 213–227Iorgulescu, A.,S-prealgebras (Note) 126(1994) 415–419Iorgulescu, A., Connections between MVn algebras andn-valued Lukasiewicz–Moisil algebras Part I181(1-3)

(1998) 155–177Irving, R.W., Generalised Ramsey numbers for small graphs9 (1974) 251–264Isaak, G.,seeG. Hurlbert 149(1-3) (1996) 123–129Isaak, G.,seeK.P. Bogart 181(1-3) (1998) 37–51Isaksen, D.C. and D.P. Moulton, Randomly planar graphs175(1-3) (1997) 265–269Isbell, J., Sequencing certain dihedral groups (Note) 85 (1990) 323–328Isbell, J.R., Perfect addition sets24 (1978) 13–18Ishigami, Y., An extremal problem of orthants containing at most one point besides the origin132(1-3) (1994)

383–386Ishigami, Y.,seeJ. Akiyama 151(1-3) (1996) 15–18Ishigami, Y., An extremal problem ofd permutations containing every permutation of everyt elements 159

(1-3) (1996) 279–283Ismail, M.E.H. and D. Stewart, On Dumont’s polynomials41 (1982) 155–160Itai, A. and A. Zehavi, Bounds on path connectivity51 (1984) 25–34Ito, N., Doubly regular asymmetric digraphs72 (1988) 181–185Ito, N., Even tournaments and Hadamard tournaments151(1-3) (1996) 105–111Ito, T., seeE. Bannai 37 (1981) 147–158Iturrioz, L. and O. Rueda, Algebres implicatives trivalentes de łukasiewicz libres18 (1977) 35–44Itzykson, C.,seeM. Bauer 156(1-3) (1996) 29–81Ivanov, A.V., Two families of strongly regular graphs with the 4-vertex condition127(1-3) (1994) 221–242Ivanyos, G. and Á. Szántó, Lattice basis reduction for indefinite forms and an application153 (1-3) (1996)

177–188Ivashchenko, A.V., The coordinate representation of a graph andn-universal graph of radius 1120(1993) 107–

114Ivashchenko, A.V., Representation of smooth surfaces by graphs. Transformations of graphs which do not change

the Euler characteristic of graphs122(1993) 219–233Ivashchenko, A.V., Contractible transformations do not change the homology groups of graphs126 (1994)

159–170Ivashchenko, A.V. and Y.-N. Yeh, Minimal graphs of a torus, a projective plane and spheres and some properties

of minimal graphs of homotopy classes126(1994) 171–178Ivashchenko, A.V., Graphs of spheres and tori128(1-3) (1994) 247–255Ivashchenko, A.V., Some properties of contractible transformations on graphs133(1-3) (1994) 139–145


Ivi c, A., seeI. Gutman 150(1-3) (1996) 131–142Jackowski, J.A.,seeG.T. Herman 5 (1973) 131–144Jackowski, Z., A new characterization of proper interval graphs105(1992) 103–109Jackowski, Z., Characterizations of two classes of digraphs133(1-3) (1994) 147–157Jackson, B.,seeT.D. Parsons 31 (1980) 43–52Jackson, B. and G. Ringel, Maps ofm-pires on the projective plane46 (1983) 15–20Jackson, B. and O. Ordaz, A Chvátal–Erdös condition for (1,1)-factors in digraphs (Note) 57 (1985) 199–201Jackson, B., Compatible Euler tours for transition systems in Eulerian graphs66 (1987) 127–131Jackson, B.,seeN. Hartsfield 78 (1989) 89–94Jackson, B.,seeG. Hahn 82 (1990) 327–329Jackson, B. and O. Ordaz, Chvátal-Erdos conditions for paths and cycles in graphs and digraphs. A survey84

(1990) 241–254Jackson, B.,seeR.E.L. Aldred 88 (1991) 1–9Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs102(1992) 163–176Jackson, B. and N.C. Wormald, On the lineark-arboricity of cubic graphs 162(1-3) (1996) 293–297Jackson, B. and J. Sheehan, The structure of transform graphs177(1-3) (1997) 123–144Jackson, B.W.,seeS. Cabaniss 82 (1990) 127–141Jackson, B.W., Universal cycles ofk-subsets andk-permutations 117(1993) 141–150Jackson, D.E.,seeL. Clark 30 (1980) 95–101Jackson, D.M.,seeI.P. Goulden 22 (1978) 99–104Jackson, D.M., B. Jeffcott and W.T. Spears, The enumeration of sequences with respect to structures on a

bipartition 30 (1980) 133–149Jackson, D.M.,seeC.B. Collins 36 (1981) 139–153Jackson, D.M.,seeE. Rodney Canfield 99 (1992) 25–30Jackson, D.M.,seeI.P. Goulden 158(1-3) (1996) 77–85Jackson, W.-A., F. Piper and P. Wild, Non-embedding of non prime-power unitals with point-regular group98

(1991) 23–28Jacob, G.,seeC. Hespel 180(1-3) (1998) 211–219Jacob, H. and H. Meyniel, About quasi-kernels in a digraph154(1-3) (1996) 279–280Jacob, H., Kernels in graphs with a clique-cutset156(1-3) (1996) 265–267Jacobson, M., G.M. Levin and E.R. Scheinerman, On fractional Ramsey numbers176(1-3) (1997) 159–175Jacobson, M.S., A note of Ramsey multiplicity (Note) 29 (1980) 201–203Jacobson, M.S., On a generalization of Ramsey theory38 (1982) 191–195Jacobson, M.S., On the Ramsey multiplicity for stars42 (1982) 63–66Jacobson, M.S.,seeR.J. Gould 42 (1982) 189–196Jacobson, M.S.,seeA. Gyárfás 69 (1988) 35–41Jacobson, M.S.,seeR.J. Faudree 76 (1989) 223–240Jacobson, M.S.,seeJ.F. Fink 86 (1990) 47–57Jacobson, M.S. and K. Peters, Chordal graphs and upper irredundance, upper domination and independence86

(1990) 59–69Jacobson, M.S., M. Truszczynski and Z. Tuza, Decompositions of regular bipartite graphs89 (1991) 17–27Jacobson, M.S.,seeR.J. Faudree 91 (1991) 45–59Jacobson, M.S.,seeR.J. Faudree 103(1992) 17–24Jacobson, M.S.,seeR.J. Faudree 105(1992) 61–71Jacobson, M.S.,seeR.J. Faudree 141(1-3) (1995) 109–122Jacobson, M.S. and J. Lehel, Irregular embeddings of hypergraphs with fixed chromatic number145 (1-3)

(1995) 145–150Jacobson, M.S. and J. Lehel, Irregular embeddings of multigraphs with fixed chromatic number145 (1-3)

(1995) 295–299Jacobson, M.S.,seeR.J. Faudree 150(1-3) (1996) 103–113Jacobson, M.S.,seeG. Chen 197-198(1-3) (1999) 185–194Jaeger, F., Sur l’indice chromatique du graphe representatif des aretes d’un graphe regulier9 (1974) 161–172Jaeger, F., Interval matroids and graphs (Communication) 27 (1979) 331–336Jaeger, F., The 1-factorization of some line-graphs (Note) 46 (1983) 89–92Jaeger, F., C. Payan and M. Kouider, Partition of odd regular graphs into bistars (Note) 46 (1983) 93–94


Jaeger, F., On the Penrose number of cubic diagrams74 (1989) 85–97Jaeger, F., A new invariant of plane bipartite cubic graphs101(1992) 149–164Jaeger, F., Plane graphs and link invariants114(1993) 253–264Jagger, C., Tournaments as strong subcontractions176(1-3) (1997) 177–184Jajcay, R., Characterization and construction of Cayley graphs admitting regular Cayley maps158(1-3) (1996)

151–160Jakobsen, I.T., On critical graphs with chromatic index 49 (1974) 265–276Jambu-Giraudet, M., Quelques remarques sur l’equivalence elementaire entre groupes ou treillis d’automorphism-

es de chaines 2-homogenes53 (1985) 117–124Jamison, R.E.,seeF.H. Clarke 14 (1976) 241–245Jamison, R.E. and R. Nowakowski, A Helly theorem for convexity in graphs51 (1984) 35–39Jamison, R.E.,seeM.C. Golumbic 55 (1985) 151–159Jamison, R.E., Few slopes without collinearity60 (1986) 199–206Jamison, R.E.,seeM. Farber 66 (1987) 231–247Jamison, R.E., Alternating Whitney sums and matchings in trees, Part 167 (1987) 177–189Jamison, R.E.,seeM.O. Albertson 74 (1989) 33–49Jamison, R.E., On the edge achromatic numbers of complete graphs74 (1989) 99–115Jamison, R.E., Alternating Whitney sums and matchings in trees, Part II79 (1989/90) 177–189Jamrozik, J., R. Kalinowski and Z. Skupien, A catalogue of small maximal nonhamiltonian graphs (Note) 39

(1982) 229–234Janakiraman, T.N., On special classes of self-centred graphs (Note) 126(1994) 411–414Janko, Z. and T. van Trung, Construction of two symmetric block designs for (71, 21, 6) (Note) 55 (1985)

327–328Janko, Z. and V.D. Tonchev, Cyclic 2-(91, 6, 1) designs with multiplier automorphisms97 (1991) 265–268Janowitz, M.F., SemiflatL-cluster methods 21 (1978) 47–60Janowitz, M.F., A converse to the Sholander embedding (Note) 87 (1991) 315–318Jansen, A.J.E.M.,seeJ.I. Hall 17 (1977) 71–83Jansen, K., Transfer flow graphs115(1993) 187–199Jansen, K., A rainbow aboutT -colorings for complete graphs154(1-3) (1996) 129–139Janson, S. and J. Kratochvíl, Thresholds for classes of intersection graphs108(1992) 307–326Janssen, J.C.M.,seeR. Häggkvist 157(1-3) (1996) 199–206Jarrett, E.B., Two families of graphs satisfying the cycle basis interpolation property84 (1990) 39–46Jarrett, E.B.,seeG. Chartrand 170(1-3) (1997) 63–79Jauregui, V.,seeI.J. Dejter 114(1993) 131–135Javdekar, M., Characterization of forciblyk-variegated degree sequences,k ≥ 3 29 (1980) 33–38Javdekar, M., Characterization ofk-variegated graphs,k ≥ 3 32 (1980) 263–270Jean, E.-Y.,seeL.-H. Hsu 65 (1987) 53–63Jech, T., The logarithmic distribution of leading digits and finitely additive measures108(1992) 53–57Jedwab, J., C. Mitchell, F. Piper and P. Wild, Perfect binary arrays and difference sets125(1994) 241–254Jeffcott, B.,seeD.M. Jackson 30 (1980) 133–149Jégou, P. and M.-C. Vilarem, On some partial line graphs of a hypergraph and the associated matroid111(1993)

333–344Jendrol, S. and E. Jucovic, On a conjecture by B. Grünbaum2 (1972) 35–49Jendrol, S. and M. Tkác, On the simplicial 3-polytopes with only two types of edges48 (1984) 229–241Jendrol, S., On a problem of J. Zaks concerning 5-valent 3-connected planar graphs50 (1984) 231–237Jendrol, S. and P. Mihók, On a class of hamiltonian polytopes71 (1988) 233–241Jendrol, S., A non-involutory selfduality (Communication) 74 (1989) 325–326Jendrol, S. and E. Jucovic, On quadrangular convex 3-polytopes with at most two types of edges78 (1989)

297–305Jendrol, S. and M. Tkác, Convex 3-polytopes with exactly two types of edges84 (1990) 143–160Jendrol’, S., On face vectors and vertex vectors of convex polyhedra118(1993) 119–144Jendrol’, S. and P.J. Owens, Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters

137(1-3) (1995) 251–263Jendrol, S. and M. Tkác, The irregularity strength oftKp 145(1-3) (1995) 301–305


Jendrol, S., M. Tkác and Z. Tuza, The irregularity strength and cost of the union of cliques150 (1-3) (1996)179–186

Jendrol’, S.,seeM. Hornák 164(1-3) (1997) 171–174Jendrol’, S.,seeI. Fabrici 191(1-3) (1998) 83–90Jendrol’, S., Triangles with restricted degrees of their boundary vertices in plane triangulations196(1-3) (1999)

177–196Jendrol’, S., T. Madaras, R. Soták and Z. Tuza, On light cycles in plane triangulations197-198(1-3) (1999)

453–467Jennings, D., On packings of squares and rectangles138(1-3) (1995) 293–300Jennings, D. and K. Byard, An extension for residue difference sets167-168(1-3) (1997) 405–410Jennings, D. and K. Byard, Qualified residue difference sets with zero181(1-3) (1998) 283–288Jeong, D.-Y., Realizations with a cut-through Eulerian circuit137(1-3) (1995) 265–275Jepsen, C.H., On colorings of finite projective planes (Note) 63 (1987) 95–96Jepsen, C.H., Dissections into 1:2 rectangles148(1-3) (1996) 107–117Jeroslow, R., Cutting-plane theory: Algebraic methods23 (1978) 121–150Jeroslow, R.G., The simplex algorithm with the pivot rule of maximizing criterion improvement4 (1973) 367–

377Jeroslow, R.G., Linear programs dependent on a single parameter6 (1973) 119–140Jeroslow, R.G., On algorithms for discrete problems7 (1974) 273–280Jeroslow, R.G., On defining sets of vertices of the hypercube by linear inequalities11 (1975) 119–124Jeroslow, R.G.,seeC.E. Blair 19 (1977) 121–138Jeroslow, R.G.,seeC.E. Blair 25 (1979) 7–19Jeurissen, R.H., Covers, matchings and odd cycles of a graph13 (1975) 251–260Jeurissen, R.H., Disconnected graphs with magic labelings43 (1983) 47–53Jeurissen, R.H., Pseudo-magic graphs43 (1983) 207–214Jeurissen, R.H., A proof by graphs that PSL(2,7)∼= PSL(3,2) (Note) 70 (1988) 315–317Jeurissen, R.H., C.H. van Os and J.H.M. Steenbrink, The configuration of bitangents of the Klein curve132

(1-3) (1994) 83–96Jha, P.K., Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity182 (1-3)

(1998) 153–167Jha, V., On subgroups and factor groups of GL(n, q) acting on spreads with the same characteristic41 (1982)

43–51Jha, V. and N.L. Johnson, Regular parallelisms from translation planes59 (1986) 91–97Jha, V.,seeN.L. Johnson 132(1-3) (1994) 97–106Jha, V. and G. Wene, An oval partition of the central units of certain semifield planes155(1-3) (1996) 127–134Jia, R.Z.,seeL. Caccetta 190(1-3) (1998) 241–245Jia, X.-D., Some remarks on minimal bases and maximal nonbases of integers (Note) 122(1993) 357–362Jia, X.F.,seeY. Qiu 104(1992) 201–204Jiang, M. and F. Ruskey, Determining the Hamilton-connectedness of certain vertex-transitive graphs133(1-3)

(1994) 159–169Jiang, Z. and C.J. Colbourn, Completing the spectrum of rotational Mendelsohn triple systems183(1-3) (1998)

153–160Jiang, Z.,seeV. Linek 196(1-3) (1999) 229–238Jimbo, M.,seeS. Kuriki 46 (1983) 33–40Jimbo, M. and S. Kuriki, On a composition of cyclic 2-designs46 (1983) 249–255Jimbo, M.,seeR. Fuji-Hara 76 (1989) 29–35Jimbo, M., Recursive constructions for cyclic BIB designs and their generalizations116(1993) 79–95Jimbo, M.,seeM. Mishima 156(1-3) (1996) 285–290Jin, G., Triangle-free four-chromatic graphs145(1-3) (1995) 151–170Jin, G.,seeB. Bollobás 175(1-3) (1997) 253–257Jin, G., The number of complete subgraphs of equi-partite graphs186(1-3) (1998) 157–165Jirásek, J., Some remarks on Ádám’s conjecture for simple directed graphs108(1992) 327–332Jockusch, W.,seeJ.-P. Allouche 139(1-3) (1995) 455–461Jockusch, W.,seeG. Bohus 187(1-3) (1998) 259–264Johns, G., A simple proof of the characterization of antipodal graphs128(1-3) (1994) 399–400


Johnson, C.R. and W.W. Barrett, Determinantal inequalities for positive definite matrices119(1993) 97–106Johnson, C.R. and T.A. McKee, Structural conditions for cycle completable graphs159(1-3) (1996) 155–160Johnson, D., A (2, 11) combinatorial groupoid19 (1977) 265–271Johnson, D.S.,seeB.N. Clark 86 (1990) 165–177Johnson, K.E.,seeM.N. Ellingham 133(1-3) (1994) 89–98Johnson, K.W., Latin square determinants II105(1992) 111–130Johnson, N.L.,seeV. Jha 59 (1986) 91–97Johnson, N.L.,seeH. Huang 80 (1990) 69–79Johnson, N.L.,seeF. De Clerck 106/107(1992) 127–134Johnson, N.L. and V. Jha, Regulus codes132(1-3) (1994) 97–106Johnson, P.D., Coloring abelian groups40 (1982) 219–223Johnson, P.D.,seeA.J.W. Hilton 69 (1988) 309–311Johnson, R.H., Simple directed trees14 (1976) 257–264Johnson, R.H., Properties of inique realizations — A survey31 (1980) 185–192Johnson, S., Upper bounds for constant weight error correcting codes3 (1972) 109–124Johnson, W.P., Some applications of theq-exponential formula 157(1-3) (1996) 207–225Johnson, W.P.,q-Extensions of identities of Abel–Rothe type159(1-3) (1996) 161–177Johnson Jr., C.S.,seeG.F. Estabrook 16 (1976) 141–147Johnson Jr., P.D., Simple product colorings48 (1984) 83–85Johnson Jr., P.D., Two-colorings of a dense subgroup ofQn that forbid many distances79 (1989/90) 191–195Johnston, I.J., Some results involving multilattice ideals and distributivity83 (1990) 27–35Joichi, J.T. and D.E. White, Gray codes in graphs of subsets31 (1980) 29–41Joichi, J.T. and D. Stanton, An involution for Jacobi’s identity73 (1989) 261–271Joichi, J.T., Hecke-Rogers, Andrews identities; Combinatorial proofs84 (1990) 255–259Jolivet, J.-L., Sur le joint d’une famille de graphes5 (1973) 145–158Jonck, B.,seeG. Benadé 162(1-3) (1996) 13–22Jones, C.A., Using linear forms to determine the set of integers realizable by(g0, g1, . . . , gn)-trees 47 (1983)

247–254Jones, G.A.,seeM.L.N. Downs 64 (1987) 299–302Jones, L.K., Sur une loi de probabilite conditionelle de Kleitman (Note) 15 (1976) 107–108Jones, R.H., Enumerating uniform polyhedral surfaces with triangular faces138(1-3) (1995) 281–292Joni, S.A., The multi-indexed partitional26 (1979) 145–163Joni, S.A., G.-C. Rota and B. Sagan, From sets to functions: Three elementary examples37 (1981) 193–202Jónsson, B., Relation algebras and Schröder categories70 (1988) 27–45Jordán, T., On the existence of (k,l)-critical graphs 179(1-3) (1998) 273–275Jørgensen, L.K.,seeD. Hanson 101(1992) 109–114Jørgensen, L.K., Nonexistence of certain cubic graphs with small diameters114(1993) 265–273Jorgulescu, A., Functors between categories of three-valued Lukasiewicz–Moisil algebras I49 (1984) 121–131Joseph, A., The isomorphism problem for Cayley digraphs on groups of prime-squared order141(1-3) (1995)

173–183Joshi, S.B.,seeS.S. Abhyankar 90 (1991) 111–135Joshi, S.B.,seeS.S. Abhyankar 93 (1991) 1–17Jou, M.-J.,seeG.J. Chang 197-198(1-3) (1999) 169–178Joyce, D., Generalized chromatic polynomials50 (1984) 51–62Jucovic, E.,seeS. Jendrol 2 (1972) 35–49Jucovic, E., Analogues of Eberhard’s Theorem for 4-valent 3-polytopes with involutory automorphisms6

(1973) 249–254Jucovic, E.,seeS. Jendrol 78 (1989) 297–305Juhász, F., On the asymptotic behaviour of the spectra of non-symmetric random(0,1) matrices 41 (1982)

161–165Juhász, F., The asymptotic behaviour of Fiedler’s algebraic connectivity for random graphs96 (1991) 59–63Jung, H.A. and M.E. Watkins, On the structure of infinite vertex-transitive graphs18 (1977) 45–53Jung, H.A.,seeE. Flandrin 90 (1991) 41–52Jung, H.A., Some results on ends and automorphisms of graphs95 (1991) 119–133Jung, H.A., On finite fixed sets in infinite graphs131(1-3) (1994) 115–125


Jünger, M., P. Mutzel, T. Odenthal and M. Scharbrodt, The thickness of a minor-excluded class of graphs182(1-3) (1998) 169–176

Jungerman, M.,l-regular rotations of the countably infinite complete graph20 (1977) 41–49Jungnickel, D., Composition theorems for difference families and regular planes23 (1978) 151–158Jungnickel, D. and G. Grams, Maximal difference matrices of order6 10 (Note) 58 (1986) 199–203Jungnickel, D., Some self-blocking block designs77 (1989) 123–135Jungnickel, D., On the existence of small quasimultiples of affine and projective planes of arbitrary order85

(1990) 177–189Jungnickel, D. and S. Vanstone, Triple systems in PG(2, q) 92 (1991) 131–135Jungnickel, D.,seeK.T. Arasu 97 (1991) 25–38Jungnickel, D., R.C. Mullin and S.A. Vanstone, The spectrum ofα-resolvable block designs with block size 3

97 (1991) 269–277Jungnickel, D.,seeD. Hachenberger 106/107(1992) 231–242Jungnickel, D.,seeK.T. Arasu 147(1-3) (1995) 1–17Jungreis, D., Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups78 (1989) 95–

104Jungreis, D.S.,seeM. Reid 82 (1990) 53–56Jungreis, D.S.,seeD. Dunham 143(1-3) (1995) 1–30Jungreis, I.L., Infinite Hamiltonian paths in Cayley digraphs54 (1985) 167–180Junming, L.,seeX. Keyi 163(1-3) (1997) 285–291Jurišic, A., Antipodal covers of strongly regular graphs182(1-3) (1998) 177–189Justin, J. and G. Pirillo, Two combinatorial properties of partitions of the free semigroup into finitely many parts

(Note) 52 (1984) 299–303Juvan, M., B. Mohar and R. Škrekovski, On list edge-colorings of subcubic graphs187(1-3) (1998) 137–149Kabadi, S.N.,seeR. Chandrasekaran 71 (1988) 205–217Kabell, J.A., A note on colorings of finite planes (Note) 44 (1983) 319–320Kabil, M. and M. Pouzet, Injective envelope of graphs and transition systems192(1-3) (1998) 145–186Kageyama, S., Improved inequalities for balanced incomplete block designs21 (1978) 177–188Kageyama, S. and R.N. Mohan, Onµ-resolvable BIB designs 45 (1983) 113–121Kageyama, S. and K. Sinha, Constructions of partially balanced bipartite block designs92 (1991) 137–144Kageyama, S., The family of block designs with some combinatorial properties116(1993) 17–54Kageyama, S., Robustness of some balanced block designs116(1993) 159–181Kageyama, S., Experimental design: methods and applications. An updated bibliography of books in English

118(1993) 251–252Kageyama, S.,seeY. Miao 195(1-3) (1999) 269–276Kahn, J.,seeR.P. Gupta 32 (1980) 37–43Kahn, J. and D.J. Kleitman, On cross-bandwidth (Communication) 33 (1981) 323–325Kahn, J. and M. Saks, On the widths of finite distributive lattices63 (1987) 183–195Kahn, J.,seeZ. Füredi 83 (1990) 129–134Kaikkonen, M.K.,seeP.R.J. Östergård 178(1-3) (1998) 165–179Kainen, P.,seeP. Erdös 24 (1978) 235–249Kajitani, Y., S. Ueno and H. Miyano, Ordering of the elements of a matroid such that its consecutivew elements

are independent 72 (1988) 187–194Kajitani, Y., seeS. Ueno 72 (1988) 355–360Kajitani, Y., seeA. Takahashi 127(1-3) (1994) 293–304Kalai, G.,f -vectors of acyclic complexes55 (1985) 97–99Kalhoff, F., On projective embeddings of partial planes and rank-three matroids163(1-3) (1997) 67–79Kalikow, L.H., seeJ.D. Gilbey 197-198(1-3) (1999) 351–373Kalinowski, R.,seeJ. Jamrozik 39 (1982) 229–234Kalinowski, R. and Z. Skupien, Large Isaacs’ graphs are maximally non-Hamilton-connected (Note) 82 (1990)

101–104Kalinowski, R., Small periods of endomorphisms of trees121(1993) 105–111Kalmbach, G., 1982 news about orthomodular lattices53 (1985) 125–135Kamath, G.D.,seeE. Sampathkumar 124(1994) 173–177Kampen, G.R., Orienting planar graphs14 (1976) 337–341


Kanchi, S.P.,seeJ. Chen 156(1-3) (1996) 83–102Kane, V.D.,seeV.N. Bhat-Nayak 68 (1988) 311–313Kane, V.G. and S.K. Basu, On the depth of a planar graph14 (1976) 63–67Kaneko, A.,seeK. Ando 150(1-3) (1996) 403–406Kaneko, A.,seeK. Ando 151(1-3) (1996) 39–47Kaneko, J., Constant term identities of Forrester–Zeilberger–Cooper173(1-3) (1997) 79–90Kaneta, H.,seeJ.M. Chao 174(1-3) (1997) 87–94Kaneta, H.,seeM. Harada 188(1-3) (1998) 127–136Kaneti, V.,seeP. Duchet 65 (1987) 95–98Kaneti, V.,seeP. Duchet 130(1-3) (1994) 57–68Kang, Q., The construction of large sets of disjoint Mendelsohn triple systems of order 2n+2 (Note) 90 (1991)

199–205Kang, Q. and Y. Chang, Further results about large sets of disjoint Mendelsohn triple systems (Note) 118(1993)

263–268Kannan, R.,seeR. Giles 30 (1980) 181–184Kano, M.,seeA. Amahashi 42 (1982) 1–6Kano, M. and A. Saito,[a,b]-factors of graphs (Note) 47 (1983) 113–116Kano, M., Sufficient conditions for a graph to have factors80 (1990) 159–165Kano, M.,seeK. Ando 82 (1990) 7–11Kano, M. and A. Sakamoto, Spanning trees fixed by automorphisms of a graph (Note) 82 (1990) 219–222Kano, M.,seeH. Enomoto 137(1-3) (1995) 189–193Kano, M.,seeY. Egawa 151(1-3) (1996) 87–90Kano, M., Edge-removing games of star type151(1-3) (1996) 113–119Kantor, W.M., Exponential numbers of two-weight codes, difference sets and symmetric designs (Note) 46

(1983) 95–98Kantor, W.M., Kerdock codes and related planes106/107(1992) 297–302Kao, D.T.,seeP. de la Torre 180(1-3) (1998) 123–142Kapoor, S.F.,seeD. Burns 32 (1980) 99–103Kapralov, S.N. and V.D. Tonchev, Extremal doubly-even codes of length 64 derived from symmetric designs83

(1990) 285–289Karapetian, I.,seeS. Markossian 178(1-3) (1998) 137–153Karchmer, M., N. Linial, I. Newman, M. Saks and A. Wigderson, Combinatorial characterization of read-once

formulae 114(1993) 275–282Karhumäki, J.,seeA. Ehrenfeucht 22 (1978) 233–242Karhumäki, J.,seeK. Culik II 43 (1983) 139–153Kari, J., A small aperiodic set of Wang tiles160(1-3) (1996) 259–264Karim, J.P.,seeR. Hill 106/107(1992) 273–283Karlander, J.,seeA. Björner 108(1992) 139–147Károlyi, G.,seeM. Cochand 194(1-3) (1999) 249–252Karonski, M. and T. Łuczak, The number of connected sparsely edged uniform hypergraphs171 (1-3) (1997)

153–167Karp, R.M. and S.-Y.R. Li, Two special cases of the assignment problem13 (1975) 129–142Karp, R.M., A characterization of the minimum cycle mean in a digraph (Note) 23 (1978) 309–311Karpinski, M.,seeS. Evdokimov 197-198(1-3) (1999) 247–267Karpovsky, M.G. and V.D. Milman, On subspaces contained in subsets of finite homogeneous spaces22 (1978)

273–280Karpovsky, M.G. and V.D. Milman, Coordinate density of sets of vectors24 (1978) 177–184Karzanov, A.V., Packings of cuts realizing distances between certain vertices in a planar graph85 (1990) 73–87Karzanov, A.V.,seeM. Burlet 181(1-3) (1998) 65–76Karzanov, A.V., On one maximum multiflow problem and related metrics192(1-3) (1998) 187–204Kashiwagi, Y. and I. Kikumasa, Indecomposability of cyclic codes196(1-3) (1999) 277–280Kasimatis, E.A. and S.K. Stein, Equidissections of polygons85 (1990) 281–294Kasiraj, J.,seeA.M. Hobbs 67 (1987) 27–42Katchalski, M., Intersecting all edges of convex polytopes by planes19 (1977) 273–279Katchalski, M.,seeH. Abbott 25 (1979) 85–88


Katchalski, M. and A. Liu, Arcs on the circle andp-tuplets on the line 27 (1979) 59–69Katchalski, M. and T. Lewis, Cutting rectangles in the plane42 (1982) 67–71Katchalski, M., T. Lewis and J. Zaks, Geometric permutations for convex sets54 (1985) 271–284Katchalski, M., T. Lewis and A. Liu, Geometric permutations of disjoint translates of convex sets65 (1987)

249–259Katchalski, M.,seeH.L. Abbout 68 (1988) 1–8Katchalski, M.,seeH.L. Abbott 91 (1991) 111–120Katchalski, M.,seeH.L. Abbott 132(1-3) (1994) 367–371Katchalski, M., W. McCuaig and S. Seager, Ordered colourings142(1-3) (1995) 141–154Katerinis, P., Toughness of graphs and the existence of factors80 (1990) 81–92Katerinis, P., Regular factors in regular graphs (Note) 113(1993) 269–274Katerinis, P., Regular factors in vertex-deleted subgraphs of regular graphs131(1-3) (1994) 357–361Katona, G.O.H.,seeR. Ahlswede 17 (1977) 1–22Katona, G.O.H. and L.V. Quintas, The largest component in a random subgraph of then-cycle 121 (1993)

113–116Katona, G.O.H., Extremal problems for finite sets and convex hulls — A survey164(1-3) (1997) 175–185Katona, G.Y., Toughness and edge-toughness164(1-3) (1997) 187–196Katona, Gy.,seeA. Békéssy 30 (1980) 83–88Katriel, J., Minimal set of class-sums characterizing the ordinary irreducible representations of the symmetric

group, and the Tarry–Escott problem173(1-3) (1997) 91–95Katz, T.M.,seeD.I.A. Cohen 29 (1980) 213–214Katznelson, Y.,seeH. Furstenberg 75 (1989) 227–241Kauffman, L. and S. Lins, Decomposition of the vertex group of 3-manifolds103(1992) 49–55Kaufmann, M. and S. Shelah, On random models of finite power and monadic logic54 (1985) 285–293Kayathri, K.,seeS.A. Choudum 141(1-3) (1995) 67–73Keating, K., The conjunction of Cayley digraphs42 (1982) 209–219Kedem, B., Counting the number of 0–1 stationary time series having the same likelihood18 (1977) 285–289Keedwell, A.D.,seeA.J.W. Hilton 14 (1976) 311–318Keedwell, A.D., On the sequenceability of non-abelian groups of orderpq 37 (1981) 203–216Keedwell, A.D., More superP -groups (Communication) 49 (1984) 205–207Keedwell, A.D.,seeJ. Dénes 106/107(1992) 157–161Keenan, D.E., A Fisher type inequality (Note) 29 (1980) 205–208Keich, U.,seeR. Aharoni 152(1-3) (1996) 1–12Keil, J.M.,seeD.G. Corneil 46 (1983) 317–318Kelleher, L.L.,seeM.B. Cozzens 86 (1990) 101–116Kellerer, H. and G. Wirsching, Prime covers and periodic patterns85 (1990) 191–206Kelly, D., On the dimension of partially ordered sets35 (1981) 135–156Kelly, D., Fundamentals of planar ordered sets63 (1987) 197–216Kelly, D., seeJ.I. Brown 80 (1990) 123–143Kelly, D., seeM. Habib 88 (1991) 211–229Kelly, D.G.,seeT.A. Dowling 7 (1974) 209–224Kelly, D.G. and D. Kennedy, The Higgs factorization of a geometric strong map22 (1978) 139–146Kelly, G., On the uniqueness of embedding a residual design39 (1982) 153–160Kelmans, A. and X. Yong, The distribution of eigenvalues of graphs199(1-3) (1999) 251–258Kelmans, A.K., Comparison of graphs by their number of spanning trees16 (1976) 241–261Kelmans, A.K. and M.V. Lomonosov, Whenm vertices in ak-connected graph cannot be walked round along a

simple cycle (Communication) 38 (1982) 317–322Kelmans, A.K. and B.N. Kimelfeld, Multiplicative submodularity of a matrix’s principal minor as a function of

the set of its rows and some combinatorial applications (Note) 44 (1983) 113–116Kelmans, A.K. and M.V. Lomonosov, On cycles through prescribed vertices in weakly separable graphs46

(1983) 183–189Kelmans, A.K., A strengthening of the Kuratowski planarity criterion for 3-connected graphs51 (1984) 215–

220Kelmans, A.K., A short proof and a strengthening of the whitney 2-isomorphism theorem on graphs64 (1987)

13–25


Kelmans, A.K., Optimal packing of induced stars in a graph173(1-3) (1997) 97–127Ke Min, Z., seeR.E.L. Aldred 127(1-3) (1994) 23–29Kemnitz, A. and H. Kolberg, Coloring of integer distance graphs191(1-3) (1998) 113–123Kemp, R., On the average depth of a prefix of the DycklanguageD1 36 (1981) 155–170

Kemp, R., On the number of words in the languagew ∈∑∗ |w =wR240 (1982) 225–234

Kemp, R., On the number of deepest nodes in ordered trees81 (1990) 247–258Kennedy, D., Majors of geometric strong maps12 (1975) 309–340Kennedy, D.,seeD.G. Kelly 22 (1978) 139–146Kennedy, G.T. and V. Pless, A coding theoretic approach to extending designs142(1-3) (1995) 155–168Kenyon, C. and E. Rémila, Perfect matchings in the triangular lattice152(1-3) (1996) 191–210Keqin, F., A problem on algebraic graph theory (Communication) 54 (1985) 107–109Kerber, A., Characters of wreath products and some applications to representation theory and combinatorics13

(1975) 13–30Kerber, A. and J. Tappe, On permutation characters of wreath products15 (1976) 151–161Kerber, A., A matrix of combinatorial numbers related to the symmetric groups (Note) 21 (1978) 319–321Kern, W.,seeA. Bachem 69 (1988) 11–18Kern, W.,seeP.L. Erdos 144(1-3) (1995) 11–22Kessler, I.J.,seeH. Fredricksen 61 (1986) 181–188Kessler, O.,seeR. Aharoni 84 (1990) 309–313Kettoola, S.Y. and J.D. Roberts, Some results on Ramsey numbers using sumfree sets (Note) 40(1982) 123–124Key, J.D. and N.K.A. Rostom, Unitary designs with regular sets of points69 (1988) 235–239Key, J.D.,seeE.F. Assmus Jr. 83 (1990) 161–187Keyi, X. and L. Junming, On Srivastava’s problems and the properties of Hadamard matrices163(1-3) (1997)

285–291Kézdy, A.E. and C. Wang, Alternating walks in partially 2-edge-colored graphs and optimal strength of graph

labeling 194(1-3) (1999) 261–265Khachatrian, L.H.,seeR. Ahlswede 131(1-3) (1994) 9–15Khachatrian, L.H.,seeR. Ahlswede 149(1-3) (1996) 289Khachatrian, N.K.,seeA.S. Hasratian 90 (1991) 143–152Khachiyan, L.,seeV. Gurvich 169(1-3) (1997) 245–248Khamis, S.M.,seeB.I. Bayoumi 131(1-3) (1994) 29–37Kharaghani, H., An infinite class of Hadamard matrices of maximal excess (Note) 89 (1991) 307–312Kharaghani, H., A construction for Hadamard matrices120(1993) 115–120Kharaghani, H.,seeW.H. Holzmann 190(1-3) (1998) 265–269Khelladi, A.,seeS. Gravier 145(1-3) (1995) 273–277Khosrovashahi, G.B.,seeS. Ajoodani-Namini 135(1-3) (1994) 29–37Kierstead, H.A. and J.H. Schmerl, Some applications of Vizing’s theorem to vertex colorings of graphs45

(1983) 277–285Kierstead, H.A.,seeA. Ehrenfeucht 52 (1984) 159–164Kierstead, H.A. and J.H. Schmerl, The chromatic number of graphs which induce neitherK1,3 norK5− e 58

(1986) 253–262Kierstead, H.A. and W.T. Trotter, A Ramsey theoretic problem for finite ordered sets63 (1987) 217–223Kierstead, H.A., Applications of edge coloring of multigraphs to vertex coloring of graphs74 (1989) 117–124Kierstead, H.A., A polynomial time approximation algorithm for Dynamic Storage Allocation88 (1991) 231–

237Kierstead, H.A. and W.T. Trotter, Colorful induced subgraphs101(1992) 165–169Kierstead, H.A. and J. Qin, Coloring interval graphs with First-Fit144(1-3) (1995) 47–57Kierstead, H.A. and V. Rodl, Applications of hypergraph coloring to coloring graphs not inducing certain trees

150(1-3) (1996) 187–193Kierstead, H.A. and J. Quintana, Square Hamiltonian cycles in graphs with maximal 4-cliques178(1-3) (1998)

81–92Kikumasa, I.,seeY. Kashiwagi 196(1-3) (1999) 277–280Kilakos, K. and F.B. Shepherd, Face extensions in planar cubic graphs181(1-3) (1998) 179–191Kim, D., The number of convex polyominos with given perimeter70 (1988) 47–51Kim, D., seeM.D. Haiman 99 (1992) 115–122


Kim, J.H., On 3-colorings ofE(Kn) (Note) 118(1993) 269–273Kim, J.K. and S.G. Hahn, A new upper bound for binary codes with minimum distance four187 (1-3) (1998)

291–295Kim, P.,seeL. Pachter 190(1-3) (1998) 287–294Kim, S.-G.,seeJ.H. Kwak 156(1-3) (1996) 141–170Kimberling, C.,seeA.S. Fraenkel 126(1994) 137–149Kimelfeld, B.N.,seeA.K. Kelmans 44 (1983) 113–116Kimura, H., Classification of Hadamard matrices of order 28 with Hall sets128(1-3) (1994) 257–268Kimura, H., Classification of Hadamard matrices of order 28133(1-3) (1994) 171–180Kinch, L., seeR.J. Faudree 91 (1991) 45–59Kinch, L. and J. Lehel, The irregularity strength oftP3 (Note) 94 (1991) 75–79Kinch, L.F.,seeA. Gyárfás 69 (1988) 35–41Kinch, L.F.,seeJ.F. Fink 86 (1990) 47–57Kinckerbocker, C.J., P. Frazer Lock and M. Sheard, On the structure of graphs uniquely hamiltonian-connected

from a vertex 88 (1991) 33–48King, T. and G.L. Nemhauser, Some inequalities on the chromatic number of a graph10 (1974) 117–121Kingan, S.R., Binary matroids without prisms, prism duals, and cubes152(1-3) (1996) 211–224Kingan, S.R. and J.G. Oxley, On the matroids in which all hyperplanes are binary160(1-3) (1996) 265–271Kingan, S.R., A generalization of a graph result of D.W. Hall173(1-3) (1997) 129–135Kingan, S.R., Intersections of circuits and cocircuits in binary matroids195(1-3) (1999) 157–165Király, Z., seeA. Gyárfás 177(1-3) (1997) 99–122Király, Z., seeB. Guiduli 182(1-3) (1998) 139–151Kirby, M.J.L., H.R. Love and K. Swarup, Extreme point programming with nonlinear constraints5 (1973)

345–365Kirchherr, W.W., NEPS operations on cordial graphs115(1993) 201–209Kirillov, A.N., seeS. Fomin 153(1-3) (1996) 123–143Kirkpatrick, D.G.,seeP. Hell 49 (1984) 45–59Kirkpatrick, D.G.,seeK. Heinrich 85 (1990) 313–317Kirousis, L.M. and C.H. Papadimitriou, Interval graphs and searching55 (1985) 181–184Kirschenhofer, P. and H. Prodinger, A short proof for a partition identity of Hwang and Wei (Note) 52 (1984)

305–306Kiss, E.W.,seeJ.D. Berman 112(1993) 1–20Kiss, G.,seeJ.W.P. Hirschfeld 155(1-3) (1996) 107–119Kitagawa, F. and H. Ikeda, An existential problem of a weight-controlled subset and its application to school

timetable construction 72 (1988) 195–211Kjeldsen, K.,seeE. Andresen 14 (1976) 103–119Klabjan, D. and B. Mohar, The number of matchings of low order in hexagonal systems186 (1-3) (1998)

167–175Klain, D.A., Kinematic formulas for finite vector spaces179(1-3) (1998) 121–132Klarner, D. and J. Pollack, Domino tilings of rectangles with fixed width32 (1980) 45–52Klarner, D., The number of tiered posets modulo six62 (1986) 295–297Klarner, D.A. and R.L. Rivest, Asymptotic bounds for the number of convexn-ominoes 8 (1974) 31–40Klarner, D.A. and K. Post, Some fascinating integer sequences106/107(1992) 303–309Klavžar, S. and M. Petkovšek, Intersection graphs of halflines and halfplanes66 (1987) 133–137Klavžar, S.,seeW. Imrich 109(1992) 147–154Klavžar, S., Two remarks on retracts of graph products109(1992) 155–160Klavžar, S. and U. Milutinovic, Strong products of Kneser graphs133(1-3) (1994) 297–300Klavžar, S.,seeN. Cižek 134(1-3) (1994) 17–24Klavžar, S., Absolute retracts of split graphs134(1-3) (1994) 75–84Klavžar, S. and B. Mohar, The chromatic numbers of graph bundles over cycles138(1-3) (1995) 301–314Klavžar, S., Coloring graph products — A survey155(1-3) (1996) 135–145Klavžar, S. and B. Zmazek, On a Vizing-like conjecture for direct product graphs156(1-3) (1996) 243–246Klavžar, S.,seeJ. Hagauer 161(1-3) (1996) 143–149Klavžar, S., On the fractional chromatic number and the lexicographic product of graphs185(1-3) (1998) 259–

263


Klavžar, S., H.M. Mulder and R. Škrekovski, An Euler-type formula for median graphs187(1-3) (1998) 255–258

Klavžar, S.,seeV. Chepoi 192(1-3) (1998) 27–39Klawe, M.,seeJ.W. Grossman 28 (1979) 247–254Klazar, M.,seeR. Adamec 108(1992) 219–229Klazar, M., Extremal functions for sequences150(1-3) (1996) 195–203Klazar, M., On well quasiordering of finite languages163(1-3) (1997) 81–88Klazar, M., Combinatorial aspects of Davenport–Schinzel sequences165-166(1-3) (1997) 421–435Klazar, M., On numbers of Davenport–Schinzel sequences185(1-3) (1998) 77–87Klazar, M., Extremal problems for colored trees and Davenport–Schinzel sequences197-198(1-3) (1999) 469–

482Klee, V.,seeE. Engelhardt 78 (1989) 257–266Klee, V.,seeP. Gritzmann 136(1-3) (1994) 129–174Klee, V.L.,seeD.H. Doehlert 2 (1972) 309–334Klein, C.S. and S. Minsker, The super towers of Hanoi problem: large rings on small rings114(1993) 283–295Klein, R., On the colorability ofm-composed graphs133(1-3) (1994) 181–190Klein, S.T.,seeZ. Agur 70 (1988) 295–302Kleinschmidt, A.,seeT. Bier 176(1-3) (1997) 29–42Kleinschmidt, P., A Steinitz-type theorem for the projective plane32 (1980) 53–57Kleinschmidt, P. and C.W. Lee, Onk-stacked polytopes (Note) 48 (1984) 125–127Kleinschmidt, P. and S. Onn, On the diameter of convex polytopes (Communication) 102(1992) 75–77Kleitman, D., M. Edelberg and D. Lubell, Maximal sized antichains in partial orders1 (1971) 47–53Kleitman, D.,seeS. Fisk 32 (1980) 19–25Kleitman, D.J.,seeO.J. Heilmann 1 (1971) 19–27Kleitman, D.J. and B.L. Rothschild, Generalization of Kaplansky’s game2 (1972) 173–178Kleitman, D.J. and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors

6 (1973) 79–88Kleitman, D.J. and E.C. Milner, On the average size of the sets in a Sperner family6 (1973) 141–147Kleitman, D.J. and J. Spencer, Families ofk-independent sets6 (1973) 255–262Kleitman, D.J.,seeP. Erdös 8 (1974) 281–294Kleitman, D.J.,seeE. Bird 11 (1975) 191–198Kleitman, D.J., More on complementary trees15 (1976) 373–378Kleitman, D.J.,seeJ.R. Griggs 17 (1977) 281–289Kleitman, D.J.,seeD.B. West 27 (1979) 99–102Kleitman, D.J. and J.B. Shearer, Further gossip problems30 (1980) 151–156Kleitman, D.J.,seeJ. Kahn 33 (1981) 323–325Kleitman, D.J. and K.J. Winston, On the number of graphs without 4-cycles41 (1982) 167–172Kleitman, D.J., On a problem of Yuzvinsky on separating then-cube 60 (1986) 207–213Kleitman, D.J.,seeJ. Sha 63 (1987) 271–278Kleitman, D.J. and M. Fellows, Radius and diameter in Manhattan lattices73 (1988/89) 119–125Kleitman, D.J.,seeZ. Füredi 83 (1990) 129–134Kleitman, D.J.,seeM. Aigner 88 (1991) 113–119Kleitman, D.J.,seeN. Alon 103(1992) 111–119Kleitman, D.J.,seeA. Felzenbaum 117(1993) 107–112Kleitman, D.J.,seeW. Goddard 125(1994) 177–182Kleitman, D.J.,seeJ.R. Griggs 127(1-3) (1994) 209–212Klemm, M. and B. Wagner, A matrix of combinatorial numbers related to the symmetric groups28 (1979)

173–177Klin, M., seeM. Muzychuk 189(1-3) (1998) 191–207Klin, M., seeA. Betten 197-198(1-3) (1999) 83–109Kloks, T., An infinite sequence of01-regular graphs 73 (1988/89) 127–132Kløve, T.,seeT. Helleseth 18 (1977) 179–211Kløve, T., The modularn-queen problem (Note) 19 (1977) 289–291Kløve, T., The weight distribution for a class of irreducible cyclic codes (Note) 20 (1977) 87–90


Kløve, T., The weight distribution of linear codes over GF(ql) having generator matrix over GF(q) 23 (1978)159–168

Kløve, T., The modularn-queen problem II 36 (1981) 33–48Kløve, T.,seeW. Chen 98 (1991) 9–21Kløve, T., Support weight distribution of linear codes106/107(1992) 311–316Kløve, T.,seeW. Chen 148(1-3) (1996) 15–35Kløve, T.,seeW. Chen 175(1-3) (1997) 69–77Kløve, T., On codes satisfying the double chain condition175(1-3) (1997) 173–195Klugerman, M., A. Russell and R. Sundaram, On embedding complete graphs into hypercubes186(1-3) (1998)

289–293Knapp, W., On the distance distribution of homogeneous codes28 (1979) 59–63Knauer, U.,seeM. Böttcher 109(1992) 45–57Knessl, C., Asymptotic behavior of high-order differences of the plane partition function126(1994) 179–193Knickerbocker, C.J., P.F. Lock and M. Sheard, The minimum size of graphs hamiltonian-connected from a vertex

(Note) 76 (1989) 277–278Knickerbocker, C.J.,seeG.R.T. Hendry 187(1-3) (1998) 281–290Knill, E., A. Ehrenfeucht and D. Haussler, The size ofk-pseudotrees 141(1-3) (1995) 185–194Knisley, D.J.,seeR.J. Faudree 118(1993) 57–68Knoblauch, T., Using triangles to partition a disk (Note) 84 (1990) 209–211Knödel, W., New gossips and telephones (Note) 13 (1975) 95Knopfmacher, A. and J. Knopfmacher, Counting irreducible factors of polynomials over a finite field112(1993)

103–118Knopfmacher, A., On the degrees of irreducible factors of polynomials over a finite field196 (1-3) (1999)

197–206Knopfmacher, J.,seeA. Knopfmacher 112(1993) 103–118Knuth, D.E.,seeR.L. Graham 2 (1972) 17–29Knuth, D.E., Permutations with nonnegative partial sums5 (1973) 367–371Knuth, D.E., Random matroids12 (1975) 341–358Knuth, D.E.,seeP. Flajolet 75 (1989) 167–215Ko, C.W. and F. Ruskey, Solution of some multi-dimensional lattice path parity difference recurrence relations

71 (1988) 47–56Ko, C.-W., J. Lee and E. Steingrímsson, The volume of relaxed Boolean-quadric and cut polytopes163 (1-3)

(1997) 293–298Ko, H.-P. and D.K. Ray-Chaudhuri, Intersection theorems for group divisible difference sets39 (1982) 37–58Ko, T.-M., seeS. Dolinar 106/107(1992) 189–198Kobayashi, M.,seeK. Heinrich 92 (1991) 107–125Kocay, W.,seeB.L. Hartnell 92 (1991) 95–105Kocay, W. and G.H.J. van Rees, Some non-isomorphic(4t+4,8t+6,4t+3,2t+2,2t+1)-BIBD’s 92 (1991)

159–172Kocay, W., An extension of the multi-path algorithm for finding hamilton cycles101(1992) 171–188Kocay, W.L. and Z.M. Lui, More non-reconstructible hypergraphs72 (1988) 213–224Kocay, W.L., D.R. Stinson and S.A. Vanstone, On strong starters in cyclic groups85 (1985) 45–60Koch, H., On self-dual doubly-even extremal codes83 (1990) 291–300Kochol, M., Construction of crossing-critical graphs (Note) 66 (1987) 311–313Kochol, M., The notion and basic properties ofM-transversals (Note) 104(1992) 191–196Kochol, M., Compatible systems of representatives132(1-3) (1994) 115–126Kochol, M., A cyclically 6-edge-connected snark of order 118161(1-3) (1996) 297–300Koerlin, M., seeG.J. Chang 199(1-3) (1999) 11–25Koester, G., On 4-critical planar graphs with high edge density (Note) 98 (1991) 147–151Kogan, N. and A. Berman, Characterization of completely positive graphs114(1993) 297–304Koh, K.M., seeC.C. Chen 5 (1973) 207–213Koh, K.M., T. Tan and D.G. Rogers, Two theorems on graceful trees25 (1979) 141–148Koh, K.M., D.G. Rogers and T. Tan, Products of graceful trees31 (1980) 279–292Koh, K.M., seeC.C. Chen 49 (1984) 21–26Koh, K.M. and K.S. Poh, On the uniformity of the closed-set lattice of a tree61 (1986) 61–70


Koh, K.M. and K.S. Poh, Products of graphs with their closed-set lattices69 (1988) 241–251Koh, K.M. and K.S. Poh, Constructions of sensitive graphs which are not strongly sensitive72 (1988) 225–236Koh, K.M. and B.H. Goh, Two classes of chromatically unique graphs82 (1990) 13–24Koh, K.M. and C.P. Teo, The chromatic uniqueness of certain broken wheels (Note) 96 (1991) 65–69Koh, K.M., seeC.C. Chen 111(1993) 113–123Koh, K.M. and K.L. Teo, Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles127(1-3)

(1994) 243–258Koh, K.M., seeC.P. Teo 128(1-3) (1994) 327–335Koh, K.M. and B.P. Tan, Kings in multipartite tournaments147(1-3) (1995) 171–183Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite graph149 (1-3) (1996)

131–139Koh, K.M. and K.S. Poh, On the lower length of the closed-set lattice of a tree151(1-3) (1996) 121–130Koh, K.M. and B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings154(1-3) (1996) 281–287Koh, K.M. and C.P. Teo, Chromaticity of series–parallel graphs154(1-3) (1996) 289–295Koh, K.M. and B.P. Tan, The number of kings in a multipartite tournament167-168(1-3) (1997) 411–418Koh, K.M., seeF.M. Dong 169(1-3) (1997) 39–54Koh, K.M., seeC.C. Chen 172(1-3) (1997) 1Koh, K.M. and K.L. Teo, The search for chromatically unique graphs — II172(1-3) (1997) 59–78Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite graph [Discrete Math. 149

(1996) 131–139] (Addendum) 173(1-3) (1997) 297–298Koh, K.M., seeF.M. Dong 176(1-3) (1997) 97–113Koh, K.M. and E.G. Tay, On optimal orientations of cartesian products of graphs (I)190(1-3) (1998) 115–136Kohayakawa, Y. and J. Wojciechowski, On small graphs with highly imperfect powers104(1992) 245–261Kohayakawa, Y.,seeP. Erdos 177(1-3) (1997) 267–271Köhler, E., Allgemeine Schnittzahlen int-designs 73 (1988/89) 133–142Koike, K., On a conjecture of Stanley on Jack symmetric functions115(1993) 211–216Kojman, M.,seeM. Goldstern 149(1-3) (1996) 69–82Kolb, E., Hjelmslev planes over nearrings155(1-3) (1996) 147–155Kolberg, H.,seeA. Kemnitz 191(1-3) (1998) 113–123Kolen, A.W.J.,seeJ.I. Hall 17 (1977) 71–83Kolesnik, G.,seeP. Erdos 200(1-3) (1999) 101–117Kolesova, G.,seeC.W.H. Lam 92 (1991) 187–195Kolev, E. and R. Hill, An improved lower bound on the covering numberK2(9,1) 197-198(1-3) (1999) 483–489Kolitsch, L.W., A simple proof of some congruences for colored generalized Frobenius partitions81 (1990)

259–261Kołodziejczyk, K.,seeR. Ding 68 (1988) 171–177Kołodziejczyk, K., Borsuk covering and planar sets with unique completion122(1993) 235–244Kołodziejczyk, K., The boundary characteristic and the volume of lattice polyhedra190(1-3) (1998) 137–148Kolossa, K., On the on-line chromatic number of the family of on-line 3-chromatic graphs150 (1-3) (1996)

205–230Kolountzakis, M.N., An effective additive basis for the integers145(1-3) (1995) 307–313Komar, J.,seeA. Idzik 66 (1987) 119–125Komar, J.,seeS. Bylka 164(1-3) (1997) 33–45Komjáth, P.,seeP. Erdös 59 (1986) 21–34Komjáth, P. and J. Pach, Universal elements and the complexity of certain classes of infinite graphs95 (1991)

255–270Komjáth, P., Some remarks on universal graphs199(1-3) (1999) 259–265Komlós, J. and E. Szemerédi, Limit distribution for the existence of Hamiltonian cycles in a random graph43

(1983) 55–63Komlós, J. and W.O.J. Moser, Almost all trees have tribe number 2 or 3143(1-3) (1995) 281–285Komlós, J.,seeR. Csákány 199(1-3) (1999) 193–199Kommel, H.J.,seeF. Harary 26 (1979) 235–241Konheim, A.G. and D.J. Newman, A note on growing binary trees4 (1973) 57–63Konieczna, U., Asymptotic normality of subcubes in random subgraphs of then-cube 121(1993) 117–122König, J.-C. and D. Sotteau, Symmetric routings of the hypercube121(1993) 123–134


Koolen, J., V. Moulton and U. Tönges, The coherency index192(1-3) (1998) 205–222Koolen, J.H.,seeJ.M. van den Akker 81 (1990) 103–109Koolen, J.H.,seeA.E. Brouwer 120(1993) 241–247Koppelberg, S.,seeI. Düntsch 53 (1985) 63–78Korach, E. and Z. Ostfeld, Recognition of DFS trees: sequential and parallel algorithms with refined verifications

114(1993) 305–327Korchmáros, G.,seeA. Bonisoli 161(1-3) (1996) 13–24Kordecki, W., Random subgraphs of then-cycle and then-wheel 93 (1991) 35Kordecki, W. and T. Łuczak, On the connectivity of random subsets of projective spaces196(1-3) (1999) 207–

217Korec, I., Improvement of Mycielski’s inequality for non-natural disjoint covering systems ofZ 64 (1987)

27–38Koren, M., Graphs with degrees from prescribed intervals15 (1976) 253–261Korfhage, R.R., A note on quadraticσ -polynomials (Note) 69 (1988) 195–196Korman, V.,seeR. Aharoni 131(1-3) (1994) 1–7Körner, J. and V.K. Wei, Odd and even Hamming spheres also have minimum boundary51 (1984) 147–165Körner, J. and V.K. Wei, Addendum to “Odd and even Hamming spheres also have minimum boundary” (Note)

62 (1986) 105–106Körner, J., Intersection number and capacities of graphs142(1-3) (1995) 169–184Korte, B.,seeD. Hausmann 24 (1978) 261–276Korte, B. and L. Lovász, Non-interval greedoids und the transposition property59 (1986) 297–314Korte, B. and L. Lovász, The intersection of matroids and antimatroids73 (1988) 143–157Korzhik, V., seeF. Harary 122(1993) 197–204Korzhik, V.P., A nonorientable triangular embedding ofKn −K2, n≡ 8(mod 12) 141(1-3) (1995) 195–211Korzhik, V.P., A tighter bounding interval for the 1-chromatic number of a surface169(1-3) (1997) 95–120Korzhik, V.P., A possibly infinite series of surfaces with known 1-chromatic number173(1-3) (1997) 137–149Korzhik, V.P., Nonadditivity of the 1-genus of a graph184(1-3) (1998) 253–258Korzhik, V.P., Triangular embeddings ofKn–Km with unboundedly largem 190(1-3) (1998) 149–162Koschnick, K.U.,seeR. Ahlswede 47 (1983) 137–152Koseleff, P.-V., Relations among Lie-series transformations and isomorphisms between free Lie algebras180

(1-3) (1998) 243–254Koskas, M., Complexités de suites de Toeplitz183(1-3) (1998) 161–183Kostochka, A.,seeM. Axenovich 138(1-3) (1995) 57–62Kostochka, A. and J. Kratochvíl, Covering and coloring polygon–circle graphs163(1-3) (1997) 299–305Kostochka, A.V. and L.S. Mel’nikov, Note to the paper of Grünbaum on acyclic colorings (Note) 14 (1976)

403–406Kostochka, A.V., The total coloring of a multigraph with maximal degree 417 (1977) 161–163Kostochka, A.V., List edge chromatic number of graphs with large girth101(1992) 189–201Kostochka, A.V.,seeD.G. Fon-Der-Flaass 120(1993) 269–275Kostochka, A.V., The total chromatic number of any multigraph with maximum degree five is at most seven162

(1-3) (1996) 199–214Kostochka, A.V., M. Stiebitz and B. Wirth, The colour theorems of Brooks and Gallai extended162(1-3) (1996)

299–303Kostochka, A.V.,seeE. Györi 163(1-3) (1997) 279–284Kostochka, A.V.,seeT. Böhme 170(1-3) (1997) 219–222Kostochka, A.V.,seeO.V. Borodin 188(1-3) (1998) 73–85Kostochka, A.V.,seeN.I. Glebov 188(1-3) (1998) 261–266Kostochka, A.V.,seeO.V. Borodin 191(1-3) (1998) 45–49Kostochka, A.V. and M. Stiebitz, Colour-critical graphs with few edges191(1-3) (1998) 125–137Kotani, K.,k-Regular factors and semi-k-regular factors in graphs186(1-3) (1998) 177–193Kotzig, A., Decompositions of complete graphs into regular bichromatic factors2 (1972) 383–387Kotzig, A., Decompositions of complete graphs into regular bichromatic factors4 (1973) 65–69Kotzig, A., Transformations of edge-colourings of cubic graphs11 (1975) 391–399Kotzig, A., On the maximal order of cyclicity of antisymmetric directed graphs12 (1975) 17–25


Kotzig, A. and J. Turgeon, On certain constructions for latin squares with no latin subsquares of order two16(1976) 263–270

Kotzig, A. and J. Turgeon, Regular perfect systems of difference sets20 (1977) 249–254Kotzig, A., seeC. Huang 27 (1979) 261–277Kotzig, A., seeJ. Abrham 37 (1981) 143–146Kotzig, A., seeJ. Abrham 52 (1984) 287–291Kotzig, A., seeA. Berman 69 (1988) 107–114Kotzig, A., seeJ. Abrham 135(1-3) (1994) 1–14Kotzig, A., seeJ. Abrham 150(1-3) (1996) 3–15Koubek, V. and J. Rajlich, Combinatorics of separation by binary matrices (Note) 57 (1985) 203–208Kouider, M.,seeF. Jaeger 46 (1983) 93–94Kouider, M. and D. Sotteau, On the existence of a matching orthogonal to a 2-factorization (Communication)

73 (1989) 301–304Koukouvinos, C. and S. Kounias, Hadamard matrices of the Williamson type of order 4· m, m = p · q an

exhaustive search form= 33 68 (1988) 45–57Koukouvinos, C. and S. Kounias, Construction of some Hadamard matrices with maximum excess85 (1990)

295–300Koukouvinos, C., S. Kounias and J. Seberry, Supplementary difference sets and optimal designs88 (1991)

49–58Koukouvinos, C. and J. Seberry, Hadamard matrices of order≡ 8(mod16) with maximal excess 92 (1991)

173–176Koukouvinos, C.,seeS. Kounias 92 (1991) 177–185Kounias, S. and Ch. Damianou, On an inequality in probability (Note) 22 (1978) 85–89Kounias, S., M. Lefkopoulou and C. Bagiatis,G-optimalN -observation first order 2k designs 46 (1983) 21–31Kounias, S.,seeTh. Chadjipantelis 57 (1985) 211–216Kounias, S.,seeN. Farmakis 67 (1987) 165–176Kounias, S.,seeC. Koukouvinos 68 (1988) 45–57Kounias, S. and N. Farmakis, On the excess of Hadamard matrices68 (1988) 59–69Kounias, S.,seeC. Koukouvinos 85 (1990) 295–300Kounias, S.,seeC. Koukouvinos 88 (1991) 49–58Kounias, S., C. Koukouvinos and K. Sotirakoglou, On Golay sequences92 (1991) 177–185Kountanis, D.,seeB.P. Mull 143(1-3) (1995) 209–220Koutas, P.J. and T.C. Hu, Shortest string containing all permutations11 (1975) 125–132Koutras, M., Non-central Stirling numbers and some applications42 (1982) 73–89Koutras, M.,seeCh.A. Charalambides 47 (1983) 183–201Kovács, P., The minimal trivalent graphs with given smallest odd cycle54 (1985) 295–299Kramer, E.S., Indecomposable triple systems8 (1974) 173–180Kramer, E.S. and D.M. Mesner, On Steiner tableaus10 (1974) 123–131Kramer, E.S. and D.M. Mesner,t-designs on hypergraphs15 (1976) 263–296Kramer, E.S., A generalized room square GRS(4, 24) of dimension 9 (Note) 20 (1977) 91–92Kramer, E.S., S.S. Magliveras and D.M. Mesner,t-designs from the large Mathieu groups36 (1981) 171–189Kramer, E.S.,seeH. Hanani 45 (1983) 75–97Kramer, E.S.,seeL.G. Chouinard II 46 (1983) 227–240Kramer, E.S., S.S. Magliveras and R. Mathon, The Steiner systemsS(2,4,25) with nontrivial automorphism

group 77 (1989) 137–157Kramer, E.S., AnS3(3,5,21) using graphs (Note) 81 (1990) 223–224Kramer, E.S., Q.-R. Wu, S.S. Magliveras and T. van Trung, Some perpendicular arrays for arbitrarily larget 96

(1991) 101–110Krasikov, I. and J. Schönheim, The reconstruction of a tree from its number desk53 (1985) 137–145Krasikov, I., On a tree-cutting problem of P. Ash93 (1991) 55–61Krasikov, I.,seeN. Alon 114(1993) 3–7Krasikov, I. and J. Schonheim, On near subgroups124(1994) 133–136Krasikov, I.,seeY. Caro 125(1994) 101–106Krasikov, I., Degree conditions for vertex switching reconstruction160(1-3) (1996) 273–278Kratochvíl, J.,seeS. Janson 108(1992) 307–326


Kratochvíl, J., Regular codes in regular graphs are difficult133(1-3) (1994) 191–205Kratochvíl, J.,seeA. Kostochka 163(1-3) (1997) 299–305Kratochvíl, J. and A. Kubena, On intersection representations of co-planar graphs178(1-3) (1998) 251–255Kratochvíl, J., Zs. Tuza and M. Voigt, Complexity of choosing subsets from color sets191(1-3) (1998) 139–148Kratsch, D., Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs86

(1990) 225–238Kratsch, D., P. Damaschke and A. Lubiw, Dominating cliques in chordal graphs128(1-3) (1994) 269–275Kratsch, D., J. Lehel and H. Müller, Toughness, hamiltonicity and split graphs150(1-3) (1996) 231–245Kratsch, D. and J.-X. Rampon, Width two posets are reconstructible162(1-3) (1996) 305–310Kratsch, D.,seeJ.S. Deogun 170(1-3) (1997) 99–106Kratsch, D. and J.-X. Rampon, Tree-visibility orders190(1-3) (1998) 163–175Krattenthaler, C. and S.G. Mohanty,q-Generalization of a ballot problem126(1994) 195–208Krattenthaler, C. and S.G. Mohanty, Counting tableaux with row and column bounds139(1-3) (1995) 273–285Krattenthaler, C. and R.A. Sulanke, Counting pairs of nonintersecting lattice paths with respect to weighted turns

153(1-3) (1996) 189–198Krattenthaler, C.,seeM. Fulmek 161(1-3) (1996) 101–120Kratzke, T.M. and D.B. West, The total interval number of a graph, I: Fundamental classes118(1993) 145–156Kreher, D.L.,seeL.G. Chouinard II 46 (1983) 227–240Kreher, D.L.,seeD. de Caen 91 (1991) 65–77Kreher, D.L., G.F. Royle and W.D. Wallis, A family of resolvable regular graph designs156(1-3) (1996) 269–

275Kreinin, A. and A. Vainshtein, Asymptotics for Morgan numbers of fractional orders161(1-3) (1996) 301–308Kreweras, G., Sur les partitions non croisees d’un cycle1 (1972) 333–350Kreweras, G., Sur les extensions lineaires d’une famille particuliere d’ordres partiels27 (1979) 279–295Kreweras, G., Denombrement des ordres etages53 (1985) 147–149Kreweras, G. and P. Moszkowski, Signatures des permutations et des mots extraits68 (1988) 71–76Kreweras, G. and P. Moszkowski, Tree codes that preserve increases and degree sequences87 (1991) 291–296Kriegl, A., A characterization of reduced incidence algebras34 (1981) 141–144Krishnamoorthy, V. and K.R. Parthasarathy, On the reconstruction of separable graphs from elementary

contractions 38 (1982) 197–205Krivelevich, M., On a conjecture of Tuza about packing and covering of triangles142(1-3) (1995) 281–286Krivelevich, M., Almost perfect matchings in random uniform hypergraphs170(1-3) (1997) 259–263Krivelevich, M., A lower bound for irredundant Ramsey numbers183(1-3) (1998) 185–192Kríž, I. and R. Thomas, Analyzing Nash-Williams’ partition theorem by means of ordinal types95 (1991)

135–167Krob, D.,seeF. Bergeron 139(1-3) (1995) 463–468Krogdahl, S., The dependence graph for bases in matroids19 (1977) 47–59Krogdahl, S.,seeI. Beck 94 (1991) 141–145Kröger, H., Distributive lattices as a generalization of Brouwerian lattices (Note) 20 (1977) 297–299Krol, H.J. and H.J. Veldman, On maximum criticallyh-connected graphs52 (1984) 225–234Krompart, L.B.,seeK.L. Collins 169(1-3) (1997) 29–38Kronk, H.V. and J. Mitchem, A seven-color theorem on the sphere5 (1973) 253–260Krumme, D.W., Reordered gossip schemes156(1-3) (1996) 113–140Kríž, I. and R. Thomas, Clique-sums, tree-decompositions and compactness81 (1990) 177–185Kríž, I., All trapezoids are Ramsey108(1992) 59–62Kuba, A.,seeR. Aharoni 171(1-3) (1997) 1–16Kubale, M., Interval vertex-coloring of a graph with forbidden colors74 (1989) 125–136Kubale, M., Interval edge coloring of a graph with forbidden colors121(1993) 135–143Kubale, M. and K. Piwakowski, A linear time algorithm for edge coloring of binomial trees150 (1-3) (1996)

247–256Kubale, M., J. Pakulski and K. Piwakowski, The smallest hard-to-color graph for the SL algorithm164 (1-3)

(1997) 197–212Kubena, A.,seeJ. Kratochvíl 178(1-3) (1998) 251–255Kubiak, W.,seeM. Dror 195(1-3) (1999) 103–109Kubo, T. and R. Vakil, On Conway’s recursive sequence152(1-3) (1996) 225–252


Kühnel, W. and G. Lassmann, Permuted difference cycles and triangulated sphere bundles162 (1-3) (1996)215–227

Kulkarni, D.M.,seeS.S. Abhyankar 79 (1989/90) 1–48Kulkarni, D.M.,seeS.S. Abhyankar 85 (1990) 115–166Kulkarni, D.M., Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal154(1-3)

(1996) 141–151Kumar, P.V.,seeT. Helleseth 145(1-3) (1995) 133–143Kumar, P.V.,seeT. Helleseth 152(1-3) (1996) 185–190Kumari, M., Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of

compound matrices 56 (1985) 203–215Kundu, S. and E.L. Lawler, A matroid generalization of a theorem of Mendelsohn and Dulmage4 (1973) 159–

163Kundu, S., Thek-factor conjecture is true 6 (1973) 367–376Kundu, S., A factorization theorem for a certain class of graphs8 (1974) 41–47Kundu, S., Generalizations of thek-factor theorem 9 (1974) 173–179Kung, J.P.S., The core extraction axiom for combinatorial geometries19 (1977) 167–175Kung, J.P.S.,seeO. D’Antona 32 (1980) 95–98Kung, J.P.S., Jacobi’s identity and the König–Egerváry theorem49 (1984) 75–77Kuo, D., G.J. Chang and Y.H.H. Kwong, Cordial labeling ofmKn 169(1-3) (1997) 121–131Kupitz, Y.S., On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a

prescribed set of vertices120(1993) 121–134Kupitz, Y.S., On convex segments in a triangulation (Note) 120(1993) 277–285Kuplinsky, J.,seeP. Hansen 96 (1991) 199–212Kuplinsky, J.,seeP. Hansen 111(1993) 305–312Kuriki, S. and M. Jimbo, On 1-rotationalSλ(2,3, v) designs 46 (1983) 33–40Kuriki, S., seeM. Jimbo 46 (1983) 249–255Kuriki, S., seeM. Kuwada 61 (1986) 221–233Kuriki, S., seeR. Fuji-Hara 76 (1989) 29–35Kuriki, S., seeR. Fuji-Hara 97 (1991) 167–176Kuriki, S., System of equations related to the existence conditions for arrays110(1992) 155–164Kuriki, S., On existence and construction of balanced arrays116(1993) 137–155Kurth, W., Enumeration of platonic maps on the torus61 (1986) 71–83Kurtz, D.C., Asymptotic properties of triangular arrays of numbers4 (1973) 165–169Kurzweil, H., A combinatorial technique for simplicial complexes and some applications to finite groups82

(1990) 263–278Kuwada, M. and S. Kuriki, Some existence conditions for partially balanced arrays with 2 symbols61 (1986)

221–233Kuwada, M., Robustness of balanced fractional 2m factorial designs derived from simple arrays116 (1993)

183–208Kuwada, M., Analysis of variance of balanced fractional factorial designs116(1993) 335–366Kwak, J.H. and J. Lee, Enumeration of graph embeddings135(1-3) (1994) 129–151Kwak, J.H.,seeS. Hong 148(1-3) (1996) 85–105Kwak, J.H., S.-G. Kim and J. Lee, Distributions of regular branched prime-fold coverings of surfaces156(1-3)

(1996) 141–170Kwak, J.H. and J. Lee, Distribution of branchedDp-coverings of surfaces183(1-3) (1998) 193–212Kwasnik, M., The primitivity of the strong product of two directed graphs121(1993) 145–150Kwasnik, M. and A. Szelecka, Strong perfectness of the generalized Cartesian product of graphs164 (1-3)

(1997) 213–220Kwong, Y.H.H.,seeD. Kuo 169(1-3) (1997) 121–131Kyriakoussis, A., A central limit theorem for numbers satisfying a class of triangular arrays51 (1984) 41–46Kyriakoussis, A.,seeCh.A. Charalambides 54 (1985) 259–270Labahn, R.,seeH.-D.O.F. Gronau 61 (1986) 321–324Labahn, R., Information flows on hypergraphs113(1993) 71–97Labahn, R. and I. Warnke, Quick gossiping by telegraphs (Note) 126(1994) 421–424Labahn, R., Kernels of minimum size gossip schemes143(1-3) (1995) 99–139


Labelle, G., Dérivées directionnelles et développements de Taylor combinatoires79 (1989/90) 279–297Labelle, G.,seeH. Décoste 99 (1992) 31–48Labelle, G., On asymmetric structures99 (1992) 141–164Labelle, G.,seeY. Chiricota 115(1993) 77–93Labelle, G.,seeP. Bouchard 139(1-3) (1995) 49–56Labelle, G. and L. Laforest, Sur la distribution de l’arité de la racine d’une arborescence hyperquaternaire ád

dimensions 139(1-3) (1995) 287–302Labelle, G.,seeH. Décoste 153(1-3) (1996) 59–67Labelle, G. and L. Laforest, Etude de constantes universelles pour les arborescences hyperquaternaires de

recherche 153(1-3) (1996) 199–211Labelle, G.,seeI. Constantineau 157(1-3) (1996) 53–64Labelle, G. and P. Leroux, Enumeration of (uni- or bicolored) plane trees according to their degree distribution

157(1-3) (1996) 227–240Labelle, J. and Y.N. Yeh, Combinatorial proofs of some limit formulas involving orthogonal polynomials79

(1989/90) 77–93Labelle, J. and Y.-N. Yeh, Generalized Dyck paths (Invited paper) 82 (1990) 1–6Laborde, J.-M., Sur le cardinal maximum de la base complete d’une fonction booleenne, en fonction du nombre

de conjonctions de l’une de ses formes normales (Communication) 32 (1980) 209–212Laborde, J.-M. and S.P. Rao Hebbare, Another characterization of hypercubes39 (1982) 161–166Laborde, J.-M., Regularisation numerique d’orbites53 (1985) 151–155Laborde, J.-M.,seeG. Burosch 87 (1991) 85–88Laborde, J.-M.,seeG. Burosch 110(1992) 9–16Laborde, J.-M.,seeG. Burosch 152(1-3) (1996) 69–91Laborde, J.M. and R.M. Madani, Generalized hypercubes and (0,2)-graphs165-166(1-3) (1997) 445–457Lachaud, G., Distribution of the weights of the dual of the Melas code (Communication) 79 (1989/90) 103–106Lachaud, G., The parameters of projective Reed–Müller codes (Communication) 81 (1990) 217–221Laczkovich, M., Tilings of triangles 140(1-3) (1995) 79–94Laforest, L.,seeG. Labelle 139(1-3) (1995) 287–302Laforest, L.,seeG. Labelle 153(1-3) (1996) 199–211Lagarias, J.C.,seeF.K. Hwang 19 (1977) 257–264Lagarias, J.C.,seeP.C. Fishburn 91 (1991) 149–159Lahtonen, J., An optimal polynomial for a covering radius problem (Note) 105(1992) 313–317Lai, C., On the size of graphs with all cycle having distinct length (Note) 122(1993) 363–364Lai, H., seeH.-J. Lai 110(1992) 165–177Lai, H.-J., On the Hamiltonian index69 (1988) 43–53Lai, H.-J., Graph whose edges are in small cycles94 (1991) 11–22Lai, H.-J. and H. Lai, Duality in graph families110(1992) 165–177Lai, H.-J. and C.-Q. Zhang, Nowhere-zero 3-flows of highly connected graphs110(1992) 179–183Lai, H.-J.,seeP.A. Catlin 141(1-3) (1995) 37–46Lai, H.-J. and G. Weng, Strength and fractional arboricity of complementary graphs143(1-3) (1995) 141–151Lai, H.-J., Supereulerian graphs and excluded induced minors146(1-3) (1995) 133–143Lai, H.-J.,seeP.A. Catlin 160(1-3) (1996) 81–91Lai, H.-J., Eulerian subgraphs containing given vertices and hamiltonian line graphs178(1-3) (1998) 93–107Lake, J., A problem concerning infinite graphs14 (1976) 343–345Lakser, H., The homology of a lattice1 (1971) 187–192Lalanne, J.C., Polyominos parallélogrammes à franges et fonctions de Bessel115(1993) 217–230Lallement, G., Cyclotomic polynomials and unions of groups24 (1978) 19–36Lallement, G. and D. Perrin, A graph covering construction of all the finite complete biprefix codes36 (1981)

261–271Lalonde, F., Le probleme d’etoiles pour graphes est NP-complet33 (1981) 271–280Lalonde, P., Lyndon heaps:An analogue of Lyndon words in free partially commutative monoids145 (1-3)

(1995) 171–189Lalonde, P., A non-commutative version of Jacobi’s equality on the cofactors of a matrix158 (1-3) (1996)

161–172Lam, C.W.H., The distribution of 1-widths of (0, 1)-matrices20 (1977) 109–122


Lam, C.W.H., Distance transitive digraphs29 (1980) 265–274Lam, C.W.H., Non-skew symmetric orthogonal matrices with constant diagonals43 (1983) 65–78Lam, C.W.H., L. Thiel, S. Swiercz and J. McKay, The nonexistence of ovals in a projective plane of order 10

(Communication) 45 (1983) 319–321Lam, C.W.H., G. Kolesova and L. Thiel, A computer search for finite projective planes of order 992 (1991)

187–195Lam, C.W.H.,seeD.A. Preece 125(1994) 319–327Lam, K.S.,seeC.-K. Lim 151(1-3) (1996) 161–167Lam, P.C.B., W.C. Shiu, W.H. Chan and Y. Lin, On the bandwidth of convex triangulation meshes173 (1-3)

(1997) 285–289Lam, T.K.,Bn Stanley symmetric functions157(1-3) (1996) 241–270Lambeck, E.W., On distance regular graphs withci = b1 (Note) 113(1993) 275–276Lamberty, U.,seeA. Beutelspacher 45 (1983) 141–152Lamken, E., R. Rees and S. Vanstone, Class-uniformly resolvable pairwise balanced designs with block sizes two

and three 92 (1991) 197–209Lamken, E.R. and S.A. Vanstone, Existence results for KS3(v;2,4)s 62 (1986) 197–210Lamken, E.R. and S.A. Vanstone, Balanced tournament designs and related topics77 (1989) 159–176Lamken, E.R. and S.A. Vanstone, Balanced tournament designs and resolvable(v,3,2)-BIBDs 83 (1990) 37–

47Lamken, E.R., 3-Complementary frames and doubly near resolvable(v,3,2)-BIBDs 88 (1991) 59–78Lamken, E.R., The existence of 3 orthogonal partitioned incomplete Latin squares of typetn 89(1991) 231–251Lamken, E.R., On near generalized balanced tournament designs97 (1991) 279–294Lamken, E.R. and S.A. Vanstone, Existence results for doubly near resolvable(v,3,2)-BIBDs 120(1993) 135–

148Lamken, E.R., Constructions for generalized balanced tournament designs131(1-3) (1994) 127–151Lamken, E.R., The existence of KS3(v;2,4) 186(1-3) (1998) 195–216Landauer, C., Lloyd’s theorem for perfect codes21 (1978) 189–200Landgev, I. and V.D. Tonchev, Automorphisms of 2-(22,8,4) designs 77 (1989) 177–189Landgev, I.N., On block design with repeated blocks106/107(1992) 317–328Landman, B.M. and R.N. Greenwell, Values and bounds for Ramsey numbers associated with polynomial

iteration 68 (1988) 77–83Landman, B.M., Ramsey functions related to the van der Waerden numbers102(1992) 265–278Langston, M.A. and B.C. Plaut, On algorithmic applications of the immersion order182(1-3) (1998) 191–196La Poutré, J.A., A theorem on associative block designs (Note) 58 (1986) 205–208La Poutré, J.A., J. van Leeuwen and M.H. Overmars, Maintenance of 2- and 3-edge-connected components of

graphs I 114(1993) 329–359Lapscher, F., Proprietes de “longueur de chaine” dans l’ensemble des fermetures superieures sur un ensemble

ordonne 7 (1974) 129–140Larose, B. and L. Zádori, Algebraic properties and dismantlability of finite posets163(1-3) (1997) 89–99Larrión, F. and V. Neumann-Lara, Clique divergent graphs with unbounded sequence of diameters197-198

(1-3) (1999) 491–501Larson, J.A.,seeP. Erdos 95 (1991) 169–182Lascoux, A. and M.-P. Schützenberger, Décompositions dans l’algèbre des différences divisées99 (1992) 165–

179Lascoux, A. and P. Pragacz, Divided differences and ideals generated by symmetric polynomials126 (1994)

209–215Lascoux, A., Polynômes de Schubert Une approche historique139(1-3) (1995) 303–317Lashkia, V., M. Miyakawa, A. Nozaki, G. Pogosyan and I.G. Rosenberg, Semirigid sets of diamond orders156

(1-3) (1996) 277–283Laskar, R.,seeA. Pellerin 12 (1975) 27–36Laskar, R. and B. Auerbach, On decomposition ofr-partite graphs into edge-disjoint Hamilton circuits14

(1976) 265–268Laskar, R.,seeJ. Dunbar 22 (1978) 1–24Laskar, R.,seeR.B. Allan 23 (1978) 73–76Laskar, R. and B. Auerbach, On complementary graphs with no isolated vertices24 (1978) 113–118


Laskar, R.,seeR.B. Allan 49 (1984) 7–13Laskar, R.,seeE.J. Cockayne 72 (1988) 35–47Laskar, R., S. Stueckle and B. Piazza, On the edge-integrity of some graphs and their complements122(1993)

245–253Laskar, R.C.,seeS.T. Hedetniemi 86 (1990) 3–9Laskar, R.C.,seeS.T. Hedetniemi 86 (1990) 257–277Laskar, R.C.,seeJ.E. Dunbar 138(1-3) (1995) 229–246Laskar, R.C.,seeG.S. Domke 167-168(1-3) (1997) 249–259Lassmann, G., On 4-isomorphisms of graphs49 (1984) 79–81Lassmann, G.,seeW. Kühnel 162(1-3) (1996) 215–227Las Vergnas, M.,seeJ.C. Fournier 2 (1972) 407–410Las Vergnas, M.,seeJ.-C. Fournier 7 (1974) 99–106Las Vergnas, M., Sur les arborescences dans un graphe oriente15 (1976) 27–39Las Vergnas, M.,seeR. Cordovil 26 (1979) 213–217Las Vergnas, M., Fundamental circuits and a characterization of binary matroids (Note) 31 (1980) 327Las Vergnas, M., On products of matroids36 (1981) 49–55Las Vergnas, M.,seeP. Duchet 46 (1983) 319–321Las Vergnas, M.,seeJ.-C. Bermond 50 (1984) 9–13Las Vergnas, M.,seeC. Berge 50 (1984) 107–108Las Vergnas, M.,seeP. Duchet 62 (1986) 145–154Las Vergnas, M.,seeY.O. Hamidoune 65 (1987) 157–171Las Vergnas, M.,seeY.O. Hamidoune 72 (1988) 163–166Latha, L.P.,seeE. Sampathkumar 161(1-3) (1996) 235–242Latteux, M., Problemes decidables concernant les TOL-langages unaires17 (1977) 165–172Laue, H., A graph theoretic proof of the fundamental trace identity (Note) 69 (1988) 197–198Laue, R.,seeA. Betten 197-198(1-3) (1999) 83–109Laue, R.,seeA. Betten 197-198(1-3) (1999) 111–121Laufer, P.J. and J.M. Turgeon, On a conjecture of Paul Erdös for perfect systems of difference sets47 (1983)

255–266Lauff, R.,seeM. Hornák 146(1-3) (1995) 109–121Laurent, M.,seeM. Conforti 69 (1988) 165–171Laurent, M. and M. Deza, Bouquets of geometric lattices: Some algebraic and topological aspects75 (1989)

279–313Laurent, M.,seeM. Deza 106/107(1992) 163–179Laurent, M.,seeT. Huang 114(1993) 237–252Laurent, M.,seeM. Deza 119(1993) 21–48Laurent, M.,seeM. Deza 119(1993) 49–66Laurent, M.,seeC. De Simone 127(1-3) (1994) 105–130Laurent, M., Hilbert bases of cuts150(1-3) (1996) 257–279Laurent, M., Graphic vertices of the metric polytope151(1-3) (1996) 131–153Laurent, M.,seeJ. Edmonds 165-166(1-3) (1997) 209–216Lauri, J., Proof of Harary’s conjecture on the reconstruction of trees43 (1983) 79–90Lauri, J., Large sets of pseudosimilar vertices155(1-3) (1996) 157–160Lauri, J., On a formula for the number of Euler trails for a class of digraphs163(1-3) (1997) 307–312Laviolette, F., Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree130

(1-3) (1994) 83–87Laviolette, F. and N. Polat, Spanning trees of countable graphs omitting sets of dominated ends194(1-3) (1999)

151–172Lavrenchenko, S., An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely

embeddable in the torus (Communication) 66 (1987) 299–301Lawler, E.L.,seeS. Kundu 4 (1973) 159–163Lawler, G.F., Expected hitting times for a random walk on a connected graph61 (1986) 85–92Lawrence, J., Covering the vertex set of a graph with subgraphs of smaller degree21 (1978) 61–68Lawrence, K.M.,seeR.A. Brualdi 147(1-3) (1995) 57–72Lawrence, S.L.,seeR.J. Faudree 10 (1974) 269–277


Lawrencenko, S.,seeF. Harary 122(1993) 197–204Lawrencenko, S., S. Negami and A.T. White, Three nonisomorphic triangulations of an orientable surface with

the same complete graph135(1-3) (1994) 367–369Lawrencenko, S.,seeB. Chen 188(1-3) (1998) 233–238Lawson, C.L., Transforming triangulations3 (1972) 365–372Lawson, J.D., M. Mislove and H. Priestley, Ordered sets with no infinite antichains63 (1987) 225–230Laywine, C., A counter-example to a conjecture relating complete sets of frequency squares and affine geometries

122(1993) 255–262Lazarte, L.,seeM.R. Emamy-K 78 (1989) 239–256Lazebnik, F., Some corollaries of a theorem of Whitney on the chromatic polynomial87 (1991) 53–64Lazebnik, F.,seeG. Ebert 93 (1991) 131–142Lazebnik, F., V.A. Ustimenko and A.J. Woldar, A characterization of the components of the graphsD(k,q) 157

(1-3) (1996) 271–283Lazebnik, F., V.A. Ustimenko and A.J. Woldar, Polarities and 2k-cycle-free graphs 197-198(1-3) (1999) 503–

513Leader, I., A short proof of a theorem of Vámos on matroid representations75 (1989) 315–317Leader, I.,seeB. Bollobás 122(1993) 15–35Leader, I.,seeB. Bollobás 162(1-3) (1996) 31–48Leclerc, B., Arbres et dimension des ordres14 (1976) 69–76Leclerc, B.,seeC. Flament 46 (1983) 159–171Leclerc, B., Lattice valuations, medians and majorities111(1993) 345–356Leclerc, B., Powers of staircase Schur functions and symmetric analogues of Bessel polynomials153 (1-3)

(1996) 213–227Leclerc, B., Families of chains of a poset and Sperner properties165-166(1-3) (1997) 437–444Leclerc, B. and J.-Y. Thibon, Preface180(1-3) (1998) 1Leclerc, B. and V. Makarenkov, On some relations between 2-trees and tree metrics192(1-3) (1998) 223–249Leclerc, M., Optimizing over a slice of the bipartite matching polytope73 (1988/89) 159–162Leclerc, M.,seeF. Rendl 73 (1988/89) 207–212Lee, C.W.,seeP. Kleinschmidt 48 (1984) 125–127Lee, C.W.,seeG. Bohus 187(1-3) (1998) 259–264Lee, H.,seeP.C. Fishburn 61 (1986) 165–179Lee, J.,seeJ. Ho Kwak 105(1992) 131–142Lee, J.,seeJ.H. Kwak 135(1-3) (1994) 129–151Lee, J.,seeS. Hong 148(1-3) (1996) 85–105Lee, J.,seeJ.H. Kwak 156(1-3) (1996) 141–170Lee, J.,seeC.-W. Ko 163(1-3) (1997) 293–298Lee, J.,seeJ.H. Kwak 183(1-3) (1998) 193–212Lee, K.P.,seeG.T. Herman 6 (1973) 235–247Lee, K.P.,seeA. Ehrenfeucht 15 (1976) 223–234Lee, S.C.,seeC.C. Chen 49 (1984) 21–26Lee, S.M. and S.C. Shee, On Skolem graceful graphs93 (1991) 195–200Lee, S.-M., E. Schmeichel and S.C. Shee, On felicitous graphs93 (1991) 201–209Lee, Y.-S.,seeG.J. Chang 199(1-3) (1999) 11–25Lefevre-Percsy, C. and V. Nypelseer, Finite rank 3 geometries with affine planes and dual affine point residues

84 (1990) 161–167Lefkopoulou, M.,seeS. Kounias 46 (1983) 21–31Lefmann, H. and B. Voigt, A remark on infinite arithmetic progressions (Communication) 52 (1984) 285–286Lefmann, H., Nont-intersecting families of linear spaces over GF(q) 89 (1991) 173–183Lefmann, H.,seeA. Bialostocki 137(1-3) (1995) 19–34Lefmann, H.,seeD. Duffus 137(1-3) (1995) 177–187Lefmann, H.,seeA. Bialostocki 150(1-3) (1996) 49–60Lefmann, H.,seeN. Hindman 162(1-3) (1996) 151–174Lehel, J. and Zs. Tuza, Ensembles d’articulation d’un grapheγ -critique 30 (1980) 245–248Lehel, J. and Zs. Tuza, Triangle-free partial graphs and edge covering theorems39 (1982) 59–65Lehel, J.,seeA. Gyárfás 52 (1984) 177–198


Lehel, J.,seeA. Gyárfás 55 (1985) 167–180Lehel, J., A characterizations of totally balanced hypergraphs57 (1985) 59–65Lehel, J. and Zs. Tuza, Neighborhood perfect graphs61 (1986) 93–101Lehel, J.,seeA. Gyárfás 71 (1988) 33–46Lehel, J., F.R. McMorris and D.D. Scott,M-chain graphs of posets (Note) 74 (1989) 341–346Lehel, J.,seeR.J. Faudree 76 (1989) 223–240Lehel, J.,seeR.J. Faudree 91 (1991) 45–59Lehel, J.,seeL. Kinch 94 (1991) 75–79Lehel, J.,seeR.J. Faudree 126(1994) 121–135Lehel, J.,seeM.S. Jacobson 145(1-3) (1995) 145–150Lehel, J.,seeM.S. Jacobson 145(1-3) (1995) 295–299Lehel, J.,seeR.J. Faudree 150(1-3) (1996) 103–113Lehel, J.,seeD. Kratsch 150(1-3) (1996) 231–245Lehel, J., The partition of a uniform hypergraph into pairs of dependent hyperedges163(1-3) (1997) 313–318Lehel, J.,seeA. Gyárfás 177(1-3) (1997) 99–122Leimer, H.-G., Optimal decomposition by clique separators113(1993) 99–123Lemos, M., An extension of Lindström’s result about characteristic sets of matroids68 (1988) 85–101Lemos, M., On 3-connected matroids73 (1989) 273–283Lemos, M., Matroids having the same connectivity function131(1-3) (1994) 153–161Lemos, M. and J. Oxley, On packing minors into connected matroids189(1-3) (1998) 283–289Lempel, A.,seeG. Cohen 56 (1985) 35–43Lempel, A.,seeR.M. Roth 103(1992) 279–292Lenart, C. and N. Ray, Chromatic polynomials of partition systems167-168(1-3) (1997) 419–444Lenart, C. and N. Ray, Hopf algebras of set systems180(1-3) (1998) 255–280Lengvárszky, Z., Distributive sublattices and weakly independent subsets in modular lattices (Note) 112(1993)

269–273Lengyel, T., On some properties of the series

∑∞k=0 k

nxk and the Stirling numbers of the second kind150(1-3)(1996) 281–292

Lenstra Jr., H.W., Two theorems on perfect codes3 (1972) 125–132Lenstra Jr., H.W., On the inverse Fermat equation106/107(1992) 329–331Lentin, A., Une propriete combinatoire des couples de permutations7 (1974) 141–149Lenz, H. and G. Ringel, A brief review on Egmont Köhler’s mathematical work97 (1991) 3–16Leo, J.W., On coefficients of the Tutte polynomial184(1-3) (1998) 121–135Leo, J.W., Triads and triangles in 3-connected matroids194(1-3) (1999) 173–193Leonard, M.,seeF. Garoche 49 (1984) 323–325Leonard, P.A.,seeB.A. Anderson 28 (1979) 113–134Leonard, P.A.,seeB.A. Anderson 37 (1981) 1–18Leonard, P.A.,seeN.J. Finizio 197-198(1-3) (1999) 299–307Lepovic, M., seeM.M. Petrovic 126(1994) 239–244Lepovic, M., Some kinds of energies of graphs128(1-3) (1994) 277–282Lepovic, M., On strongly asymmetric graphs145(1-3) (1995) 315–320Lepovic, M., On formal products and spectra of graphs188(1-3) (1998) 137–149Leroux, P. and V. Strehl, Jacobi polynomials: Combinatorics of the basic identities (Communication) 57 (1985)

167–187Leroux, P. and G.X. Viennot, Combinatorial resolution of systems of differential equations. IV. Separation of

variables 72 (1988) 237–250Leroux, P.,seeH. Décoste 99 (1992) 31–48Leroux, P.,seeG. Labelle 157(1-3) (1996) 227–240Lešanovský, A. and V. Pták, A measure of thickness for families of sets58 (1986) 35–44Lesieur, L., Demi-groups bornés (bounded semi-groups)53 (1985) 157–165Lesniak, L., Results on the edge-connectivity of graphs8 (1974) 351–354Lesniak, L., Onn-hamiltonian graphs 14 (1976) 165–169Lesniak, L.,seeY. Alavi 62 (1986) 113–118Lesniak, L.,seeN. Dean 121(1993) 37–49Lesniak, L.,seeR.J. Faudree 126(1994) 121–135


Lesniak, L.M.,seeR.J. Faudree 91 (1991) 33–43Lesniak, L.M.,seeR.J. Faudree 103(1992) 17–24Lesniak, L.M.,seeR.J. Faudree 105(1992) 61–71Lesniak, L.M.,seeR.J. Faudree 141(1-3) (1995) 109–122Lesniak, L.M.,seeR.J. Faudree 150(1-3) (1996) 103–113Lesniak-Foster, L., A note on stable graphs (Note) 19 (1977) 93–97Letzter, G.,seeD. Witte 43 (1983) 297–307Lev, V.F., On consecutive subset sums187(1-3) (1998) 151–160Levenshtein, V., On designs in compact metric spaces and a universal bound on their size192 (1-3) (1998)

251–271Levenshtein, V.I., Equivalence of Delsarte’s bounds for codes and designs in symmetric association schemes, and

some applications 197-198(1-3) (1999) 515–536Levi, I., Order-automorphisms of normal subsets of a power set66 (1987) 139–155Levin, G.M.,seeM. Jacobson 176(1-3) (1997) 159–175Levine, E., On a harmonious graph conjecture (Note) 46 (1983) 99–101Levine, E.,seeA. Eswarathasan 91 (1991) 249–257Levitin, L., seeG. Freiman 70 (1988) 137–147Levitt, J.,seeA.S. Fraenkel 2 (1972) 335–345Levy, R. and E. Shamir, A note on a counting problem arising in percolation theory114(1993) 361–365Lewin, M., A note on line coverings of graphs (Note) 5 (1973) 283–285Lewin, M., Generating the alternating group by cyclic triples (Note) 11 (1975) 187–189Lewin, M., On the coefficients of the characteristic polynomial of a matrix125(1994) 255–262Lewis, R.P. and S.P. Norton, On a problem raised by P.J. Cameron138(1-3) (1995) 315–318Lewis, R.P., The ranks of partitions modulo 2167-168(1-3) (1997) 445–449Lewis, R.P., The number of spanning trees of a complete multipartite graph197-198(1-3) (1999) 537–541Lewis, T.,seeM. Katchalski 42 (1982) 67–71Lewis, T.,seeM. Katchalski 54 (1985) 271–284Lewis, T.,seeM. Katchalski 65 (1987) 249–259Li, A., On the conjecture at two counterfeit coins133(1-3) (1994) 301–306Li, B., The ANTI-order for caccc posets — Part I158(1-3) (1996) 173–184Li, B., The ANTI-order for caccc posets — Part II158(1-3) (1996) 185–199Li, B. and E.C. Milner, The ANTI-order and the fixed point property for caccc posets175(1-3) (1997) 197–209Li, B. and E.C. Milner, Isomorphic ANTI-cores of caccc posets176(1-3) (1997) 185–195Li, B. and E.C. Milner, Isomorphic ANTI-cores of Caccc posets — an improvement183(1-3) (1998) 213–221Li, B.-Y., seeS.-Z. Wang 48 (1984) 289–306Li, C.H., On isomorphisms of connected Cayley graphs178(1-3) (1998) 109–122Li, C.H., seeX.G. Fang 182(1-3) (1998) 85–99Li, C.-K., On certain convex matrix sets (Note) 79 (1989/90) 323–326Li, C.-L., seeD. Eppstein 91 (1991) 239–248Li, F. and W. Gao, Addition theorems onZn 137(1-3) (1995) 371–376Li, H., Edge-hamiltonian property in regular 2-connected graphs82 (1990) 25–34Li, H., seeE. Flandrin 90 (1991) 41–52Li, H., seeE.J. Cockayne 90 (1991) 313–317Li, H., seeB. Jackson 102(1992) 163–176Li, H., seeY. Zhu 110(1992) 229–249Li, H., seeE. Flandrin 111(1993) 221–229Li, H. and Y. Lin, The existence of infinitely many primary trees135(1-3) (1994) 153–161Li, H., seeD. Barraez 146(1-3) (1995) 11–18Li, H., Circumferences in 1-tough graphs146(1-3) (1995) 145–151Li, H., seeO. Favaron 159(1-3) (1996) 103–109Li, H., seeM. El Kadi Abderrezzak 165-166(1-3) (1997) 11–20Li, H., seeH. Broersma 171(1-3) (1997) 43–54Li, H., M. Lu and Z. Sun, Hamiltonicity in 2-connected graphs with claws183(1-3) (1998) 223–236Li, H., seeA. Ainouche 184(1-3) (1998) 1–13


Li, J. and F. Tian, A proof of a conjecture aboutDλ-paths in graphs with large neighborhood unions161(1-3)(1996) 185–196

Li, J., seeH. Broersma 171(1-3) (1997) 43–54Li, J.-S. and Z.-X. Song, On the potentiallyPk -graphic sequences195(1-3) (1999) 255–262Li, K., seeE. Engelhardt 78 (1989) 257–266Li, L., seeL. Zhang 160(1-3) (1996) 291–297Li, M., Longest cycles in regular 2-connected claw-free graphs137(1-3) (1995) 277–295Li, M., Hamiltonian cycles in regular 3-connected claw-free graphs156(1-3) (1996) 171–196Li, M., Vertex pancyclism in claw-free graphs188(1-3) (1998) 151–173Li, N.-Z., seeS.-J. Xu 51 (1984) 207–212Li, N.-Z. and E.G. Whitehead Jr., The chromatic uniqueness ofW10 (Note) 104(1992) 197–199Li, N.-Z., On graphs havingσ -polynomials of the same degree110(1992) 185–196Li, N.-Z. and E.G. Whitehead Jr., The chromaticity of certain graphs with five triangles (Note) 122 (1993)

365–372Li, N.Z., seeC.C. Chen 172(1-3) (1997) 1Li, N.-Z., seeC.-Y. Chao 172(1-3) (1997) 9–16Li, N.-Z., X.-W. Bao and R.-Y. Liu, Chromatic uniqueness of the complements of certain forests172 (1-3)

(1997) 79–84Li, N.-Z., The list of chromatically unique graphs of order seven and eight172(1-3) (1997) 193–221Li, P., Sequencing the dihedral groupsD4k 175(1-3) (1997) 271–276Li, Q. and J. Shao, The index set problem for Boolean (or nonnegative) matrices123(1993) 75–92Li, S.-Y.R.,seeR.M. Karp 13 (1975) 129–142Li, S.-Y.R., Extremal theorems on divisors of a number24 (1978) 37–46Li, W., seeM. Guan 48 (1984) 77–81Li, W., seeF. Shi 123(1993) 111–115Li, W.-C.W., Determination of the residue classes of a polynomial at integral arguments47 (1983) 83–90Li, X. and F. Zhang, On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs94

(1991) 189–197Li, X., seeC. Hoede 125(1994) 219–228Li, X. and F. Zhang,n-Dimensional line digraphs 132(1-3) (1994) 127–135Li, X., seeF. Zhang 140(1-3) (1995) 253–263Li, X. and H. Zhang, A solution to Gutman’s problem on the characteristic polynomial of a bipartite graph154

(1-3) (1996) 297–300Li, X., A lower bound for the connectivity of directed Euler tour transformation graphs163 (1-3) (1997) 101–

108Li, X., seeH. Galeana-Sánchez 178(1-3) (1998) 73–80Li, X., The connectivity of theSEE-graph andAEE-graph for the connected spanningk-edge subgraphs of a

graph 183(1-3) (1998) 237–245Li, X., Edge-disjoint minimum-weight connected spanningk-edge subgraphs in a weighted graph: A connected-

ness theorem 188(1-3) (1998) 175–182Li, Y. and C. Rousseau, A note on the Ramsey numberr(H +Kn,Kn) 170(1-3) (1997) 265–267Li, Y., C.C. Rousseau and L’. Šoltés, Ramsey linear families and generalized subdivided graphs170(1-3) (1997)

269–275Li, Y., seeM. Shi 189(1-3) (1998) 221–232Li, Y., seeZ. Zhang 195(1-3) (1999) 295–298Lia, H., M. Lu, F. Tian and B. Wei, Hamiltonicity of 2-connected claw-center independent graphs165-166(1-3)

(1997) 459–469Liang, F.M., A short proof of the 3d distance theorem (Note) 28 (1979) 325–326Liang, K. and M.L. Wachs, Mahonian statistics on labeled forests99 (1992) 181–197Liaw, S.-C. and G.J. Chang, Rabin numbers of Butterfly networks196(1-3) (1999) 219–227Liaw, Y.S., Construction of referee squares178(1-3) (1998) 123–135Libkin, L., Direct product decompositions of lattices, closures and relation schemes112(1993) 119–138Libkin, L. and V. Gurvich, Trees as semilattices145(1-3) (1995) 321–327Lick, D.R.,seeC. Fan 158(1-3) (1996) 49–62Lidl, R. and W.B. Müller, Generalizations of the Fibonacci pseudoprimes test92 (1991) 211–220


Lieb, E.H.,seeO.J. Heilmann 1 (1971) 19–27Liebl, P.,seeT. Dvorák 171(1-3) (1997) 89–102Lih, K.-W., Rank inequalities for chordal graphs113(1993) 125–130Lih, K.-W. and P.-L. Wu, On equitable coloring of bipartite graphs151(1-3) (1996) 155–160Lilly, G.M., seeS.C. Milne 139(1-3) (1995) 319–346Lim, C.-K., seeC.-L. Deng 72 (1988) 71–80Lim, C.-K., seeC.-L. Deng 127(1-3) (1994) 131–137Lim, C.-K., seeC.-L. Deng 151(1-3) (1996) 71–79Lim, C.-K. and K.S. Lam, The characteristic polynomial of ladder digraph and an annihilating uniqueness

theorem 151(1-3) (1996) 161–167Limaye, N.B., S.S. Sane and M.S. Shrikhande, The structure of triangle-free quasi-symmetric designs64(1987)

199–207Lin, C., The dimension of the cartesian product of posets88 (1991) 79–92Lin, C., G. Hu and Z. Zhang, A six-color theorem for the edge-face coloring of plane graphs141(1-3) (1995)

291–297Lin, G., seeF. Zhang 184(1-3) (1998) 289–295Lin, K.Y., Magic cubes and hypercubes of order 358 (1986) 159–166Lin, M.-C. and S. Lin, Codes with multi-level error-correcting capabilities83 (1990) 301–314Lin, S.,seeM.-C. Lin 83 (1990) 301–314Lin, X., M. Zhu, Z. Yu, C. Zhang and Y. Yang, On distinct distance sets in a graph175(1-3) (1997) 277–282Lin, Y., seeH. Li 135(1-3) (1994) 153–161Lin, Y., seeP.C.B. Lam 173(1-3) (1997) 285–289Lin, Y.-C., seeJ.R. Griggs 143(1-3) (1995) 47–70Lin, Y.-C., seeJ.R. Griggs 169(1-3) (1997) 233–243Lindberg, P.-O.,seeR. Häggkvist 47 (1983) 321–323Lindner, C.C., Construction of doubly diagonalized orthogonal latin squares5 (1973) 79–86Lindner, C.C., On the construction of cyclic quasigroups6 (1973) 149–158Lindner, C.C., Construction of nonisomorphic reverse Steiner quasigroups7 (1974) 281–288Lindner, C.C. and A. Rosa, Finite embedding theorems for partial Steiner triple systems13 (1975) 31–39Lindner, C.C., Two finite embedding theorems for partial 3-quasigroups16 (1976) 271–277Lindner, C.C. and E. Mendelsohn, On the conjugates of ann2× 4 orthogonal array 20 (1977) 123–132Lindner, C.C. and A. Rosa, Steiner quadruple systems — A survey22 (1978) 147–181Lindner, C.C. and K.T. Phelps, A note on partial parallel classes in Steiner systems (Note) 24 (1978) 109–112Lindner, C.C., N.S. Mendelsohn and S.R. Sun, On the construction of Schroeder quasigroups32 (1980) 271–

280Lindner, C.C.,seeM. Gionfriddo 34 (1981) 31–42Lindner, C.C. and D.R. Stinson, Steiner pentagon systems52 (1984) 67–74Lindner, C.C., Construction of large sets of pairwise disjoint transitive triple systems II65 (1987) 65–74Lindner, C.C., C.A. Rodger and D.R. Stinson, Nesting of cycle systems of odd length77 (1989) 191–203Lindner, C.C., C.A. Rodger and D.R. Stinson, Small embeddings for partial cycle systems of odd length80

(1990) 273–280Lindner, C.C.,seeD.G. Hoffman 89 (1991) 221–229Lindner, C.C. and C.A. Rodger, 2-Perfectm-cycle systems 104(1992) 83–90Lindner, C.C.,seeD. Chen 110(1992) 35–42Lindner, C.C. and C.A. Rodger, A partialm= (2k+ 1)-cycle system of ordern can be embedded in anm-cycle

system of order(2n+ 1)m 117(1993) 151–159Lindner, C.C.,seeE.J. Billington 135(1-3) (1994) 61–68Lindner, C.C. and C.A. Rodger, On equationally defining extended cycle systems173(1-3) (1997) 1–14Lindner, C.C.,seeH.L. Fu 178(1-3) (1998) 63–71Lindner, C.C.,seeH.-L. Fu 183(1-3) (1998) 103–117Lindquester, T. and N.C. Wormald, Factorisation of regular graphs into forests of short paths186(1-3) (1998)

217–226Lindquester, T.E.,seeR.J. Faudree 103(1992) 17–24Lindquester, T.E.,seeJ. Wang 179(1-3) (1998) 293–298Lindström, B., Non-regular simplicial matroids (Note) 28 (1979) 101–102


Lindström, B.,seeR. Häggkvist 47 (1983) 321–323Lindström, B., A non-linear algebraic matroid with infinite characteristic set (Note) 59 (1986) 319–320Lindström, B., On algebraic matroids111(1993) 357–359Linek, V., Bipartite graphs can have any number of independent sets76 (1989) 131–136Linek, V. and Z. Jiang, Hookedk-extended Skolem sequences196(1-3) (1999) 229–238Linhares-Sales, C.,seeH. Everett 165-166(1-3) (1997) 223–242Linhart, J.,seeD. Cieslik 155(1-3) (1996) 39–48Linial, N., A lower bound for the circumference of a graph15 (1976) 297–300Linial, N., Covering digraphs by paths23 (1978) 257–272Linial, N., On Petersen’s graph theorem33 (1981) 53–56Linial, N., seeP. Erdös 64 (1987) 1–11Linial, N., Graph coloring and monotone functions on posets (Note) 58 (1986) 97–98Linial, N., seeM. Karchmer 114(1993) 275–282Lins, S., A sequence representation for maps30 (1980) 249–263Lins, S., A simple proof of Gagliardi’s handle recognition theorem57 (1985) 253–260Lins, S. and A. Mandel, Graph-encoded 3-manifolds57 (1985) 261–284Lins, S.,seeL. Kauffman 103(1992) 49–55Lins, S., Twistors Bridges among 3-manifolds177(1-3) (1997) 145–165Lipkin, E., seeG. Freiman 70 (1988) 137–147Lipkin, E., On subset sums ofr-sets 114(1993) 367–377Lipman, M.J.,seeR.D. Ringeisen 46 (1983) 191–198Lipman, M.J., Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups54

(1985) 15–21Lipman, M.J.,seeK.S. Bagga 122(1993) 1–6Lipman, M.J.,seeK.S. Bagga 124(1994) 3–12Lipski Jr., W., On strings containing all subsets as substrings21 (1978) 253–259Lipták, L., Sperner systems containing at mostk sets of every cardinality 170(1-3) (1997) 203–209Liskovets, V.A., A reductive technique for enumeratingnon-isomorphic planar maps156(1-3) (1996) 197–217Lisonek, P., Local and global majorities revisited146(1-3) (1995) 153–158Litsyn, S.N.,seeG.D. Cohen 106/107(1992) 147–155Little, C., seeH. Wang 160(1-3) (1996) 283–289Little, C.H.C., The parity of the number of 1-factors of a graph2 (1972) 179–181Little, C.H.C., D.D. Grant and D.A. Holton, On defect-d matchings in graphs 13 (1975) 41–54Little, C.H.C. and R.D. Ringeisen, An additivity theorem for maximum genus of a graph21 (1978) 69–74Little, C.H.C.,seeY.-H. Peng 172(1-3) (1997) 103–114Liu, A., seeM. Katchalski 27 (1979) 59–69Liu, A., seeH.L. Abbott 39 (1982) 327–328Liu, A., seeM. Katchalski 65 (1987) 249–259Liu, A.C., seeH.L. Abbott 13 (1975) 299–305Liu, A.C., seeH.L. Abbott 25 (1979) 281–284Liu, A.C., seeH.L. Abbott 37 (1981) 135–141Liu, B., seeC. Bo 159(1-3) (1996) 241–245Liu, C.J. and Y. Chow, An operator approach to some graph enumeration problems44 (1983) 285–291Liu, C.J., The generating function of Whitworth runs51 (1984) 221–228Liu, C.L., B.G. Ong and G.R. Ruth, A construction scheme for linear and non-linear codes4 (1973) 171–184Liu, C.L., Sperner’s theorem on maximal-sized antichains and its generalization11 (1975) 133–139Liu, C.L., seeK.M. Chung 21 (1978) 117–127Liu, D.D.-F.,T -colorings of graphs 101(1992) 203–212Liu, D.D.-F.,T -graphs and the channel assignment problem161(1-3) (1996) 197–205Liu, G., A lower bound on connectivities of matroid base graphs69 (1988) 55–60Liu, G., seeK. Heinrich 85 (1990) 313–317Liu, G., Orthogonal (g,f )-factorizations in graphs 143(1-3) (1995) 153–158Liu, G., seeL. Xie 188(1-3) (1998) 285–291Liu, J.,seeY. Alavi 100(1992) 229–233Liu, J.,seeY. Alavi 111(1993) 3–10


Liu, J., Hamiltonian decompositions of Cayley graphs on Abelian groups131(1-3) (1994) 163–171Liu, J. and H. Zhou, Graphs and digraphs with given girth and connectivity132(1-3) (1994) 387–390Liu, J. and H. Zhou, Dominating subgraphs in graphs with some forbidden structures135(1-3) (1994) 163–168Liu, J.,seeS. Xu 135(1-3) (1994) 349–358Liu, J. and K. Williams, On bandwidth and edgesum for the composition of two graphs143 (1-3) (1995) 159–

166Liu, J. and C. Zhao, A new bound on the feedback vertex sets in cubic graphs148(1-3) (1996) 119–131Liu, J.,seeC. Fan 158(1-3) (1996) 49–62Liu, L., seeZ. Zhang 195(1-3) (1999) 295–298Liu, M., Homomorphisms and automorphisms of 2-D de Bruijn–Good Graphs (Note) 85 (1990) 105–109Liu, M., seeZ. Dai 123(1993) 17–34Liu, Q.-Z.,seeB.-L. Chen 194(1-3) (1999) 59–65Liu, R.-Y. and L.-C. Zhao, A new method for proving chromatic uniqueness of graphs171(1-3) (1997) 169–177Liu, R.-Y., seeN.-Z. Li 172(1-3) (1997) 79–84Liu, R.-Y., Adjoint polynomials and chromatically unique graphs172(1-3) (1997) 85–92Liu, W.P. and I. Rival, Inversions, cuts, and orientations87 (1991) 163–174Liu, W.-P. and I. Rival, Enumerating orientations of ordered sets88 (1991) 239–247Liu, W.-P., I. Rival and N. Zaguia, Automorphisms, Isotone self-maps and cycle-free orders144 (1-3) (1995)

59–66Liu, X., Lower bounds of length of longest cycles in graphs involving neighborhood unions169 (1-3) (1997)

133–144Liu, X. and B. Wei, A generalization of Bondy’s and Fan’s sufficient conditions for Hamiltonian graphs169

(1-3) (1997) 249–255Liu, X. and D.B. West, Line digraphs and coreflexive vertex sets188(1-3) (1998) 269–277Liu, Y., Construction and counting of Generalized Boolean Functions (Note) 69 (1988) 313–316Liu, Y., On chromatic and dichromatic sum equations84 (1990) 169–179Liu, Y., seeF. Dong 123(1993) 35–45Liu, Y., On functional equations arising from map enumerations123(1993) 93–109Liu, Y., seeF.-M. Dong 145(1-3) (1995) 95–103Liu, Y., seeE. Song 145(1-3) (1995) 343–346Liu, Y., seeY. Huang 176(1-3) (1997) 149–158Liu, Y., seeY. Huang 194(1-3) (1999) 139–149Liu, Y.-P.,seeM. Darrah 173(1-3) (1997) 23–33Liu, Y.P.,seeF.M. Dong 184(1-3) (1998) 71–85Liua, J. and H. Zhou, Maximum induced matchings in graphs170(1-3) (1997) 277–281Lladó, A.S.,seeY.O. Hamidoune 159(1-3) (1996) 131–142Lladó, A.S.,seeG. Ringel 165-166(1-3) (1997) 471–479Lladó, A.S.,seeG. Ringel 165-166(1-3) (1997) 587–588Lobstein, A.C., On perfect arithmetic codes106/107(1992) 333–336Lock, P.F.,seeC.J. Knickerbocker 76 (1989) 277–278Lock, P.F.,seeG.R.T. Hendry 187(1-3) (1998) 281–290Locke, S.C.,seeJ.A. Bondy 33 (1981) 111–122Locke, S.C., Extremal 3-connected graphs68 (1988) 257–263Locke, S.C.,seeM.O. Albertson 74 (1989) 33–49Locke, S.C. and D. Witte, Flows in circulant graphs of odd order are sums of Hamilton cycles78 (1989) 105–

114Locke, S.C.,seeB. Alspach 82 (1990) 113–126Lockeberg, E.R.,seeS. Gallivan 34 (1981) 25–29Loeb, D.E., A generalization of the Stirling numbers103(1992) 259–269Loeb, D.E., A generalization of the binomial coefficients105(1992) 143–156Loeb, D.E., Towards the critical problem: on the coalgebraic relation between sets and multisets118 (1993)

157–164Loeb, D.E.,seeA. Bottreau 180(1-3) (1998) 65–72Loebl, L.,seeY. Crama 102(1992) 143–147Loebl, M. and S. Poljak, A hierarchy of totally unimodular matrices76 (1989) 241–246


Loebl, M., Unprovable combinatorial statements108(1992) 333–342Loebl, M.,seeA.S. Fraenkel 141(1-3) (1995) 135–151Loebl, M.,seeW. Hochstättler 153(1-3) (1996) 165–176Loerinc, B., Chromatic uniqueness of the generalizedθ -graph(Note) 23 (1978) 313–316Lo Faro, G., On the size of partial parallel classes in Steiner systems STS(19) and STS(27) (Note) 45 (1983)

307–312Lo Faro, G., Steiner quadruple systems having a prescribed number of quadruples in common58 (1986) 167–

174Lo Faro, G.,seeM. Gionfriddo 111(1993) 263–268Lo Faro, G., Constructing 3-chromatic Steiner triple systems174(1-3) (1997) 187–190Loizou, G.,seeT.I. Fenner 20 (1977) 217–234Lomonaco Jr., S.J.,seeJ.H. Conway 83 (1990) 213–217Lomonosov, M.V.,seeA.K. Kelmans 38 (1982) 317–322Lomonosov, M.V.,seeA.K. Kelmans 46 (1983) 183–189Lonc, Z., Decompositions of hypergraphs into hyperstars66 (1987) 157–168Lonc, Z., Majorization, packing, covering and matroids121(1993) 151–157Lonc, Z., Partitions of large Boolean lattices131(1-3) (1994) 173–181Lonc, Z., Delta-system decompositions of graphs164(1-3) (1997) 221–224Lonc, Z.,seeK. Brys 185(1-3) (1998) 41–49London, E., A new proof of the colored Kruskal–Katona theorem126(1994) 217–223Longyear, J.Q., Large tactical configurations4 (1973) 379–382Longyear, J.Q., Common transversals in partitioning families (Note) 17 (1977) 327–329Longyear, J.Q., A peculiar partition formula78 (1989) 115–118López, M.A.,seeP.M. Salzberg 58 (1986) 285–294Lopez-Bracho, R.,seeA. Bouchet 42 (1982) 145–152Lorea, M.,seeP. Hansen 14 (1976) 305–309Lorea, M., On Turan hypergraphs22 (1978) 281–285Lorea, M., On matroidal families (Note) 28 (1979) 103–106Lorenzini, D.J., A finite group attached to the laplacian of a graph91 (1991) 277–282Lorimer, P., Maximal sets of permutations constructed from projective planes25 (1979) 269–273Lorimer, P.J. and W. Solomon, The Ramsey numbers for stripes and complete graphs 1104(1992) 91–97Lou, D.,seeR.E.L. Aldred 88 (1991) 1–9Lou, D.,seeD.A. Holton 96 (1991) 81–99Lou, D. and D.A. Holton, Lower bound of cyclic edge connectivity forn-extendability of regular graphs112

(1993) 139–150Lou, D. and Q. Zhu, The 2-extendability of strongly regular graphs148(1-3) (1996) 133–140Lou, D., The Chvátal–Erdos condition for cycles in triangle-free graphs152(1-3) (1996) 253–257Lou, D., A local independence number condition forn-extendable graphs195(1-3) (1999) 263–268Loupekine, F. and J.J. Watkins, Labeling angles of planar graphs72 (1988) 251–256Loureiro, I., Finitely generated free tetravalent modal algebras46 (1983) 41–48Lovász, L., Normal hypergraphs and the perfect graph conjecture2 (1972) 253–267Lovász, L., On the ratio of optimal integral and fractional covers13 (1975) 383–390Lovász, L.,seeB. Korte 59 (1986) 297–314Lovász, L.,seeB. Korte 73 (1988) 143–157Lovász, L., M. Saks and W.T. Trotter, An on-line graph coloring algorithm with sublinear performance ratio75

(1989) 319–325Lovász, L., Stable sets and polynomials124(1994) 137–153Love, H.R.,seeM.J.L. Kirby 5 (1973) 345–365Lovrecic Saražin, M., On the hamiltonian index of a graph (Note) 122(1993) 373–376Lovrecic Saražin, M., On the hamiltonian index and the radius of a graph182(1-3) (1998) 197–202Löwe, M.,seeI. Althöfer 162(1-3) (1996) 267–271Lu, M., seeH. Lia 165-166(1-3) (1997) 459–469Lu, M., seeH. Li 183(1-3) (1998) 223–236Lu, T., The enumeration of trees with and without given limbs154(1-3) (1996) 153–165Lu, X., seeM. Zheng 85 (1990) 89–96


Lu, X., A matching game 94 (1991) 199–207Lu, X., A characterization onn-critical economical generalized tic-tac-toe games110(1992) 197–203Lu, X., Claws contained in alln-tournaments 119(1993) 107–111Lu, X., A Hamiltonian game onKn,n 142(1-3) (1995) 185–191Lu, X., D.-W. Wang and C.K. Wong, On avoidable and unavoidable claws184(1-3) (1998) 259–265Lu, Z., The harmonious chromatic number of a complete binary and trinary tree118(1993) 165–172Lu, Z., The exact value of the harmonious chromatic number of a complete binary tree172(1-3) (1997) 93–101Lubachevsky, B.D.,seeR.L. Graham 181(1-3) (1998) 139–154Lubell, D.,seeD. Kleitman 1 (1971) 47–53Lubell, D., Combinatorial orthogonality in abstract configurations (Note) 8 (1974) 201–203Lubiw, A., seeD. Kratsch 128(1-3) (1994) 269–275Lucchesi, C.L. and J.A. Ross, Superfluous paths in strong digraphs47 (1983) 267–273Lucchesi, C.L., C.P. de Mello and J.L. Szwarcfiter, On clique-complete graphs183(1-3) (1998) 247–254Luccio, F., S. Mazzone and C.K. Wong, A note on visibility graphs64 (1987) 209–219Łuczak, T. and Z. Palka, Maximal induced trees in sparse random graphs72 (1988) 257–265Łuczak, T., Size and connectivity of thek-core of a random graph91 (1991) 61–68Łuczak, T., Cycles in random graphs (Note) 98 (1991) 231–236Łuczak, T., The size of the largest hole in a random graph112(1993) 151–163Łuczak, T.,seeD.F. Hsu 133(1-3) (1994) 291–296Łuczak, T., Phase transition phenomena in random discrete structures136(1-3) (1994) 225–242Łuczak, T., A. Rucinski and J. Gruszka, On the evolution of a random tournament (Note) 148 (1-3) (1996)

311–316Łuczak, T.,seeP. Erdos 154(1-3) (1996) 263–268Łuczak, T.,seeE. Györi 163(1-3) (1997) 279–284Łuczak, T.,seeM. Karonski 171(1-3) (1997) 153–167Łuczak, T., V. Rödl and T. Schoen, Independent finite sums in graphs defined on the natural numbers181(1-3)

(1998) 289–294Łuczak, T.,seeW. Kordecki 196(1-3) (1999) 207–217Lugiez, D., Fast Hensel’s lifting implementation using partial fraction decomposition56 (1985) 217–225Lui, Z.M., seeW.L. Kocay 72 (1988) 213–224Lukács, A. and N. Seifter, Lattices in graphs with polynomial growth186(1-3) (1998) 227–236Luksch, P., Distributive lattices freely generated by an ordered set of width two88 (1991) 249–258Lunardon, G., On regular parallelisms in PG(3, q) 51 (1984) 229–235Lunardon, G. and P. Polito, Onq-clans in even characteristic174(1-3) (1997) 191–198Lundgren, J.R., C.W. Rasmussen and J.S. Maybee, Interval competition graphs of symmetric digraphs119

(1993) 113–122Lundgren, J.R. and C.W. Rasmussen, Two-step graphs of trees119(1993) 123–139Lützen, J., G. Sabidussi and B. Toft, Julius Petersen 1839–1910. A biography100(1992) 9–82Lützen, J.,seeM. Christiansen 100(1992) 83–97Lynch, J.F., The visually distinct configurations ofk sets 33 (1981) 281–287Lyndon, R.C.,seeJ.L. Brenner 46 (1983) 111–132Lyuu, Y.D.,seeD.Z. Du 151(1-3) (1996) 81–85Ma, S.L., Partial difference sets52 (1984) 75–89Ma, S.-L.,seeW.-K. Chan 125(1994) 107–113Ma, S.L., On subsets of partial difference sets125(1994) 263–272Ma, S.L.,seeK.T. Arasu 147(1-3) (1995) 1–17Ma, X., Nonexistence of extremal doubly even self-dual codes with large length185(1-3) (1998) 265–273Maamoun, M., Parité des cycles contenant des sommets specifiés d’un graphe34 (1981) 145–152Maamoun, M. and H. Meyniel, On a problem of G. Hahn about coloured hamiltonian paths inK2n (Note) 51

(1984) 213–214Maasberg, S.,seeH. Harborth 197-198(1-3) (1999) 397–407MacAllister, J.D. and M. Sakarovitch, Classification de certaines matrices 0–120 (1977) 133–142MacGillivray, G.,seeE.J. Cockayne 90 (1991) 313–317MacGillivray, G.,seeJ. Bang-Jensen 92 (1992) 27–44MacGillivray, G.,seeE.J. Cockayne 125(1994) 137–146


MacGillivray, G.,seeJ. Bang-Jensen 138(1-3) (1995) 75–92MacGillivray, G.,seeR.C. Brewster 167-168(1-3) (1997) 145–154Machi, A., On the complexity of a hypermap42 (1982) 221–226Macris, N. and J.V. Pulé, An alternative formula for the number of Euler trails for a class of digraphs154(1-3)

(1996) 301–305Macula, A.J., A simple construction ofd-disjunct matrices with certain constant weights162(1-3) (1996) 311–

312Macula, A.J., Two applications of separating systems to nonadaptive procedures169(1-3) (1997) 257–262MacWilliams, F.J., Cyclotomic numbers, coding theory and orthogonal polynomials3 (1972) 133–151MacWilliams, F.J., N.J.A. Sloane and J.G. Thompson, Good self dual codes exist3 (1972) 153–162Madani, R.-M., Characterization of Laborde–Mulder graphs (extended odd graphs)150(1-3) (1996) 293–301Madani, R.M.,seeJ.M. Laborde 165-166(1-3) (1997) 445–457Madaras, T.,seeS. Jendrol’ 197-198(1-3) (1999) 453–467Madej, T. and D.B. West, The interval inclusion number of a partially ordered set88 (1991) 259–277Madej, T. and D.B. West, Interval number of special posets and random posets144(1-3) (1995) 67–74Mader, W., Generalizations of critical connectivity of graphs72 (1988) 267–283Maehara, H., On time graphs32 (1980) 281–289Maehara, H., On the sphericity for the join of many graphs (Note) 49 (1984) 311–313Maehara, H., On the sphericity of the graphs of semiregular polyhedra (Note) 58 (1986) 311–315Maehara, H., Metric transforms of finite spaces and connected graphs61 (1986) 235–246Maehara, H.,seeP. Frankl 63 (1987) 97–100Maehara, H., On the number of induced subgraphs of a random graph (Note) 64 (1987) 309–312Maehara, H., On the euclidean dimension of a a complete multipartite graph72 (1988) 285–289Maehara, H., The intersection graph of random sets (Note) 87 (1991) 97–104Maehara, H., Extending a flexible unit-bar framework to a rigid one108(1992) 167–174Maehara, H.,seeD. Avis 131(1-3) (1994) 17–28Maehara, H.,seeP. Frankl 140(1-3) (1995) 265–267Maehara, H., Embedding a set of rational points in lower dimensions192(1-3) (1998) 273–279Maffioli, F., seeP.M. Camerini 21 (1978) 103–116Maffray, F., On kernels ini-triangulated graphs 61 (1986) 247–251Maffray, F. and H. Meyniel, On a relationship between Hadwiger and stability numbers64 (1987) 39–42Maffray, F.,seeC.T. Hoàng 98 (1991) 161–174Maffray, F.,seeC.T. Hoàng 102(1992) 67–74Maffray, F.,seeC.T. Hoàng 105(1992) 93–102Maffray, F. and M. Preissmann, On the NP-completeness of thek-colorability problem for triangle-free graphs

162(1-3) (1996) 313–317Maffray, F.,seeH.A. Haddadène 163(1-3) (1997) 211–215Maffray, F.,seeH. Everett 165-166(1-3) (1997) 223–242Maffray, F.,seeS. Gravier 165-166(1-3) (1997) 343–348Maffray, F.,seeH. Aït Haddadène 183(1-3) (1998) 1–16Magagnosc, D., Recurrences and formulae in an extension of the Eulerian numbers30 (1980) 265–268Magliveras, S.S.,seeE.S. Kramer 36 (1981) 171–189Magliveras, S.S.,seeE.S. Kramer 77 (1989) 137–157Magliveras, S.S.,seeE.S. Kramer 96 (1991) 101–110Magnanti, T.L., Complementary bases of a matroid8 (1974) 355–361Mago, P.,seeO. Favaron 121(1993) 55–63Mahadev, N.V.R.,seeM. Preissmann 61 (1986) 259–267Mahadev, N.V.R.,seeC.T. Hoàng 74 (1989) 77–84Mahadev, N.V.R.,seeP.L. Hammer 119(1993) 79–96Mahadev, N.V.R. and U.N. Peled, Longest cycles in threshold graphs135(1-3) (1994) 169–176Maharaj, H., Edge frames of graphs: A graph embedding problem177(1-3) (1997) 167–184Maheo, M., Strongly graceful graphs29 (1980) 39–46Mahéo, M.,seeO. Favaron 111(1993) 197–220Mahéo, M.,seeJ. Gimbel 165-166(1-3) (1997) 333–341Mahjoub, A.R.,seeM. Conforti 58 (1986) 121–142


Mahjoub, A.R.,seeJ. Fonlupt 105(1992) 73–91Mahjoub, A.R.,seeF. Barahona 147(1-3) (1995) 19–34Mahjoub, A.R.,seeM. Bouchakour 165-166(1-3) (1997) 101–123Mahjoub, A.R., On perfectly two-edge connected graphs170(1-3) (1997) 153–172Mahmoodian, E.S.,seeC.J. Colbourn 83 (1990) 9–19Mahmoodian, E.S.,seeC.J. Colbourn 115(1993) 103–131Mahmoodian, E.S.,seeM. Behzad 127(1-3) (1994) 47–56Mahmoodian, E.S., R. Naserasr and M. Zaker, Defining sets in vertex colorings of graphs and latin rectangles

167-168(1-3) (1997) 451–460Mahmoodian, E.S. and E. Mendelsohn, On defining numbers of vertex colouring of regular graphs197-198

(1-3) (1999) 543–554Maier, T.,seeR.E. Burkard 161(1-3) (1996) 53–61Maiorana, J.,seeH. Fredricksen 23 (1978) 207–210Maire, F., Une note sur les contractions dans les polygones orthogonaux111(1993) 367–371Maire, F., A characterization of intersection graphs of the maximal rectangles of a polyomino (Communication)

120(1993) 211–214Maire, F.,seeJ.-L. Fzouquet 146(1-3) (1995) 33–44Maire, F.,seeJ.-L. Fouquet 165-166(1-3) (1997) 291–302Majcher, Z., Some special realizations of partition matrix sequences121(1993) 159–175Majcher, Z. and J. Michael, Degree sequences of highly irregular graphs164(1-3) (1997) 225–236Majcher, Z. and J. Michael, Highly irregular graphs with extreme numbers of edges164(1-3) (1997) 237–242Majthay, A. and A. Whinston, Quasi-concave minimization subject to linear constraints9 (1974) 35–59Makai Jr., E.,seeK. Böröczky 60 (1986) 101–120Makarenkov, V.,seeB. Leclerc 192(1-3) (1998) 223–249Malawski, M.,seeA. Idzik 66 (1987) 119–125Malle, G., Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges31

(1980) 293–296Mallows, C.L. and N.J.A. Sloane, Weight enumerators of self-orthogonal codes9 (1974) 391–400Mallows, C.L. and L.A. Shepp, Enumerating pairs of permutations with the same up-down form54 (1985)

301–311Malnic, A., Group actions, coverings and lifts of automorphisms182(1-3) (1998) 203–218Malouf, J.L., An integer sequence from a rational recursion (Communication) 110(1992) 257–261Malouf, J.L.,seeP. Erdos 200(1-3) (1999) 137–147Maltby, R.,seeP. Gibson 194(1-3) (1999) 107–127Maltby, R., Every cutset meets every fibre in certain poset products194(1-3) (1999) 195–203Malvenuto, C. and C. Reutenauer, Evacuation of labelled graphs132(1-3) (1994) 137–143Malvenuto, C. and C. Reutenauer, Plethysm and conjugation of quasi-symmetric functions193 (1-3) (1998)

225–233Malvestuto, F.M., Existence of extensions and product extensions for discrete probability distributions69

(1988) 61–77Manalastas Jr., P.,seeC.C. Chen 44 (1983) 243–250Manber, R.,seeR.A. Brualdi 50 (1984) 143–152Manber, R.,seeR.A. Brualdi 71 (1988) 1–7Manber, R.,seeR. Aharoni 79 (1989/90) 221–228Mandel, A.,seeS. Lins 57 (1985) 261–284Manoussakis, Y. and D. Amar, Hamiltonian paths and cycles, number of arcs and independence number in

digraphs 105(1992) 157–172Manoussakis, Y.,seeK.M. Zhang 133(1-3) (1994) 325–328Manuel, P.D.,seeE. Dahlhaus 187(1-3) (1998) 269–271Manvel, B., Reconstruction of maximal outerplanar graphs2 (1972) 269–278Manvel, B., Some basic observations on Kelly’s conjecture for graphs8 (1974) 181–185Manvel, B., A. Meyerowitz, A. Schwenk, K. Smith and P. Stockmeyer, Reconstruction of sequences94 (1991)

209–219Maranas, C.D., C.A. Floudas and P.M. Pardalos, New results in the packing of equal circles in a square142

(1-3) (1995) 287–293


Marchi, M.,seeH. Hotje 129(1-3) (1994) 139–147Marchioro, P. and A. Morgana, Structure and recognition of domishold graphs50 (1984) 239–251Marchioro, P., A. Morgana, R. Petreschi and B. Simeone, Degree sequences of matrogenic graphs51 (1984)

47–61Marchioro, P., A. Morgana, R. Petreschi and B. Simeone, Adamant digraphs69 (1988) 253–261Marcu, D., The powers of two and three (Note) 89 (1991) 211–212Marczyk, A. and Z. Skupien, Maximum nonhamiltonian tough graphs96 (1991) 213–220Mardon, R.,seeD. Hartvigsen 94 (1991) 81–94Marino, M.C. and R.S. Rees, On parallelism in Steiner systems97 (1991) 295–300Markosian, A.,seeS. Markossian 178(1-3) (1998) 137–153Markossian, S., G. Gasparian, I. Karapetian and A. Markosian, On essential components and critical sets of a

graph 178(1-3) (1998) 137–153Markowsky, G. and R.E. Tarjan, Lower bounds on the lengths of node sequences in directed graphs16 (1976)

329–337Markowsky, G.,seeA.K. Chandra 24 (1978) 7–11Markowsky, G., The level polynomials of the free distributive lattices29 (1980) 275–285Markus, L.R.,seeG.S. Domke 167-168(1-3) (1997) 237–248Marques De Sá, E., Note on graphs and weakly cyclic matrices34 (1981) 275–281Marques De Sá, E., Multiple roots of diagonal multiples of a square matrix36 (1981) 57–67Márquez, A.,seeL. Boza 161(1-3) (1996) 45–52Márquez, A.,seeR. Ayala 194(1-3) (1999) 13–37Marshall, S., On the existence ofk-tournaments with given automorphism group152(1-3) (1996) 259–268Martí-Farré, J., Sets defining minimal vertex covers197-198(1-3) (1999) 555–559Martin, L. and C. Reischer, On the modular nets (Note) 22 (1978) 195–196Martin, N., Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs125

(1994) 273–277Martin, N., Complete bipartite factorisations by complete bipartite graphs167-168(1-3) (1997) 461–480Martini, H., Shadow-boundaries of convex bodies155(1-3) (1996) 161–172Martini, H. and P. Soltan, On convex partitions of polygonal regions195(1-3) (1999) 167–180Martinov, N., A recursive characterization of the 4-connected graphs (Note) 84 (1990) 105–108Marušic, D., On vertex symmetric digraphs36 (1981) 69–81Marušic, D. and T.D. Parsons, Hamiltonian paths in vertex-symmetric graphs of order 5p 42 (1982) 227–242Marušic, D. and T.D. Parsons, Hamiltonian paths in vertex-symmetric graphs of order 4p 43 (1983) 91–96Marušic, D., Hamiltonian circuits in Cayley graphs46 (1983) 49–54Marušic, D., Hamiltonian cycles in vertex symmetric graphs of order 2p2 66 (1987) 169–174Marušic, D., Strong regularity and circulant graphs78 (1989) 119–125Marušic, D., Hamiltonicity of tree-like graphs 80 (1990) 167–173Marušic, D., R. Scapellato and N.Z. Salvi, Generalized Cayley graphs102(1992) 279–285Marušic, D. and R. Scapellato, A class of non-Cayley vertex-transitive graphs associated with PSL(2,p) 109

(1992) 161–170Marušic, D. and R. Scapellato, Permutation groups with conjugacy complete stabilizers134(1-3) (1994) 93–98Marušic, D. and R. Scapellato, A class of graphs arising from the action of PSL(2,q2) on cosets of PGL(2,q)

134(1-3) (1994) 99–110Marušic, D. and B. Mohar, Preface182(1-3) (1998) 1Marušic, D., Recent developments in half-transitive graphs182(1-3) (1998) 219–231Maruta, T., On Singleton arrays and Cauchy matrices81 (1990) 33–36Maruta, T., Cyclic arcs and pseudo-cyclic MDS codes174(1-3) (1997) 199–205Masai, P., Two conjectures of Grünbaum on arrangements of curves41 (1982) 173–180Masaro, J.C.,seeC.S. Wong 50 (1984) 295–318Maschietti, A. and G. Migliori, Onq2/4-sets of type (0,q/4, q/2) in projective planes of orderq ≡ 0(mod 4)

129(1-3) (1994) 149–158Maschlanka, P. and L. Volkmann, Independence number inn-extendable graphs154(1-3) (1996) 167–178Masinter, L.,seeH. Brown 7 (1974) 1–30Masinter, L.,seeH. Brown 8 (1974) 227–244


Massey, J.L., M.K. Sain and J.M. Geist, Certain infinite Markov chains and sequential decoding3 (1972) 163–175

Massey, J.L., Linear codes with complementary duals106/107(1992) 337–342Massey, J.L.,seeX. Yang 126(1994) 391–393Máté, A., A lower estimate for the achromatic number of irreducible graphs33 (1981) 171–183Mathies, T.R.,seeG. Haggard 199(1-3) (1999) 227–231Mathon, R. and S.A. Vanstone, On the existence of doubly resolvable Kirkman systems and equidistant

permutation arrays 30 (1980) 157–172Mathon, R., On self-complementary strongly regular graphs69 (1988) 263–281Mathon, R.,seeE.S. Kramer 77 (1989) 137–157Mathon, R. and A. Rosa, On the(15,5, λ)-family of BIBDs 77 (1989) 205–216Mathon, R.A.,seeC.J. Colbourn 92 (1991) 49–64Matic-Kekic, S., D.M. Acketa and J.D. Žunic, An exact construction of digital convex polygons with minimal

diameter 150(1-3) (1996) 303–313Matoušek, J. and R. Thomas, On the complexity of finding iso- and other morphisms for partialk-trees 108

(1992) 343–364Matthews, L.R. and J.G. Oxley, Infinite graphs and bicircular matroids19 (1977) 61–65Matthews, L.R., Matroids from directed graphs24 (1978) 47–61Mattson Jr., H.F.,seeE.F. Assmus Jr. 3 (1972) 1–20Mattson Jr., H.F.,seeE.F. Assmus Jr. 3 (1972) 21–32Mattson Jr., H.F.,seeT. Helleseth 56 (1985) 169–189Mattson Jr., H.F., Fault-detection in networks106/107(1992) 343–352Matúš, F., Extreme convex set functions with many nonnegative differences135(1-3) (1994) 177–191Mauduit, C.,seeP. Erdos 200(1-3) (1999) 149–164Mauk, C. and S. Stahl, Cubic graphs whose average number of regions is small159(1-3) (1996) 285–290Maurer, M.C.,seeM. Chein 37 (1981) 35–50Maurer, M.C.,seeM. Habib 53 (1985) 91–101Maurer, S. and P.J. Slater, Onk-critical, n-connected graphs20 (1977) 255–262Maurer, S.B., Intervals in matroid basis graphs11 (1975) 147–159Maurer, S.B. and P.J. Slater, Onk-minimally n-edge-connected graphs24 (1978) 185–195Maurer, S.B., I. Rabinovitch and W.T. Trotter Jr., Large minimal realizers of a partial order II31(1980) 297–313Maurer, S.B., I. Rabinovitch and W.T. Trotter Jr., A generalization of Turán’s theorem to directed graphs32

(1980) 167–189Maureso, M.,seeJ.M. Brunat 165-166(1-3) (1997) 125–137Maureso, M.,seeJ.M. Brunat 197-198(1-3) (1999) 157–167Maurin, F., Balanced generalized handcuffed designs110(1992) 205–213Maurin, F., On the existence of (v, 4, 3, 1)-BHDs 145(1-3) (1995) 329–331Mauro, D.W.,seeJ.P. Georges 135(1-3) (1994) 103–111Maurras, J.-F., Convex hull of the edges of a graph and near bipartite graphs46 (1983) 257–265Maurras, J.F., Hypergraphes de Petersen! Hypergraphes de Moore?111(1993) 373–379Maurras, J.F., The line-polytope of a finite affine plane (Note) 115(1993) 283–286Maurras, J.F.,seeM. Hadjiat 165-166(1-3) (1997) 367–384Maurras, J.-F. and Y. Vaxès, Multicommodity network flow with jump constraints165-166(1-3) (1997) 481–

486Mavron, V.C.,seeT.C. Hine 29 (1980) 191–200Maxson, C.J., Endomorphism semigroups of finite subset algebras10 (1974) 133–144Maxson, C.J.,seeD.J. Hartfiel 12 (1975) 245–256Maxson, C.J.,seeD.J. Hartfiel 15 (1976) 141–150Maxson, C.J.,seeD.J. Hartfiel 16 (1976) 325–328Maxson, C.J.,seeD.J. Hartfiel 22 (1978) 105–109Maxson, C.J.,seeD.J. Hartfiel 34 (1981) 261–274Maxwell, M.M., On rational structures and their asymptotics178(1-3) (1998) 257–266Maybee, J.S.,seeJ.R. Lundgren 119(1993) 113–122Mayer, J., L’epaisseur du graphe complet de 46 sommets (Note) 1 (1971) 209–210


Mayer, J., Hadwiger’s conjecture(k = 6): Neighbour configurations of 6-vertices in contraction-critical graphs74 (1989) 137–148

Mayer, J., Conjecture de Hadwiger:k = 6. II—Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques101(1992) 213–222

Mayer, J.,seeO.V. Borodin 102(1992) 97–98Mayer, J., Case 6 of Hadwiger’s conjecture. III. The problem of 7-vertices111(1993) 381–387Mayhew, G.L., Weight class distributions of de Bruijn sequences (Note) 126(1994) 425–429Mazoyer, J. and I. Rapaport, Global fixed point attractors of circular cellular automata and periodic tilings of the

plane: Undecidability results199(1-3) (1999) 103–122Mazzocca, F. and N. Melone, Caps and Veronese varieties in projective Galois spaces48 (1984) 243–252Mazzocca, F., On a class of lattices associated withn-cubes 49 (1984) 133–138Mazzone, S.,seeF. Luccio 64 (1987) 209–219McAvaney, K., J. Robertson and D. DeTemple, A characterization and hereditary properties for partition graphs

113(1993) 131–142McAvaney, K.,seeB. Alspach 151(1-3) (1996) 19–38McAvaney, K.L., D.D. Grant and D.A. Holton, Stable and semi-stable unicyclic graphs9 (1974) 277–288McAvaney, K.L.,seeD.W. DeTemple 113(1993) 255–258McBeth (Rod McBeth), M.A., Partitions and normal trees79 (1989/90) 95–101McCanna, J.E., Orientations of then-cube with minimum diameter (Communication) 68 (1988) 309–310McCarthy, D.,seeG. Haggard 14 (1976) 139–156McCarthy, D. and S.A. Vanstone, Embedding(r,1)-designs in finite projective planes19 (1977) 67–76McCarthy, D. and S.A. Vanstone, On the structure of regular pairwise balanced designs25 (1979) 237–244McCarthy, P.J., Matchings in graphs II11 (1975) 141–145McCuaig, W., Existence of graphs with specified cycle lengths78 (1989) 127–133McCuaig, W., Cycles through edges in cyclicallyk-connected cubic graphs (Note) 103(1992) 95–98McCuaig, W.,seeM. Katchalski 142(1-3) (1995) 141–154McDiarmid, C.,seeR. Hochberg 138(1-3) (1995) 261–265McDiarmid, C., Hypergraph colouring and the Lovász Local Lemma167-168(1-3) (1997) 481–486McDiarmid, C. and B. Reed, Colouring proximity graphs in the plane199(1-3) (1999) 123–137McDiarmid, C.J.H. and A. Sánchez-Arroyo, An upper bound for total colouring of graphs111(1993) 389–392McDiarmid, C.J.H. and A. Sánchez-Arroyo, Total colouring regular bipartite graphs is NP-hard124 (1994)

155–162McDiarmid, C.J.H. and J.R. Alfonsin, Sharing jugs of wine125(1994) 279–287McDonnell, E.,seeG. Gordon 147(1-3) (1995) 297–300McDonough, T.P., A 2-design admitting Co3 (Note) 38 (1982) 113–115McDougal, K., On asymmetric (0,1)-matrices with given row and column sum vectors137 (1-3) (1995) 377–

381McDougal, K., A generalization of Ryser’s theorem on term rank170(1-3) (1997) 283–288McEliece, R.,seeS. Dolinar 106/107(1992) 189–198McEliece, R.J., Weight congruences forp-ary cyclic codes 3 (1972) 177–192McFarlane, I.,seeS.G. Hoggar 138(1-3) (1995) 267–280McGuinness, S.,seeD.A. Gregory 59 (1986) 267–273McGuinness, S. and R. Rees, On the number of distinct minimal clique partitions and clique covers of a line

graph 83 (1990) 49–62McGuinness, S., On bounding the chromatic number of L-graphs154(1-3) (1996) 179–187McHugh, J. and Y. Perl, Best location of service centers in a treelike network under budget constraints86(1990)

199–214McKay, B.D., Hadamard equivalence via graph isomorphism (Note) 27 (1979) 213–214McKay, B.D.,seeR.L. Hemminger 55 (1985) 255–265McKay, B.D.,seeR.P. Brent 66 (1987) 35–49McKay, J.,seeC.W.H. Lam 45 (1983) 319–321McKee, T.A., A quantifier for matroid duality (Note) 34 (1981) 315–318McKee, T.A., Duality principles for binary matroids and graphs43 (1983) 215–222McKee, T.A., Recharacterizing Eulerian: Intimations of new duality51 (1984) 237–242McKee, T.A., Intersection properties of graphs89 (1991) 253–260


McKee, T.A.,seeF. Harary 128(1-3) (1994) 165–172McKee, T.A.,seeC.R. Johnson 159(1-3) (1996) 155–160McKee, T.A., Clique neighborhoods and nearly chordal graphs171(1-3) (1997) 179–189McKenzie, R. and R. Quackenbush, The spectrum of a lattice-primal algebra35 (1981) 157–163McKenzie, R.,seeJ. Berman 52 (1984) 7–29McMorris, F.R.,seeG.F. Estabrook 16 (1976) 141–147McMorris, F.R. and G.T. Myers, Some uniqueness results for upper bound graphs (Note) 44 (1983) 321–323McMorris, F.R.,seeJ. Lehel 74 (1989) 341–346McMorris, F.R. and H.M. Mulder, Subpath acyclic digraphs154(1-3) (1996) 189–201McMullen, P., Constructions for projectively unique polytopes14 (1976) 347–358McMullen, P.,seeS. Gallivan 34 (1981) 25–29McMullen, P., Regular polyhedra related to projective linear groups91 (1991) 161–170McNulty, G. and W. Taylor, Combinatory interpolation theorems12 (1975) 193–200McNulty, G.F.,seeJ.P. Hutchinson 45 (1983) 255–275McQuillan, D. and R.B. Richter, On the crossing numbers of certain generalized Petersen graphs (Note) 104

(1992) 311–320McRae, A.,seeJ. Dunbar 199(1-3) (1999) 35–47McRae, A.A.,seeI. Broere 138(1-3) (1995) 125–135McRae, A.A.,seeJ.E. Dunbar 138(1-3) (1995) 229–246McRae, A.A.,seeJ. Dunbar 149(1-3) (1996) 311–312McRae, A.A.,seeJ.E. Dunbar 167-168(1-3) (1997) 261–269McRae, A.A.,seeE.J. Cockayne 176(1-3) (1997) 43–61McSorley, J.P., Counting structures in the Möbius ladder184(1-3) (1998) 137–164McSorley, J.P., Single-change circular covering designs197-198(1-3) (1999) 561–588Meerdink, T.,seeA. Bialostocki 150(1-3) (1996) 49–60Megiddo, N., Mixtures of order matrices and generalized order matrices19 (1977) 177–181Megyesi, L.,seeA.P. Huhn 41 (1982) 327–330Mehrabadi, M.L.,seeH. Hajiabolhassan 199(1-3) (1999) 233–236Meijers, J.J.H.,seeJ. Francke 110(1992) 119–134Meir, A., seeP. Erdös 2 (1972) 207–228Meir, A., seeP. Erdös 19 (1977) 229–233Meir, A. and J.W. Moon, On an asymptotic evaluation of the cycle index of the symmetric group (Note) 46

(1983) 103–105Meir, A. and J.W. Moon, On path entropy functions for rooted trees138(1-3) (1995) 319–326Meixner, T. and A. Pasini, On flat extended grids174(1-3) (1997) 207–226Melfi, G., seeJ.-M. Deshouillers 200(1-3) (1999) 49–54Melissen, J.B.M. and P.C. Schuur, Packing 16, 17 or 18 circles in an equilateral triangle145(1-3) (1995) 333–

342Melkman, A.,seeI.F. Blake 23 (1978) 97–104Mel’nikov, L.S.,seeA.V. Kostochka 14 (1976) 403–406Mel’nikov, L.S. and R. Steinberg, One counterexample for two conjectures on three coloring (Note) 20 (1977)

203–206Melone, N.,seeF. Mazzocca 48 (1984) 243–252Melter, R.A.,seeF. Harary 39 (1982) 123–127Melter, R.A.,seeF. Rhodes 194(1-3) (1999) 267–279Mendelsohn, E.,seeC.C. Lindner 20 (1977) 123–132Mendelsohn, E. and N. Shalaby, Skolem labelled graphs97 (1991) 301–317Mendelsohn, E. and P. Rodney, The existence of court balanced tournament designs133(1-3) (1994) 207–216Mendelsohn, E.,seeP.B. Gibbons 155(1-3) (1996) 59–76Mendelsohn, E.,seeE.S. Mahmoodian 197-198(1-3) (1999) 543–554Mendelsohn, N.S.,seeS.H.Y. Hung 18 (1977) 23–33Mendelsohn, N.S., Perfect cyclic designs20 (1977) 63–68Mendelsohn, N.S.,seeC.C. Lindner 32 (1980) 271–280Meng, J., The generalizedS-graphs of diameter 3 140(1-3) (1995) 95–106Meng, J. and Q. Huang, Almost all Cayley graphs have diameter 2178(1-3) (1998) 267–269


Meng, J. and M. Xu, On the isomorphism problem of Cayley graphs of Abelian groups187(1-3) (1998) 161–169

Mengersen, I.,seeH. Harborth 60 (1986) 193–197Mengersen, I.,seeH. Harborth 73 (1988/89) 91–98Menon, K.V., A determinant of symmetric forms48 (1984) 87–93Menon, K.V., Note of some determinants ofq-binomial numbers (Note) 61 (1986) 337–341Mercier, A., Quelques identités de l’analyse combinatoire49 (1984) 139–149Mercier, A., Identities containing Gaussian binomial coefficients (Note) 76 (1989) 67–73Merlini, D., seeC. Corsani 180(1-3) (1998) 107–122Merris, R., Majorization of characters of the symmetric group39 (1982) 167–169Merris, R.,seeR. Grone 69 (1988) 97–99Mertens, D.,seeK. Bongartz 85 (1990) 17–42Meschiari, M.,seeA. Cavicchioli 137(1-3) (1995) 99–136Meshulam, R., An uncertainty inequality and zero subsums (Communication) 84 (1990) 197–200Meshulam, R.,seeE. Boros 150(1-3) (1996) 407–409Meshulam, R., On products of projections154(1-3) (1996) 307–310Mesner, D.M.,seeE.S. Kramer 10 (1974) 123–131Mesner, D.M.,seeE.S. Kramer 15 (1976) 263–296Mesner, D.M.,seeE.S. Kramer 36 (1981) 171–189Metsch, K.,seeA. Beutelspacher 66 (1987) 219–230Metsch, K., An optimal bound for embedding linear spaces into projective planes70 (1988) 53–70Metsch, K., Linear spaces with few lines110(1992) 215–222Metsch, K., Quasi-residual designs, 11

2-designs, and strongly regular multigraphs143(1-3) (1995) 167–188Metsch, K., Embedding theorems for locally projective three-dimensional linear spaces174(1-3) (1997) 227–

245Meyer, J.C., Nombre chromatique total du joint d’un ensemble stable par un cycle15 (1976) 41–54Meyer, J.C.,seeO. Favaron 91 (1991) 311–316Meyer, R.R., Mixed integer minimization models for piecewise-linear functions of a single variable16 (1976)

163–171Meyerowitz, A.,seeB. Manvel 94 (1991) 209–219Meyniel, H., On the perfect graph conjecture16 (1976) 339–342Meyniel, H.,seeP. Duchet 33 (1981) 103–105Meyniel, H.,seeP. Duchet 43 (1983) 21–27Meyniel, H.,seeP. Duchet 46 (1983) 319–321Meyniel, H.,seeM. Maamoun 51 (1984) 213–214Meyniel, H.,seeW. Bienia 61 (1986) 329–331Meyniel, H.,seeP. Duchet 62 (1986) 145–154Meyniel, H.,seeF. Maffray 64 (1987) 39–42Meyniel, H.,seeP. Duchet 65 (1987) 231–235Meyniel, H. and J.-P. Roudneff, The vertex picking game and a variation of the game of dots and boxes70

(1988) 311–313Meyniel, H., About colorings, stability and paths in directed graphs74 (1989) 149–150Meyniel, H.,seeP. Duchet 115(1993) 273–276Meyniel, H.,seeH. Jacob 154(1-3) (1996) 279–280Miao, Y., Existence of resolvable BIBDs withk=5 andλ=4 128(1-3) (1994) 283–303Miao, Y. and L. Zhu, Perfect Mendelsohn designs with block size six143(1-3) (1995) 189–207Miao, Y. and S. Kageyama, Two classes ofq-ary codes based on group divisible association schemes195(1-3)

(1999) 269–276Micale, B.,seeR. Gardner 171(1-3) (1997) 121–139Micale, B.,seeR. Gardner 175(1-3) (1997) 143–161Michael, J.,seeZ. Majcher 164(1-3) (1997) 225–236Michael, J.,seeZ. Majcher 164(1-3) (1997) 237–242Michalak, D., The binding numbers of some Cartesian products of graphs131(1-3) (1994) 363–366Michalak, D.,seeM. Borowiecki 191(1-3) (1998) 51–56


Michel, R., G. Taubenfeld and A. Berman, A connection between random variables and latink-cubes 146(1-3)(1995) 313–320

Middendorf, M. and F. Pfeiffer, On the complexity of recognizing perfectly orderable graphs (Communication)80 (1990) 327–333

Middendorf, M. and F. Pfeiffer, The max clique problem in classes of string-graphs108(1992) 365–372Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs111 (1993)

393–400Mielants, W. and G. Bruyneel, Minimal balanced sets and finite geometries37 (1981) 73–77Migliori, G., seeA. Maschietti 129(1-3) (1994) 149–158Mihók, P., On graphs critical with respect to vertex partition numbers (Communication) 37 (1981) 123–126Mihók, P.,seeS. Jendrol 71 (1988) 233–241Mihók, P., On the minimal reducible bound for outerplanar and planar graphs150(1-3) (1996) 431–435Mihók, P., J. Bucko and M. Voigt, On uniquely partitionable planar graphs191(1-3) (1998) 149–158Miklós, D., Great intersecting families of edges in hereditary hypergraphs48 (1984) 95–99Miklós, D., M.J. Newman, Á. Seress and D.B. West, The addition game: an abstraction of a communication

problem 68 (1988) 265–272Miklós, D. and A. Telcs, On fully extended self-avoiding polygons150(1-3) (1996) 437–440Miklós, D., On product of association schemes and Shannon capacity150(1-3) (1996) 441–447Milazzo, F.,seeM. Gionfriddo 97 (1991) 191–198Milazzo, L., The monochromatic block number165-166(1-3) (1997) 487–496Milazzo, L. and Z. Tuza, Upper chromatic number of Steiner triple and quadruple systems174 (1-3) (1997)

247–259Milazzo, L. and Zs. Tuza, Strict colourings for classes of steiner triple systems182(1-3) (1998) 233–243Milici, S., seeM. Gionfriddo 68 (1988) 107–110Milici, S., seeG. Quattrocchi 115(1993) 287–291Milici, S. and Z. Tuza, The spectrum ofλ-times repeated blocks for TS(v,λ) 129(1-3) (1994) 159–166Milici, S., G. Quattrocchi and H. Shen, Embeddings of Simple Maximum Packings of triples withλ Even 145

(1-3) (1995) 191–200Milici, S., seeM. Gionfriddo 155(1-3) (1996) 77–79Miller, D.J.,seeP. Hell 16 (1976) 195–207Miller, D.J.,seeP. Hell 108(1992) 297–305Miller, M., seeE. Dahlhaus 187(1-3) (1998) 269–271Miller, M., seeM. Sutton 195(1-3) (1999) 287–293Miller, M.D. and R.J. Friedlander, On some sequencing problems in finite groups19 (1977) 77–84Miller, R.L., Necklaces, symmetries and self-reciprocal polynomials22 (1978) 25–33Miller, W.P., Techniques in matroid reconstruction170(1-3) (1997) 173–183Miller, Z., Contractions of graphs: A theorem of ore and an extremal problem21 (1978) 261–272Miller, Z., Extremal regular graphs for the achromatic number40 (1982) 235–253Miller, Z. and D. Pritikin, The harmonious coloring number of a graph93 (1991) 211–228Miller, Z. and D. Pritikin, Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube

131(1-3) (1994) 183–194Mills, G., A quintessential proof of van der Waerden’s theorem on arithmetic progressions (Note) 47 (1983)

117–120Mills, W.H., D.P. Robbins and H. Rumsey Jr., Enumeration of a symmetry class of plane partitions67 (1987)

43–55Mills, W.H., seeD. de Caen 91 (1991) 65–77Milman, V.D.,seeM.G. Karpovsky 22 (1978) 273–280Milman, V.D.,seeM.G. Karpovsky 24 (1978) 177–184Milne, S.C., Classical partition functions and theU(n+ 1) Rogers–Selberg identity99 (1992) 199–246Milne, S.C. and G.M. Lilly, Consequences of theAl andCl Bailey transform and Bailey lemma139 (1-3)

(1995) 319–346Milne, S.C. and G. Bhatnagar, A characterization of inverse relations193(1-3) (1998) 235–245Milner, E.C.,seeD.J. Kleitman 6 (1973) 141–147Milner, E.C.,seeE. Györi 23 (1978) 235–240


Milner, E.C. and N. Sauer, Remarks on the cofinality of a partially ordered set, and a generalization of König’slemma 35 (1981) 165–171

Milner, E.C. and K. Prikry, A partition relation for triples using a model of Todorcevic 95 (1991) 183–191Milner, E.C., The use of elementary substructures in combinatorics136(1-3) (1994) 243–252Milner, E.C.,seeB. Li 175(1-3) (1997) 197–209Milner, E.C.,seeB. Li 176(1-3) (1997) 185–195Milner, E.C.,seeB. Li 183(1-3) (1998) 213–221Milutinovi c, U.,seeS. Klavžar 133(1-3) (1994) 297–300Min, Z.K., seeM.S. Zeng 133(1-3) (1994) 319–324Minh, H.N., Fonctions de Dirichlet d’ordren et de paramètret 180(1-3) (1998) 221–241Minoux, M., Bideterminants, arborescences and extension of the Matrix-Tree Theorem to semirings171 (1-3)

(1997) 191–200Minoux, M., A generalization of the all minors matrix tree theorem to semirings199(1-3) (1999) 139–150Minsker, S.,seeC.S. Klein 114(1993) 283–295Mirsky, L., seeH. Burkill 6 (1973) 15–28Mirsky, L., seeH. Burkill 20 (1977) 103–108Misfeld, J. and C. Zanella, The line geometry of a class of linear spaces174(1-3) (1997) 261–269Mishima, M. and M. Jimbo, A series of identities for the coefficients of inverse matrices on a Hamming scheme

156(1-3) (1996) 285–290Mislove, M.,seeJ.D. Lawson 63 (1987) 225–230Misra, B.L. and M.L. Chandak, Construction of symmetric PBIB designs and related results (Note) 34 (1981)

85–87Misra, B.L., On construction of partially balancedn-ary designs 62 (1986) 59–64Mitas, J., Interval orders based on arbitrary ordered sets144(1-3) (1995) 75–95Mitchell, C.,seeJ. Jedwab 125(1994) 241–254Mitchell, C.J., An infinite family of symmetric designs26 (1979) 247–250Mitchell, S.,seeA. Farley 25 (1979) 189–193Mitchell, S.L., Another characterization of the centroid of a tree24 (1978) 277–280Mitchem, J.,seeH.V. Kronk 5 (1973) 253–260Mitchem, J.,seeA.M. Hobbs 16 (1976) 233–239Mitchem, J., An extension of Brooks’ theorem ton-degenerate graphs17 (1977) 291–298Mitchem, J., A short proof of Catlin’s extension of Brooks’ Theorem (Note) 21 (1978) 213–214Mitchem, J., On the harmonious chromatic number of a graph74 (1989) 151–157Mitchem, J.,seeS.L. Hakimi 149(1-3) (1996) 93–98Mitchem, J. and P. Morriss, On the cost-chromatic number of graphs171(1-3) (1997) 201–211Miyakawa, M.,seeV. Lashkia 156(1-3) (1996) 277–283Miyamoto, I., Computation of some Cayley diagrams72 (1988) 291–293Miyano, H.,seeY. Kajitani 72 (1988) 187–194Mizuno, H.,seeK. Ando 65 (1987) 109–114Mizuno, H. and I. Sato, Ramsey numbers for unions of some cycles69 (1988) 283–294Mizuno, H. and I. Sato, Characteristic polynomials of some graph coverings142(1-3) (1995) 295–298Mizuno, H. and I. Sato, Enumeration of finite field labels on graphs176(1-3) (1997) 197–202Mizutani, H.,seeH. Enomoto 104(1992) 159–166Moak, D.,seeR. Shelton 61 (1986) 107–114Moak, D., K. Heuvers, K.P.S.B. Rao and K. Collins, An inversion relation of multinomial type131(1-3) (1994)

195–204Moak, D.S.,seeK.J. Heuvers 88 (1991) 21–32Moews, D., Optimally pebbling hypercubes and powers190(1-3) (1998) 271–276Mohan, R.N., A note on the construction of certain BIB designs (Note) 29 (1980) 209–211Mohan, R.N.,seeS. Kageyama 45 (1983) 113–121Mohanty, S.G.,seeB.R. Handa 15 (1976) 137–140Mohanty, S.G.,seeB.R. Handa 26 (1979) 119–128Mohanty, S.G.,seeB.R. Handa 50 (1984) 319–322Mohanty, S.G.,seeT. Watanabe 64 (1987) 281–288Mohanty, S.G.,seeC. Krattenthaler 126(1994) 195–208


Mohanty, S.G.,seeC. Krattenthaler 139(1-3) (1995) 273–285Mohanty, S.P., Shortest string containing all permutations (Note) 31 (1980) 91–95Mohanty, S.P.,seeB.S. Panda 146(1-3) (1995) 179–209Mohar, B., Akempic triangulations with 4 odd vertices54 (1985) 23–29Mohar, B., T. Pisanski, M. Škoviera and A. White, The Cartesian product of three triangles can be embedded into

a surface of genus 7 (Communication) 56 (1985) 87–89Mohar, B., On the cycle space of graphs (Communication) 58 (1986) 79–80Mohar, B., An obstruction to embedding graphs in surfaces78 (1989) 135–142Mohar, B., Some relations between analytic and geometric properties of infinite graphs95 (1991) 193–219Mohar, B., Laplace eigenvalues of graphs—a survey109(1992) 171–183Mohar, B., 7-critical graphs of bounded genus (Note) 112(1993) 279–281Mohar, B., A polynomial time circle packing algorithm (Communication) 117(1993) 257–263Mohar, B.,seeS. Fisk 134(1-3) (1994) 49–62Mohar, B.,seeS. Klavžar 138(1-3) (1995) 301–314Mohar, B., N. Robertson and R.P. Vitray, Planar graphs on the projective plane149(1-3) (1996) 141–157Mohar, B., Straight-line representations of maps on the torus and other flat surfaces155(1-3) (1996) 173–181Mohar, B., Apex graphs with embeddings of face-width three176(1-3) (1997) 203–210Mohar, B.,seeD. Marušic 182(1-3) (1998) 1Mohar, B., On the orientable genus of graphs with bounded nonorientable genus182(1-3) (1998) 245–253Mohar, B.,seeD. Klabjan 186(1-3) (1998) 167–175Mohar, B.,seeM. Juvan 187(1-3) (1998) 137–149Möhring, R.H., Almost all comparability graphs are UPO50 (1984) 63–70Möhring, R.H.,seeM. Habib 63 (1987) 157–182Möhring, R.H.,seeM. Habib 88 (1991) 211–229Molev, A.I., Stirling partitions of the symmetric group and Laplace operators for the orthogonal Lie algebra180

(1-3) (1998) 281–300Molina, R., The centroidal branches of a separable graph are edge reconstructible179(1-3) (1998) 133–143Moll, C., seeW. Hochstättler 153(1-3) (1996) 165–176Mollard, M., Une nouvelle famille de 3-codes parfaits sur GF(q) (Communication) 49 (1984) 209–212Mollard, M. and C. Payan, Some progress in the packing of equal circles in a square (Communication) 84

(1990) 303–307Mollard, M., Cycle-regular graphs89 (1991) 29–41Mollard, M., Two characterizations of generalized hypercube93 (1991) 63–74Mollard, M., Interval-regularity does not lead to interval motonicity (Communication) 118(1993) 233–237Möller, R.G., Topological groups, automorphisms of infinite graphs and a theorem of Trofimov178(1-3) (1998)

271–275Molloy, M.S.O.,seeD. Achlioptas 179(1-3) (1998) 1–11Monjardet, B., Hypergraphs and Sperner’s theorem (Note) 5 (1973) 287–289Monjardet, B., Metrics on partially ordered sets—A survey35 (1981) 173–184Monjardet, B. and R. Wille, On finite lattices generated by their doubly irreducible elements73 (1988/89) 163–

164Monjardet, B.,seeC. Chameni Nembua 111(1993) 105–112Monjardet, B., On a dependence relation in finite lattices165-166(1-3) (1997) 497–505Monjardet, B., On the comparison of the Spearman and Kendall metrics between linear orders192(1-3) (1998)

281–292Monroe, T.R.,seeW.T. Trotter Jr. 39 (1982) 87–101Monson, S.D.,seeL.B. Beasley 195(1-3) (1999) 53–66Montágh, B., A simple proof and a generalization of an old result of Chung and Feller (Note) 87(1991) 105–108Montague, P.S., A new construction of lattices from codes over GF(3)135(1-3) (1994) 193–223Montaron, B., On incidence matrices of finite projective planes56 (1985) 227–237Monteiro, L.F., M. Abad, S. Savini and J. Sewald, Finite free generating sets189(1-3) (1998) 177–189Montenegro, E. and R. Salazar, A result about the incident edges in the graphsMk (Note) 122(1993) 377–380Montpetit, A., Note sur la notion d’equivalence entre deux codes lineaires65 (1987) 177–185Montpetit, A.,seeB. Courteau 89 (1991) 7–15Montpetit, A.,seeB. Courteau 90 (1991) 267–280


Moon, A., An embedding theorem for affine resolvable designs40 (1982) 255–259Moon, A., Characterization of the odd graphsOk by parameters 42 (1982) 91–97Moon, J.M., Some enumeration problems for similarity relations26 (1979) 251–260Moon, J.W., Embedding tournaments in simple tournaments2 (1972) 389–395Moon, J.W.,seeA. Meir 46 (1983) 103–105Moon, J.W., The number of trees with a 1-factor63 (1987) 27–37Moon, J.W., Some determinant expansions and the matrix-tree theorem124(1994) 163–171Moon, J.W.,seeA. Meir 138(1-3) (1995) 319–326Moon, J.W.,seeS. Tazawa 143(1-3) (1995) 287–291Moon, J.W., On the total distance between nodes in tournaments151(1-3) (1996) 169–174Moon, J.W., On the number of induced subgraphs of trees167-168(1-3) (1997) 487–496Moore Jr., J.I.,seeW.T. Trotter Jr. 15 (1976) 79–84Moore Jr., J.I.,seeW.T. Trotter Jr. 16 (1976) 361–381Moore Jr., J.I., Interval hypergraphs andD-interval hypergraphs 17 (1977) 173–179Moorhouse, T.B. and D.G. Corneil, Completeness for intersection classes190(1-3) (1998) 277–286Mor, M. and A.S. Fraenkel, Cayley permutations48 (1984) 101–112Mora, M.,seeJ.M. Brunat 165-166(1-3) (1997) 125–137Mora, M.,seeJ.M. Brunat 197-198(1-3) (1999) 157–167Moran, G., The bireflections of a permutation15 (1976) 55–62Moran, G., The product of two reflection classes of the symmetric group15 (1976) 63–77Moran, G., Some coefficients in the center of the group algebra of the symmetric group21 (1978) 75–81Moran, G., Ther-majority vote action on 0–1 sequences132(1-3) (1994) 145–174Moran, G., Parametrization for stationary patterns of ther-majority operators on 0–1 sequences132 (1-3)

(1994) 175–195Moran, J.F., The growth rate and balance of homogeneous tilings in the hyperbolic plane173 (1-3) (1997)

151–186Moran, S.,seeP. Erdös 64 (1987) 1–11Morayne, M., Partial-order analogue of the secretary problem The binary tree case184(1-3) (1998) 165–181Moreira, M.L.,seeR. Cordovil 89 (1991) 161–171Moreira, M.L.,seeR. Cordovil 111(1993) 131–136Moreno, O., On primitive elements of trace equal to 1 in GF(2m) 41 (1982) 53–56Morgan, I.H., Construction of complete sets of mutually equiorthogonal frequency hypercubes186(1-3) (1998)

237–251Morgana, A.,seeP. Marchioro 50 (1984) 239–251Morgana, A.,seeP. Marchioro 51 (1984) 47–61Morgana, A.,seeP. Marchioro 69 (1988) 253–261Morgana, A.,seeD. Bauer 79 (1989/90) 59–70Morgana, A.,seeD. Bauer 79 (1989/90) 147–152Morgana, A.,seeD. Bauer 124(1994) 13–17Morillo, P., seeC. Padró 149(1-3) (1996) 189–204Morris, C.A.N.,seeD.H. Griffel 145(1-3) (1995) 291–293Morris, I. and C.B. Wensley, Adams operations andλ-operations inβ-rings 50 (1984) 253–270Morris, I. and C.D. Wensley, Cycle indices and subgroup lattices118(1993) 173–195Morris, J.,seeE. Dobson 189(1-3) (1998) 69–78Morris, S.B. and R.E. Hartwig, The generalized faro shuffle15 (1976) 333–346Morriss, P.,seeJ. Mitchem 171(1-3) (1997) 201–211Morvan, M.,seeM. Habib 111(1993) 289–303Moser, W.O.J.,seeM. Abramson 6 (1973) 1–14Moser, W.O.J., A generalization of Riordan’s formula for 3× n Latin rectangles (Note) 40 (1982) 311–313Moser, W.O.J.,seeJ. Komlós 143(1-3) (1995) 281–285Moss, L.S., Distanced graphs102(1992) 287–305Moszkowski, P.,seeG. Kreweras 68 (1988) 71–76Moszkowski, P.,seeG. Kreweras 87 (1991) 291–296Moszkowski, P.,seeS. Benchekroun 176(1-3) (1997) 273–277Motzkin, T.S.,seeR.L. Graham 2 (1972) 17–29


Moulton, D.P.,seeD.C. Isaksen 175(1-3) (1997) 265–269Moulton, V.,seeJ. Koolen 192(1-3) (1998) 205–222Mouyart, A.-F., Decomposition of the complete hypergraph into hyperclaws76 (1989) 137–150Mubarakzianow, R.,seeJ. Alpin 175(1-3) (1997) 1–11Mudrinski, V.,seeD.M. Acketa 163(1-3) (1997) 209–210Muir, A., seeM.W. Warner 33 (1981) 209–221Mukerjee, R. and S. Gupta, Geometric construction of balanced block designs with nested rows and columns

(Note) 91 (1991) 105–108Mukhopadhyay, A., On the probability that the determinant of ann× n matrix over a finite field vanishes (Note)

51 (1984) 311–315Mulay, S.B. and C.G. Wagner, Finitary bases and formal generating functions190(1-3) (1998) 177–189Mulazzani, M., Lins–Mandel graphs representing 3-manifolds140(1-3) (1995) 107–118Mulder, H.M. and A. Schrijver, Median graphs and Helly hypergraphs25 (1979) 41–50Mulder, H.M., Interval-regular graphs41 (1982) 253–269Mulder, H.M.,seeH.-J. Bandelt 50 (1984) 117–134Mulder, H.M.,seeH.-J. Bandelt 62 (1986) 245–260Mulder, H.M.,seeH.-J. Bandelt 91 (1991) 221–230Mulder, H.M.,seeH.-J. Bandelt 94 (1991) 161–180Mulder, H.M., Julius Petersen’s theory of regular graphs100(1992) 157–175Mulder, H.M.,seeH.-J. Bandelt 109(1992) 13–26Mulder, H.M.,seeF.R. McMorris 154(1-3) (1996) 189–201Mulder, H.M.,seeA.E. Brouwer 169(1-3) (1997) 153–155Mulder, H.M.,seeS. Klavžar 187(1-3) (1998) 255–258Mulder, M., The structure of median graphs24 (1978) 197–204Mulder, M.,(0, λ)-graphs andn-cubes 28 (1979) 179–188Mull, B.P., D. Kountanis and R. Rashidi, Uniform strong 2-cell imbeddings of bridgeless graphs143 (1-3)

(1995) 209–220Mulla, F.S., A class of graphs for which the Ulam conjecture holds (Note) 22 (1978) 197–198Mullen, G.L. and R.E. Weber, Latin cubes of order6 5 32 (1980) 291–297Mullen, G.L., Polynomial representation of complete sets of mutually orthogonal frequency squares of prime

power order 69 (1988) 79–84Mullen, G.L.,seeL.J. Brant 69 (1988) 115–121Mullen, G.L.,seeJ. Dénes 111(1993) 157–163Müller, H., Oriented hypergraphs, stability numbers and chromatic numbers (Note) 34 (1981) 319–320Müller, H., On edge perfectness and classes of bipartite graphs149(1-3) (1996) 159–187Müller, H., seeD. Kratsch 150(1-3) (1996) 231–245Müller, H., HAMILTONian circuits in chordal bipartite graphs156(1-3) (1996) 291–298Müller, H. and J.-X. Rampon, Partial orders and their convex subsets165-166(1-3) (1997) 507–517Müller, V., J. Nešetril and J. Pelant, Either tournaments or algebras?11 (1975) 37–66Müller, V., On colorings of graphs without short cycles26 (1979) 165–176Müller, V., seeA. Fernández 108(1992) 25–30Müller, W.B.,seeR. Lidl 92 (1991) 211–220Mullhaupt, A.P.,seeR.M. Grassl 79 (1989/90) 153–167Mullin, R.C., P.J. Schellenberg, S.A. Vanstone and W.D. Wallis, On the existence of frames37 (1981) 79–104Mullin, R.C.,seeP. Erdös 47 (1983) 49–62Mullin, R.C., Finite bases for some PBD-closed sets77 (1989) 217–236Mullin, R.C. and D.R. Stinson, Pairwise balanced designs with odd block sizes exceeding five84 (1990) 47–62Mullin, R.C. and D. Wevrick, Singular points in pair covers and their relation to Hadamard designs92 (1991)

221–225Mullin, R.C.,seeD. Jungnickel 97 (1991) 269–277Mullin, R.C.,seeD.G. Hoffman 146(1-3) (1995) 97–108Munuera, C., On MDS elliptic codes (Note) 117(1993) 279–286Mureddu, M.,seeL. Cerlienco 133(1-3) (1994) 79–88Mureddu, M.,seeL. Cerlienco 139(1-3) (1995) 73–87Murphy, G. and R. Ding, Grünbaum’s gap conjecture69 (1988) 295–300


Murphy, J.P.,seeM.J. Grannell 167-168(1-3) (1997) 341–352Murphy, O., Lower bounds on the stability number of graphs computed in terms of degrees (Note) 90 (1991)

207–211Murphy, O.,seeJ. Griggs 152(1-3) (1996) 157–170Murty, U.S.R., Extremal critically connected matroids8 (1974) 49–58Murty, U.S.R.,seeR.P. Anstee 54 (1985) 113–116Mushtaq, Q. and F. Shaheen, Factor groups ofG6,6,6 through coset diagrams for an action on PL(Fq) 126

(1994) 225–238Mushtaq, Q., On word structure of the modular group over finite and real quadratic fields178 (1-3) (1998)

155–164Mushtaq, Q. and M. Aslam, Group generated by two elements of orders two and six acting onR andQ(

√n)

179(1-3) (1998) 145–154Muthusamy, A. and P. Paulraja, Path factorizations of complete multipartite graphs195(1-3) (1999) 181–201Mutzel, P.,seeM. Jünger 182(1-3) (1998) 169–176Muzychuk, M., On Ádám’s conjecture for circulant graphs167-168(1-3) (1997) 497–510Muzychuk, M., On Ádám’s conjecture for circulant graphs176(1-3) (1997) 285–298Muzychuk, M. and M. Klin, On graphs with three eigenvalues189(1-3) (1998) 191–207Muzychuk, M., On the isomorphism problem for cyclic combinatorial objects197-198(1-3) (1999) 589–606Mycielski, J.,seeV. Faber 4 (1973) 339–345Myers, B.R., Regular separable graphs of minimum order with given diameter33 (1981) 289–311Myers, G.T.,seeF.R. McMorris 44 (1983) 321–323Myers Jr., R.W., 1-homogeneous graphs57 (1985) 67–88Mykkeltveit, J.,seeT. Helleseth 18 (1977) 179–211Mykkeltveit, J.,seeE.R. Hauge 148(1-3) (1996) 65–83Mykkeltveit, J.,seeE.R. Hauge 189(1-3) (1998) 133–147Mynhardt, C.M.,seeI. Broere 26 (1979) 209–212Mynhardt, C.M.,seeE.J. Cockayne 76 (1989) 117–121Mynhardt, C.M.,seeB. Bollobás 86 (1990) 89–97Mynhardt, C.M., Lower Ramsey numbers for graphs91 (1991) 69–75Mynhardt, C.M.,seeE.J. Cockayne 122(1993) 89–102Mynhardt, C.M.,seeE.J. Cockayne 125(1994) 137–146Mynhardt, C.M.,seeE.J. Cockayne 138(1-3) (1995) 199–205Mynhardt, C.M.,seeE.J. Cockayne 141(1-3) (1995) 75–84Mynhardt, C.M.,seeE.J. Cockayne 159(1-3) (1996) 57–68Mynhardt, C.M.,seeA.P. Burger 163(1-3) (1997) 47–66Mynhardt, C.M.,seeE.J. Cockayne 167-168(1-3) (1997) 205–214Mynhardt, C.M.,seeE.J. Cockayne 188(1-3) (1998) 253–260Myrvold, W., The degree sequence is reconstructible fromn− 1 cards 102(1992) 187–196Naddef, D., N. Sbihi and M. Tchuente, Independence systems with continuous cardinality of bases (Communica-

tion) 31 (1980) 107–109Naddef, D. and W.R. Pulleyblank, Matchings in regular graphs34 (1981) 283–291Nagoya, S.,seeY. Egawa 58 (1986) 93–95Nagy, A.,seeP. Bugata 158(1-3) (1996) 37–47Naik, R.N.,seeV.N. Bhat-Nayak 20 (1977) 93–102Naik, R.N.,seeV.N. Bhat-Nayak 23 (1978) 17–22Naik, R.N.,seeV.N. Bhat-Nayak 47 (1983) 169–175Naiman, D.Q. and H.P. Wynn, A theorem on independence (Note) 120(1993) 287–289Naiman, D.Q. and H.P. Wynn, Independence number and the complexity of families of sets154 (1-3) (1996)

203–216Nair, B.R. and A. Vijayakumar, About triangles in a graph and its complement131(1-3) (1994) 205–210Nair, B.R. and A. Vijayakumar, Strongly edge triangle regular graphs and a conjecture of Kotzig158 (1-3)

(1996) 201–209Nair, P.S., Construction of self-complementary graphs175(1-3) (1997) 283–287Naitoh, T.,seeK. Ando 148(1-3) (1996) 299–303Naji, W., Reconnaissance des graphes de cordes (Communication) 54 (1985) 329–337


Nakada, F.,seeJ. Akiyama 75 (1989) 7–9Nakada, H.,seeT. Soneoka 63 (1987) 53–66Nakamoto, A., Transformations in closed 2-cell embeddings on surfaces preserving specified properties197-

198(1-3) (1999) 607–615Nakamura, G.,seeK. Heinrich 92 (1991) 107–125Nakashima, J.,seeP. Frankl 140(1-3) (1995) 265–267Nakatsuka, I.,seeH. Umeo 62 (1986) 319–323Nam, Y.,seeR.P. Anstee 184(1-3) (1998) 15–24Nandakumar, R.,seeK.R. Parthasarathy 46 (1983) 69–74Nara, C. and S.-i. Tachibana, A note on upper bounds for some Ramsey numbers (Communication) 45 (1983)

323–326Nara, C.,seeB. Bollobás 62 (1986) 271–275Nara, C.,seeS. Tazawa 143(1-3) (1995) 287–291Nara, C. and S. Tazawa, Enumeration of unlabelled graphs with specified degree parities183(1-3) (1998) 255–

264Narayana Rao, M.L., K. Satyanarayana and G. Vithal Rao, On a class of translation planes of square order66

(1987) 175–190Narendran, P., C. Ó’Dúnlaing and F. Otto, It is undecidable whether a finite special string-rewriting system

presents a group (Note) 98 (1991) 153–159Narushima, H.,seeA. Odaka 14 (1976) 269–271Narushima, H. and H. Era, A variant of inclusion-exclusion on semilattices (Note) 21 (1978) 215–217Narushima, H., Principle of inclusion–exclusion on partially ordered sets42 (1982) 243–250Narushima, H.,seeT. Hibi 72 (1988) 167–174Naserasr, R.,seeE.S. Mahmoodian 167-168(1-3) (1997) 451–460Nash-Williams, C.St.J.A., Reconstruction of locally finite connected graphs with two infinite wings92 (1991)

227–249Nash-Williams, C.St.J.A., Reconstruction of infinite graphs95 (1991) 221–229Nasu, M., Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs

39 (1982) 171–197Nathanson, M.B., Partial products in finite groups (Note) 15 (1976) 201–203Nathanson, M.B., A extremal problem for least common multiples64 (1987) 221–228Nathanson, M.B., Simultaneous systems of representatives and combinatorial number theory79(1989/90) 197–

205Nebesky, L., Left-right double trees1 (1971) 73–81Nedela, R.,seeM. Škoviera 78 (1989) 179–186Nedela, R., Covering spaces of locally homogeneous graphs121(1993) 177–188Nedela, R., Covering projections of graphs preserving links of vertices and edges134(1-3) (1994) 111–124Nederpelt, R.P., Bijections between formulae and trees which are compatible with equivalences of the type((f ◦ g) ◦ h)∼ ((f ◦ h) ◦ g) 59 (1986) 99–105

Negami, S., Uniqueness and faithfulness of embedding of toroidal graphs44 (1983) 161–180Negami, S. and G.-H. Xu, Locally geodesic cycles in 2-self-centered graphs58 (1986) 263–268Negami, S., Enumeration of projective-planar embeddings of graphs62 (1986) 299–306Negami, S., The spherical genus and virtually planar graphs70 (1988) 159–168Negami, S., Diagonal flips in triangulations of surfaces135(1-3) (1994) 225–232Negami, S.,seeS. Lawrencenko 135(1-3) (1994) 367–369Negro, A.,seeM.D. Atkinson 80 (1990) 115–122Nemhauser, G.L.,seeT. King 10 (1974) 117–121Nemhauser, G.L.,seeW.-L. Hsu 37 (1981) 181–191Nemhauser, G.L.,seeW.-l. Hsu 38 (1982) 65–71Nenov, N.D., On the small graphs with chromatic number 5 without 4-cliques (Letter to the editor) 188 (1-3)

(1998) 297–298Nešetril, J., Homomorphisms of derivative graphs1 (1971) 257–268Nešetril, J., seeV. Müller 11 (1975) 37–66Nešetril, J. and A. Pultr, On classes of relations and graphs determined by subobjects and factorobjects22

(1978) 287–300


Nešetril, J. and V. Rödl, A simple proof of the Galvin–Ramsey property of the class of all finite graphs and adimension of a graph 23 (1978) 49–55

Nešetril, J., seeS.A. Burr 54 (1985) 1–13Nešetril, J. and V. Rödl, Two remarks on Ramsey’s theorem (Communication) 54 (1985) 339–341Nešetril, J. and V. Rödl, The partite construction and Ramsey set systems75 (1989) 327–334Nešetril, J., seeG. Brightwell 88 (1991) 129–132Nešetril, J. and V. Rödl, On Ramsey graphs without bipartite subgraphs101(1992) 223–229Nešetril, J., seeW. Imrich 108(1992) 159–165Nešetril, J., seeP. Hell 109(1992) 117–126Nešetril, J., seeP. Gvozdjak 154(1-3) (1996) 77–84Nešetril, J., A. Raspaud and E. Sopena, Colorings and girth of oriented planar graphs165-166(1-3) (1997)

519–530Nešetril, J., seeO.V. Borodin 188(1-3) (1998) 73–85Neufeld, E.T., Orienting cycle elements in orientable rotation systems182(1-3) (1998) 255–265Neufeld, S. and R. Nowakowski, A game of cops and robbers played on products of graphs186 (1-3) (1998)

253–268Neumaier, A., Completely regular codes106/107(1992) 353–360Neumann, B.N.,seeA. Chi Kim 92 (1991) 145–158Neumann-Lara, V.,seeH. Galeana-Sánchez 48 (1984) 67–76Neumann-Lara, V. and J. Urrutia, Vertex criticalr-dichromatic tournaments49 (1984) 83–87Neumann-Lara, V.,seeH. Galeana-Sánchez 59 (1986) 257–265Neumann-Lara, V., N. Santoro and J. Urrutia, Uniquely colourablem-dichromatic oriented graphs62 (1986)

65–70Neumann-Lara, V. and J. Urrutia, A combinatorial result on points and circles on the plane69 (1988) 173–178Neumann-Lara, V.,seeH. Galeana-Sánchez 87 (1991) 271–280Neumann-Lara, V.,seeH. Galeana-Sánchez 94 (1991) 181–187Neumann-Lara, V., The 3 and 4-dichromatic tournaments of minimum order135(1-3) (1994) 233–243Neumann-Lara, V. and E. Rivera-Campo, Euler tours and a game with dominoes167-168(1-3) (1997) 511–517Neumann-Lara, V., The vertex critical 4-dichromatic circulant tournaments170(1-3) (1997) 289–291Neumann-Lara, V.,seeB. Ábrego 194(1-3) (1999) 1–11Neumann-Lara, V.,seeF. Larrión 197-198(1-3) (1999) 491–501Neumann-Lara, V., The acyclic disconnection of a digraph197-198(1-3) (1999) 617–632Neumann-Lara, V., E. Rivera-Campo and J. Urrutia, A note on covering the edges of a graph with bonds197-

198(1-3) (1999) 633–636Nevermann, P., Order varietes generated by∨-semilattices of finite width 53 (1985) 167–171Newhart, D.W., Information sets in quadratic-residue codes42 (1982) 251–266Newman, D.J.,seeA.G. Konheim 4 (1973) 57–63Newman, I.,seeI.B.-A. Hartman 87 (1991) 41–52Newman, I.,seeM. Karchmer 114(1993) 275–282Newman, M.J.,seeD. Miklós 68 (1988) 265–272Ng, L.L., Hamiltonian decomposition of complete regular multipartite digraphs177(1-3) (1997) 279–285Nguyen, H.Q., Functors of the category of combinatorial geometries and strong maps20 (1977) 143–158Nguyen, H.Q.,n-alternation deficiency of geometric rank-functions21 (1978) 273–283Nguyen, H.Q., Projections and weak maps in combinatorial geometries24 (1978) 281–289Nica, A., Crossings and embracings of set-partitions andq-analogues of the logarithm of the Fourier transform

157(1-3) (1996) 285–309Nicholson, G.E., A. Grubb and C.S. Sharma, Regular join endomorphisms on a complemented modular lattice of

finite rank 52 (1984) 235–242Nicholson, V.A., Collapsing unicolored graphs18 (1977) 55–61Nicolai, F.,seeH.-J. Bandelt 145(1-3) (1995) 37–60Nicolai, F.,seeA. Brandstädt 171(1-3) (1997) 27–42Nicolas, J.L.,seeP. Erdos 75 (1989) 155–166Nicolas, J.-L.,seeM. Deléglise 200(1-3) (1999) 27–48Niederhausen, H., Sequences of binomial type with polynomial coefficients50 (1984) 271–284Niederhausen, H., Factorials and Stirling numbers in the algebra of formal Laurent series90 (1991) 53–62


Niederhausen, H., Initial value problems in the logarithmic algebra94 (1991) 23–37Niederhausen, H., Fast Langrange inversion, with an application to factorial numbers104(1992) 99–110Niederhausen, H., Factorials and Stirling numbers in the algebra of formal Laurent series II:za -zb=t 132(1-3)

(1994) 197–213Niedermeyer, F.,f -Optimal factors of infinite graphs95 (1991) 231–254Niederreiter, H., A combinatorial problem for vector spaces over finite fields96 (1991) 221–228Niederreiter, H., Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions

in unit cubes 106/107(1992) 361–367Nieminen, J.,seeD. Bauer 47 (1983) 153–161Nieminen, J., Neutrality and betweenness in modular lattices (Note) 55 (1985) 329–332Nierstrasz, O.M.,seeC.B. Collins 36 (1981) 139–153Niessen, T. and B. Randerath, Regular factors of simple regular graphs and factor-spectra185 (1-3) (1998)

89–103Nijholt, A., A left part theorem for grammatical trees25 (1979) 51–63Nilli, A., On the second eigenvalue of a graph (Note) 91 (1991) 207–210Nishii, R., Optimality of experimental designs116(1993) 209–225Nishimura, T., Short cycles in digraphs72 (1988) 295–298Nishimura, T., Regular factors of line graphs (Note) 85 (1990) 215–219Nishimura, T. and A. Saito, Two recursive theorems onn-extendibility 162(1-3) (1996) 319–323Nishizeki, T., On the relationship between the genus and the cardinality of the maximum matchings of a graph

25 (1979) 149–156Nishizeki, T. and I. Baybars, Lower bounds on the cardinality of the maximum matchings of planar graphs28

(1979) 255–267Nishizeki, T., A 1-tough nonhamiltonian maximal planar graph (Communication) 30 (1980) 305–307Nishizeki, T., On the maximum matchings of regular multigraphs37 (1981) 105–114Nivat, M. and A. Podelski, Another variation on the common subexpression problem114(1993) 379–401Nivat, M., seeA. Del Lungo 157(1-3) (1996) 65–78Nobili, P. and A. Sassano, The anti-join composition and polyhedra119(1993) 141–166Noble, S.D., Recognising a partitionable simplicial complex is in NP152(1-3) (1996) 303–305Nojima, S.,seeA. Odaka 14 (1976) 269–271Nolan, J.M., C.D. Savage and H.S. Wilf, Basis partitions179(1-3) (1998) 277–283Nomura, K., An application of intersection diagrams of high rank127(1-3) (1994) 259–264Nomura, K., A remark on Mulder’s conjecture about interval-regular graphs147(1-3) (1995) 307–311Nonay, G.M.,seeJ.D. Horton 97 (1991) 251–264Noonan, J., The number of permutations containing exactly one increasing subsequence of length three152

(1-3) (1996) 307–313Norton, S.P.,seeR.P. Lewis 138(1-3) (1995) 315–318Novacky Jr., G.A.,seeC.-Y. Chao 41 (1982) 139–143Nowakowski, R. and I. Rival, The smallest graph variety containing all paths43 (1983) 223–234Nowakowski, R. and P. Winkler, Vertex-to-vertex pursuit in a graph43 (1983) 235–239Nowakowski, R.,seeR.E. Jamison 51 (1984) 35–39Nowakowski, R., Cutsets of boolean lattices63 (1987) 231–240Nowakowski, R. and I. Rival, Retract rigid Cartesian products of graphs70 (1988) 169–184Nowakowski, R.,seeS. Neufeld 186(1-3) (1998) 253–268Nowicki, K. and J.C. Wierman, Subgraph counts in random graphs using incompleteU -statistics methods 72

(1988) 299–310Nowitz, L.A., A non-Cayley-invariant Cayley graph of the elementary Abelian group of order 64110 (1992)

223–228Noy, M., seeF. Hurtado 149(1-3) (1996) 319–324Noy, M., Enumeration of noncrossing trees on a circle180(1-3) (1998) 301–313Nozaki, A.,seeV. Lashkia 156(1-3) (1996) 277–283Nudelman, S.P., The modularn-queens problem in higher dimensions146(1-3) (1995) 159–167Numata, M.,seeA.E. Brouwer 124(1994) 49–54Nurmela, K.J.,seeR.L. Graham 181(1-3) (1998) 139–154


Nýdl, V., Finite undirected graphs which are not reconstructible from their large cardinality subgraphs108(1992) 373–377

Nypelseer, V.,seeC. Lefevre-Percsy 84 (1990) 161–167Oates–Williams, S.,seeD. Donovan 92 (1991) 79–83Oates-Williams, S.,seeD.E. Bryant 138(1-3) (1995) 161–167Oates-Williams, S.,seeD.E. Bryant 167-168(1-3) (1997) 167–174O’Brien, G.L., A generalized notion of quotient for finite Abelian groups (Note) 37 (1981) 119–121Odaka, A., H. Fujita, S. Nojima and H. Narushima, A new normal form of Boolean functions14 (1976) 269–

271Odenthal, T.,seeM. Jünger 182(1-3) (1998) 169–176Odlyzko, A.M., On covering a product of sets with products of their subsets5 (1973) 373–380Odlyzko, A.M., J. Pintz and K.B. Stolarsky, Partitions of planar sets into small triangles57 (1985) 89–97Odlyzko, A.M.,seeZ. Füredi 63 (1987) 143–152Odlyzko, A.M. and W.D. Smith, Nonabelian sets with distinctk-sums 146(1-3) (1995) 169–177Odlyzko, A.M., Analytic methods in asymptotic enumeration153(1-3) (1996) 229–238Ó’Dúnlaing, C.,seeP. Narendran 98 (1991) 153–159Oellermann, O.R.,seeY. Alavi 62 (1986) 113–118Oellermann, O.R., The connected cutset connectivity of a graph69 (1988) 301–308Oellermann, O.R.,seeD.P. Day 127(1-3) (1994) 95–104Oellermann, O.R.,seeW. Goddard 132(1-3) (1994) 65–73Oellermann, O.R.,seeM.A. Henning 161(1-3) (1996) 161–173Oellermann, O.R.,seeM.A. Henning 161(1-3) (1996) 175–184Oellermann, O.R.,seeD.P. Day 197-198(1-3) (1999) 217–223Oellrich, H. and K. Steffens, On Dilworth’s decomposition theorem15 (1976) 301–304Oertel, P.,seeH. Harborth 73 (1988/89) 89–90Ohmori, H., Classification of weighing matrices of order 13 and weight 9116(1993) 55–78Okamura, H., Paths containing two adjacent edges in(2k+ 1)-edge-connected graphs111(1993) 401–407O’Keefe, C.M., T. Penttila and C.E. Praeger, Block-transitive, point-imprimitive designs withλ= 1 115(1993)

231–244O’Keefe, C.M., Ovoids in PG(3,q): a survey 151(1-3) (1996) 175–188O’Keefe, C.M. and A.A. Pascasio, Images of conics under derivation151(1-3) (1996) 189–199O’Keefe, C.M.,seeA. Blokhuis 197-198(1-3) (1999) 137–141Olariu, S., Weak bipolarizable graphs74 (1989) 159–171Olariu, S., Wings and perfect graphs80 (1990) 281–296Olariu, S.,seeP. Duchet 90 (1991) 99–101Olariu, S.,seeC.T. Hoàng 102(1992) 67–74Olariu, S., On sources in comparability graphs, with applications (Note) 110(1992) 289–292Olariu, S., Quasi-brittle graphs, a new class of perfectly orderable graphs113(1993) 143–153Olaru, E., The structure of imperfect critically strongly-imperfect graphs156(1-3) (1996) 299–302Olive, G.,seeR. Scurr 189(1-3) (1998) 209–219Olivos, J.,seeE. Goles 30 (1980) 187–189Ollmann, L.T.,seeB. Alspach 12 (1975) 205–209Olson, R.C., On the six conics problem10 (1974) 279–300Olson, W.H. and V.R.R. Uppuluri, On ‘valid sequences’ considered by Wigner5 (1973) 159–169Omura, J.K., Iterative decoding of linear codes by a modulo-2 linear program3 (1972) 193–208O’Neil, P.E., Hyperplane cuts of ann-cube 1 (1971) 193–195O’Neil, P.E., A constructive decomposition and Fulkerson’s characterization of permutation matrices1 (1971)

197–201O’Neil, P.E.,seeP. Erdös 4 (1973) 29–35O’Neil, P.E., Correction to a constructive decomposition and Fulkerson’s characterization of permutation matrices

(Note) 11 (1975) 401–402O’Neil, P.E.,seeM.D. Beeler 28 (1979) 135–146Ong, B.G.,seeC.L. Liu 4 (1973) 171–184Onn, S.,seeP. Kleinschmidt 102(1992) 75–77Ono, K., Odd values of the partition function169(1-3) (1997) 263–268


Oorschot, P.C.V. and S.A. Vanstone, On splitting sets in block designs and finding roots of polynomials84(1990) 71–85

Opatrny, J.,seeJ. Chvatalova 61 (1986) 141–150Opencomb, W.E., On the intricacy of combinatorial construction problems50 (1984) 71–97Oporowski, B., A decomposition of locally finite graphs117(1993) 161–168Oporowski, B.,seeG. Ding 149(1-3) (1996) 45–58Oporowski, B., Minor-equivalence for infinite graphs195(1-3) (1999) 203–227Oral, H., Self-orthogonal codes with distance four are not rigid104(1992) 263–271Ordaz, O.,seeB. Jackson 57 (1985) 199–201Ordaz, O.,seeO. Favaron 58 (1986) 243–252Ordaz, O.,seeP. Fraisse 71 (1988) 143–148Ordaz, O.,seeB. Jackson 84 (1990) 241–254Ordaz, O.,seeO. Favaron 121(1993) 55–63Ordaz, O.,seeD. Barraez 146(1-3) (1995) 11–18Ordaz, O.,seeC. Flores 152(1-3) (1996) 321–324Ordaz, O., D. Amar and A. Raspaud, Hamiltonian properties and the bipartite independence number161(1-3)

(1996) 207–215Ordaz, O.,seeD. Amar 181(1-3) (1998) 31–36Ordman, E.T.,seeP. Erdos 72 (1988) 93–101Osteen, R.E.,seeA.R. Bednarek 57 (1985) 155–158Östergård, P.R.J. and M.K. Kaikkonen, New upper bounds for binary covering codes178(1-3) (1998) 165–179Östergård, P.R.J., On the structure of optimal error-correcting codes179(1-3) (1998) 285–287Östergård, P.R.J.,seeR.L. Graham 181(1-3) (1998) 139–154Osterweil, L.J., Some classes of uniquely 3-colorable graphs8 (1974) 59–69Ostfeld, Z.,seeE. Korach 114(1993) 305–327Ostrand, P.A.,seeF. Harary 1 (1971) 7–18Ostrand, P.A., Graphs with specified radius and diameter4 (1973) 71–75Ostrand, P.A.,seeD. Burns 32 (1980) 99–103Ota, K., Cycles through prescribed vertices with large degree sum145(1-3) (1995) 201–210Ota, K.,seeY. Egawa 197-198(1-3) (1999) 225–246Otto, F., An example of a one-relator group that is not a one-relation monoid (Note) 69 (1988) 101–103Otto, F.,seeP. Narendran 98 (1991) 153–159Ou, J.,seeS.S. Abhyankar 133(1-3) (1994) 25–46Oubiña, L., Des cycles et cocycles en hypergraphes8 (1974) 71–80Oubiña, L. and R. Zucchello, A generalization of outerplanar graphs51 (1984) 243–249Oubiña, L.,seeM. Gutierrez 142(1-3) (1995) 77–85Ouyang, K.Z.,seeX.E. Chen 172(1-3) (1997) 17–29Ouyang, K.Z.,seeX.E. Chen 172(1-3) (1997) 31–38Overmars, M.H.,seeJ.A. La Poutré 114(1993) 329–359Owens, P.J., Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons (Communication) 36

(1981) 227–230Owens, P.J., Shortness parameters of families of regular planar graphs with two or threed types of face39(1982)

199–209Owens, P.J., Bipartite cubic graphs and a shortness exponent (Communication) 44 (1983) 327–330Owens, P.J., Bipartite regular graphs and shortness parameters (Note) 55 (1985) 101–106Owens, P.J., Simple 3-polytopal graphs with edges of only two types and shortness coefficients59 (1986) 107–

114Owens, P.J., Knight’s move squares63 (1987) 39–51Owens, P.J.,seeS. Jendrol’ 137(1-3) (1995) 251–263Owens, P.J.,seeJ. Harant 147(1-3) (1995) 301–305Owens, P.J.,seeJ. Harant 150(1-3) (1996) 143–153Owens, P.J. and D.A. Preece, Aspects of complete sets of 9×9 pairwise orthogonal latin squares167-168(1-3)

(1997) 519–525Oxenham, M.G. and L.R.A. Casse, On a geometric representation of the subgroups of index 6 inS6 92 (1991)

251–259


Oxley, J.,seeT. Brylawski 31 (1980) 161–170Oxley, J. and G. Whittle, Connectivity of submodular functions105(1992) 173–184Oxley, J. and H. Wu, On matroid connectivity146(1-3) (1995) 321–324Oxley, J., On packing 3-connected restrictions into 3-connected matroids178(1-3) (1998) 181–198Oxley, J.,seeM. Lemos 189(1-3) (1998) 283–289Oxley, J.G.,seeL.R. Matthews 19 (1977) 61–65Oxley, J.G., On cographic regular matroids (Note) 25 (1979) 89–90Oxley, J.G., On some extremal connectivity results for graphs and matroids41 (1982) 181–198Oxley, J.G., On a matroid identity44 (1983) 55–60Oxley, J.G., On minor-minimally-connected matroids51 (1984) 63–72Oxley, J.G., On ternary transversal matroids62 (1986) 71–83Oxley, J.G., A note on Negami’s polynomial invariants for graphs (Note) 76 (1989) 279–281Oxley, J.G., On an excluded-minor class of matroids82 (1990) 35–52Oxley, J.G., Ternary paving matroids91 (1991) 77–86Oxley, J.G. and D.J.A. Welsh, Tutte polynomials computable in polynomial time109(1992) 185–192Oxley, J.G.,seeS.R. Kingan 160(1-3) (1996) 265–271Pabst, G., Quantitative axioms for finite affine planes16 (1976) 53–56Pacco, W. and R. Scapellato, Digraphs having the same canonical double covering173(1-3) (1997) 291–296Pach, J.,seeP. Erdös 30 (1980) 103–109Pach, J., Graphs whose every independent set has a common neighbour37 (1981) 217–228Pach, J.,seeK. Böröczky 60 (1986) 101–120Pach, J. and J.H. Spencer, Note on vertex-partitions of infinite graphs (Note) 79 (1989/90) 107–108Pach, J.,seeP. Komjáth 95 (1991) 255–270Pach, J.,seeP. Erdos 111(1993) 189–196Pach, J.,seeP. Erdos 200(1-3) (1999) 95–99Pachner, U., Shellings of simplicial balls and p.l. manifolds with boundary81 (1990) 37–47Pachter, L. and P. Kim, Forcing matchings on square grids190(1-3) (1998) 287–294Padberg, M., Lehman’s forbidden minor characterization of ideal 0–1 matrices111(1993) 409–420Padberg, M. and T.-Y. Sung, An analytic symmetrization of max flow–min cut165-166(1-3) (1997) 531–545Padberg, M.W., A note on the total unimodularity of matrices14 (1976) 273–278Padmanabhan, S.,seeS. Guha 81 (1990) 211–215Padró, C. and P. Morillo, Diameter vulnerability of iterated line digraphs149(1-3) (1996) 189–204Padró, C.,seeD. Ferrero 197-198(1-3) (1999) 285–298Pak, I. and A. Postnikov, A generalization of Sylvester’s identity178(1-3) (1998) 277–281Pakulski, J.,seeM. Kubale 164(1-3) (1997) 197–212Palásti, I., A distance problem of P. Erdös with some further restrictions (Note) 76 (1989) 155–156Pálfy, P.P., On the chromatic number of certain highly symmetric graphs54 (1985) 31–38Pálfy, P.P.,seeP. Erdos 200(1-3) (1999) 165–179Palisse, R., A short proof of Fisher’s inequality111(1993) 421–422Palisse, R., Subsets of a finite set that almost always intersect each other inλ elements 165-166(1-3) (1997)

547–553Palka, Z.,seeP. Erdös 46 (1983) 145–150Palka, Z.,seeP. Erdös 48 (1984) 331Palka, Z. and L.V. Quintas, Random subgraphs of then-cycle 52 (1984) 243–251Palka, Z., A. Rucinski and J. Spencer, On a method for random graphs61 (1986) 253–258Palka, Z.,seeT. Łuczak 72 (1988) 257–265Pallo, J.M.,seeA. Bonnin 45 (1983) 153–163Pallo, J.M.,seeA. Bonnin 51 (1984) 111–117Pallo, J.M., Une bijection entre arbres binaires et certaines matrices de Jacobi (Note) 103(1992) 99–101Palmer, E.M., On the number ofn-plexes 6 (1973) 377–390Palmer, E.M.,seeF. Harary 11 (1975) 371–389Pambianco, F.,seeG. Faina 174(1-3) (1997) 117–123Panayotopoulos, A., Some considerations on permutation trees47 (1983) 275–281Panayotopoulos, A., Generating stable permutations (Note) 62 (1986) 219–221Panda, B.S. and S.P. Mohanty, Intersection graphs of vertex disjoint paths in a tree146(1-3) (1995) 179–209


Panda, B.S., The forbidden subgraph characterization of directed vertex graphs196(1-3) (1999) 239–256Pang, K.F.,seeR. Ahlswede 49 (1984) 1–5Paoli, M., Powers of connected graphs and hamiltonicity52 (1984) 91–99Papadimitriou, C.H.,seeW.H. Gates 27 (1979) 47–57Papadimitriou, C.H.,seeL.M. Kirousis 55 (1985) 181–184Papini, O.,seeM.C. Gennero 56 (1985) 155–168Paradis, A.D., Regular subsets in semi-direct products of monoids17 (1977) 299–307Parchmann, R., On the cardinalities of finite topologies11 (1975) 161–172Pardalos, P.M.,seeC.D. Maranas 142(1-3) (1995) 287–293Pareschi, G.,seeR. Chiavacci 82 (1990) 165–180Park, S., Inverse descents ofr-multipermutations 132(1-3) (1994) 215–229Park, S.K., Ther-complete partitions 183(1-3) (1998) 293–297Parker, M.,seeF. Buekenhout 186(1-3) (1998) 69–94Parnami, J.C. and K.C. Prasad, Enumeration of alternating sequences (Note) 20 (1977) 207–208Parnami, J.C., The iteration of a bijective transformation of integerk-tuples modm 87 (1991) 297–307Parnes, S. and S.B. Ekhad, A WZ-style proof of Jacobi polynomials’ generating function (Communication) 110

(1992) 263–264Parsons, T.D., The Ramsey numbersr(Pm,Kn) 6 (1973) 159–162Parsons, T.D.,seeR.J. Faudree 10 (1974) 269–277Parsons, T.D.,seeB. Alspach 25 (1979) 97–108Parsons, T.D., T. Pisanski and B. Jackson, Dual imbeddings and wrapped quasi-coverings of graphs31 (1980)

43–52Parsons, T.D.,seeD. Marušic 42 (1982) 227–242Parsons, T.D.,seeD. Marušic 43 (1983) 91–96Parsons, T.D. and T. Pisanski, Vector representations of graphs78 (1989) 143–154Parthasarathy, K.R.,seeG. Ravindra 20 (1977) 177–186Parthasarathy, K.R.,seeV. Krishnamoorthy 38 (1982) 197–205Parthasarathy, K.R. and R. Nandakumar, Unique eccentric point graphs46 (1983) 69–74Parthasarathy, K.R. and N. Srinivasan, An extremal problem in geodetic graphs49 (1984) 151–159Pascasio, A.A.,seeC.M. O’Keefe 151(1-3) (1996) 189–199Pascovici, D., On the forced unilateral orientation number of a graph187(1-3) (1998) 171–183Pascu, A. and G. Paun, On the planarity of bicolored digraph grammar systems (Note) 25 (1979) 195–197Paseka, J., Products in the category of locales: which properties are preserved?108(1992) 63–73Pasini, A., On certain geometries of typeCn andF4 58 (1986) 45–61Pasini, A., Flag-transitiveC3-geometries 117(1993) 169–182Pasini, A. and S. Tsaranov, Bounding the size of certain rank 3 geometries with designs as rank 2 residues155

(1-3) (1996) 183–204Pasini, A.,seeT. Meixner 174(1-3) (1997) 207–226Pasquier, G., Binary images of some self-dual codes over GF(2m) with respect to trace-orthogonal basis

(Communication) 37 (1981) 127–129Paterson, K.G. and M.J.B. Robshaw, Storage efficient decoding for a class of binary be Bruijn sequences138

(1-3) (1995) 327–341Paterson, M.S.,seeD.E. Daykin 50 (1984) 221–226Patrinos, A.N. and S.L. Hakimi, Relations between graphs and integer-pair sequences15 (1976) 347–358Patwardhan, G.A.,seeM.K. Gill 61 (1986) 189–196Paule, P.,seeS.A. Abramov 180(1-3) (1998) 3–22Paulraja, P., Counterexample to a conjecture on hamilton cycles (Note) 64 (1987) 99Paulraja, P.,seeR. Balakrishnan 186(1-3) (1998) 1–13Paulraja, P.,seeA. Muthusamy 195(1-3) (1999) 181–201Paun, G.,seeA. Pascu 25 (1979) 195–197Pavcevic, M.-O. and E. Spence, Some new symmetric designs withλ=10 having an automorphism of order 5

196(1-3) (1999) 257–266Pawale, R.M. and S.S. Sane, A short proof of a conjecture on quasi-symmetric 3-designs (Note) 96 (1991)

71–74Payan, C., Coverings by minimal transversals23 (1978) 273–277


Payan, C. and N.H. Xuong, Upper embeddability and connectivity of graphs27 (1979) 71–80Payan, C., A class of threshold and domishold graphs: Equistable and equidominating graphs29 (1980) 47–52Payan, C.,seeE.J. Cockayne 33 (1981) 249–258Payan, C.,seeP. Erdös 42 (1982) 57–61Payan, C., Perfectness and Dilworth number (Communication) 44 (1983) 229–230Payan, C.,seeF. Jaeger 46 (1983) 93–94Payan, C., M. Tchuente and N.H. Xuong, Arbres avec un nombre maximum de sommets pendants49 (1984)

267–273Payan, C.,seeM. Mollard 84 (1990) 303–307Payan, C.,seeS.X. Sun 102(1992) 79–83Payan, C., On the chromatic number of cube-like graphs103(1992) 271–277Payan, C., Empilement de cercles égaux dans un triangle équilatéral A propos d’une conjecture d’Erdös–Oler

165-166(1-3) (1997) 555–565Payne, S.E., On maximizing det(ATA) 10 (1974) 145–158Pearce, L.H., Random walks on trees30 (1980) 269–276Peck, G.W., A new proof of a theorem of Graham and Pollak (Communication) 49 (1984) 327–328Peck, G.W., On ‘k-sets’ in the plane (Note) 56 (1985) 73–74Peck, G.W. and A. Shastri, Bandwidth of theta graphs with short paths103(1992) 177–187Pecuchet, J.P., Solutions principales et rang d’un système d’équations avec constantes dans le monoïde libre48

(1984) 253–274Peele, R., On finite partition representations of lattices42 (1982) 267–280Peemöller, J., Necessary conditions for Hamiltonian split graphs54 (1985) 39–47Peile, R.E., Inclusion transformations:(n,m)-graphs and their classification96 (1991) 111–129Pelant, J.,seeV. Müller 11 (1975) 37–66Pelant, J. and V. Rödl, On coverings of infinite-dimensional metric spaces108(1992) 75–81Pelant, J.,seeM. Burzio 155(1-3) (1996) 27–30Pelc, A.,seeJ. Czyzowicz 82 (1990) 233–250Peled, U.N., Matroidal graphs20 (1977) 263–286Peled, U.N.,seeF. Harary 39 (1982) 123–127Peled, U.N. and M.K. Srinivasan, Poset matching–a distributive analog of independent matching114 (1993)

403–424Peled, U.N.,seeP.L. Hammer 119(1993) 79–96Peled, U.N.,seeN.V.R. Mahadev 135(1-3) (1994) 169–176Peleg, D., A generalized closure and complement phenomenon50 (1984) 285–293Peleg, D., On the maximum density of 0–1 matrices with no forbidden rectangles140(1-3) (1995) 269–274Pellerin, A. and R. Laskar, Cubic graphs on twelve vertices and the line graph of a finite affine plane12 (1975)

27–36Pellikaan, R., On decoding by error location and dependent sets of error positions106/107(1992) 369–381Penaud, J.-G.,seeS. Dulucq 117(1993) 89–105Penaud, J.-G., Une preuve bijective d’une formule de Touchard–Riordan139(1-3) (1995) 347–360Penfold Street, A.,seeM.J. Sharry 77 (1989) 299–305Penfold Street, A.,seeM.J. Sharry 92 (1991) 341–359Peng, Y.,seeS. Xu 135(1-3) (1994) 349–358Peng, Y.H., On the chromatic uniqueness of certain bipartite graphs94 (1991) 129–140Peng, Y.H.,seeC.C. Chen 111(1993) 113–123Peng, Y.-H., C.H.C. Little, K.L. Teo and H. Wang, Chromatic equivalence classes of certain generalized polygon

trees 172(1-3) (1997) 103–114Penn, M.,seeF. Granot 142(1-3) (1995) 65–75Pennisi, M.,seeR. Gardner 171(1-3) (1997) 121–139Pennisi, M.,seeR. Gardner 175(1-3) (1997) 143–161Penttila, T.,seeP.H. Fisher 71 (1988) 19–32Penttila, T.,seeC.M. O’Keefe 115(1993) 231–244Pepper, S.,seeI.P. Goulden 113(1993) 263–268Perelli Cippo, C., A geometric interpretation of an equality by Sylvester174(1-3) (1997) 271–276Perfect, H.,seeV. Bryant 18 (1977) 109–124


Perfect, H., Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4-chains (Note) 90 (1991)213–214

Pergola, E.,seeE. Barcucci 180(1-3) (1998) 45–64Perkins, S. and A.E. Escott, Synchronizing codewords ofq-ary Huffman codes 197-198(1-3) (1999) 637–655Perkovic, L. and B. Reed, Edge coloring regular graphs of high degree165-166(1-3) (1997) 567–578Perl, Y.,seeM.C. Golumbic 28 (1979) 237–245Perl, Y. and S. Zaks, Deficient generalized Fibonacci maximum path graphs34 (1981) 153–164Perl, Y.,seeJ. McHugh 86 (1990) 199–214Perles, M.A.,seeN. Alon 60 (1986) 75–90Peroche, B.,seeM. Habib 41 (1982) 219–220Peroche, B., On several sorts of connectivity46 (1983) 267–277Peroche, B.,seeJ.C. Bermond 52 (1984) 123–132Peroche, B. and C. Virlouvet, Minimally 4-edge#-connected graphs125(1994) 289–299Perold, A.F.,seeV. Chvátal 26 (1979) 83–92Perrin, D.,seeA. de Luca 27 (1979) 297–308Perrin, D.,seeG. Lallement 36 (1981) 261–271Pesch, E. and W. Poguntke, A characterization of absolute retracts ofn-chromatic graphs 57 (1985) 99–104Pesch, E., Products of absolute retracts69 (1988) 179–188Peter-Orth, C., All solutions of the Soma cube puzzle57 (1985) 105–121Peters, K.,seeM.S. Jacobson 86 (1990) 59–69Peterson, D.L., A note on Hamiltonian cycles in bipartite plane cubic maps having connectivity 2 (Note) 36

(1981) 327–332Petford, A.D. and D.J.A. Welsh, A randomised 3-colouring algorithm74 (1989) 253–261Petingi, L., F. Boesch and C. Suffel, On the characterization of graphs with maximum number of spanning trees

179(1-3) (1998) 155–166Petkovšek, M.,seeS. Klavžar 66 (1987) 133–137Petkovšek, M., A generalization of Gosper’s algorithm134(1-3) (1994) 125–131Petkovšek, M.,seeS.A. Abramov 180(1-3) (1998) 3–22Petrenjuk, A.J., On the constructive enumeration of packings and coverings of index one77 (1989) 237–254Petreschi, R.,seeP. Marchioro 51 (1984) 47–61Petreschi, R.,seeP. Marchioro 69 (1988) 253–261Petric, M., seeS. Cvetkovic 50 (1984) 37–49Petrovic, M.M., Finite type graphs and some graph operations, II58 (1986) 269–274Petrovic, M.M., I. Gutman and M. Lepovic, Graphs with small numbers of independent edges126(1994) 239–

244Petrovic, V. and C. Thomassen, Kings ink-partite tournaments (Note) 98 (1991) 237–238Petrovic, V., Decomposition of some planar graphs into trees150(1-3) (1996) 449–451Petrovic, V., Kings in bipartite tournaments173(1-3) (1997) 187–196Petrovich, A., Equations in the theory ofQ-distributive lattices 175(1-3) (1997) 211–219Peyrat, C.,seeT. Soneoka 63 (1987) 53–66Peyrat, C.,seeN. Homobono 76 (1989) 37–44Peyrat, C.,seeJ.-C. Bermond 114(1993) 51–62Pfaff, O., On the simplicity of·2 and·3 97 (1991) 319–331Pfaltz, J.L., Closure lattices154(1-3) (1996) 217–236Pfeiffer, F.,seeM. Middendorf 80 (1990) 327–333Pfeiffer, F.,seeM. Middendorf 108(1992) 365–372Pfeiffer, F.,seeM. Middendorf 111(1993) 393–400Phelan, J.S.,seeM.J. Grannell 97 (1991) 199–202Phelan, J.S.,seeM.J. Grannell 138(1-3) (1995) 247–253Phelps, K., D.R. Stinson and S.A. Vanstone, The existence of simpleS3(3,4, v) 77 (1989) 255–258Phelps, K.T., Some derived Steiner triple systems16 (1976) 343–352Phelps, K.T.,seeC.C. Lindner 24 (1978) 109–112Phelps, K.T., Automorphism free latin square graphs31 (1980) 193–200Phelps, K.T. and A. Rosa, Steiner triple systems with rotational automorphisms33 (1981) 57–66Phelps, K.T., A construction of cyclic Steiner triple systems of orderpn (Note) 67 (1987) 107–110


Phelps, K.T.,seeC.J. Colbourn 89 (1991) 149–160Phelps, K.T.,seeD.G. Hoffman 89 (1991) 221–229Phelps, K.T., A class of 2-chromatic SQS(22)97 (1991) 333–338Phelps, K.T.,seeF.E. Bennett 103(1992) 129–137Phelps, K.T.,seeF.E. Bennett 103(1992) 139–151Phelps, K.T. and M.J. de Resmini, Partitioning twofold triple systems into complete arcs104(1992) 273–280Phelps, K.T. and C.A. Rodger, Nesting partial Steiner triple systems with 2-regular leave graphs112 (1993)

165–172Phillips, N.C.K. and D.A. Preece, Tight single-change covering designs withv=12, k=4 197-198(1-3) (1999)

657–670Pianta, S.,seeH. Hotje 129(1-3) (1994) 139–147Piazza, B.,seeR. Laskar 122(1993) 245–253Piazza, B.L., R.D. Ringeisen and S.K. Stueckle, Subthrackleable graphs and four cycles127(1-3) (1994) 265–

276Pica, G., On finiteCn-geometries with thick lines 155(1-3) (1996) 205–210Pica, G.,seeA. Del Fra 174(1-3) (1997) 99–105Picardello, M.A., M.H. Taibleson and W. Woess, Harmonic measure of the planar Cantor set from the viewpoint

of graph theory 109(1992) 193–202Piccarreta, S.,seeL. Grasselli 182(1-3) (1998) 125–137Pichat, E., The disengagement algorithm or a new generalization of the exclusion algorithm17 (1977) 95–106Pickert, G., Differenzmengen und ovale73 (1988/89) 165–179Picon, P.A., Sur certaines suites récurrentes cubiques ayant deux ou trois termes nuls21 (1978) 285–296Picon, P.A., Un résultat d’intégrité38 (1982) 227–241Picon, P.A., Conditions d’integrité de certains coefficients hypergéometriques: généralisation d’un théorème de

Landau 135(1-3) (1994) 245–263Piff, M.J.,seeF. Harary 2 (1972) 163–171Pin, J.E.,seeJ. Berstel 76 (1989) 89–94Pinkernell, A.,seeY. Guo 164(1-3) (1997) 165–170Pinter, M.R., Strongly well-covered graphs132(1-3) (1994) 231–246Pintz, J.,seeA.M. Odlyzko 57 (1985) 89–97Pinzani, R.,seeE. Barcucci 139(1-3) (1995) 3–18Pinzani, R.,seeA. Del Lungo 157(1-3) (1996) 65–78Pinzani, R.,seeE. Barcucci 170(1-3) (1997) 211–217Pinzani, R.,seeE. Barcucci 180(1-3) (1998) 45–64Pinzani, R.,seeE. Barcucci 189(1-3) (1998) 21–42Piollet, D., Solutions d’une equation quadratique dans le groups libre59 (1986) 115–123Piotrowski, W., Chordal characterization of graphic matroids68 (1988) 273–279Piotrowski, W.L., The solution of the bipartite analogue of the Oberwolfach problem97 (1991) 339–356Piper, F.,seeW.-A. Jackson 98 (1991) 23–28Piper, F. and P. Wild, Incidence structures applied to cryptography106/107(1992) 383–389Piper, F.,seeJ. Jedwab 125(1994) 241–254Pippert, R.E.,seeK.S. Bagga 122(1993) 1–6Pippert, R.E.,seeK.S. Bagga 124(1994) 3–12Piras, F.,seeL. Azzena 79 (1989/90) 123–146Piret, Ph.,seePh. Delsarte 55 (1985) 313–315Piret, Ph., Word correction by means of convolutional codes56 (1985) 239–243Pirillo, G., seeJ. Justin 52 (1984) 299–303Pirillo, G., On a combinatorial property of Fibonacci semigroup122(1993) 263–267Pirillo, G. and S. Varricchio, Some combinatorial properties of infinite words and applications to semigroup

theory 153(1-3) (1996) 239–251Pirillo, G., Fibonacci numbers and words173(1-3) (1997) 197–207Pisanski, T.,seeT.D. Parsons 31 (1980) 43–52Pisanski, T. and J. Shawe-Taylor, Search for minimal trivalent cycle permutation graphs with girth nine

(Communication) 36 (1981) 113–115Pisanski, T.,seeV. Batagelj 38 (1982) 311–312


Pisanski, T.,seeB. Mohar 56 (1985) 87–89Pisanski, T.,seeT.D. Parsons 78 (1989) 143–154Pisanski, T., Universal commutator graphs78 (1989) 155–156Pisanski, T. and T.W. Tucker, The genus of low rank hamiltonian groups78 (1989) 157–167Pisanski, T., Orientable quadrilateral embeddings of products of graphs109(1992) 203–205Pisanski, T.,seeT. Dakic 134(1-3) (1994) 25–39Pisanski, T.,seeW. Imrich 167-168(1-3) (1997) 393–403Pitas, I. and M.G. Strintzis, Special algorithms for convolutions over Galois fields56 (1985) 245–253Pittel, B.,seeP. Flajolet 75 (1989) 167–215Piwakowski, K.,seeM. Kubale 150(1-3) (1996) 247–256Piwakowski, K.,seeM. Kubale 164(1-3) (1997) 197–212Piwakowski, K., On Ramsey numberR(4,3,3) and triangle-free edge-chromatic graphs in three colors164(1-3)

(1997) 243–249Plantholt, M.J., The chromatic index of graphs with large maximum degree47 (1983) 91–96Plantholt, M.J. and S.K. Tipnis, The chromatic index of multigraphs that are nearly full82 (1990) 197–207Plantholt, M.J. and S.K. Tipnis, The chromatic index of multigraphs of order at most 10177(1-3) (1997) 185–

193Plaut, B.C.,seeM.A. Langston 182(1-3) (1998) 191–196Plesník, J., One method for proving the impossibility of certain Moore graphs8 (1974) 363–376Plesník, J., A note on the complexity of finding regular subgraphs49 (1984) 161–167Plesník, J., Equivalence between the minimum covering problem and the maximum matching problem (Note)

49 (1984) 315–317Pless, V., A classification of self-orthogonal codes over GF(2) 3 (1972) 209–246Pless, V.,seeJ.H. Conway 38 (1982) 143–156Pless, V., Codes and designs—existence and uniqueness92 (1991) 261–274Pless, V., More on the uniqueness of the Golay codes106/107(1992) 391–398Pless, V.,seeG.T. Kennedy 142(1-3) (1995) 155–168Pless, V.S.,seeR.A. Brualdi 83 (1990) 189–199Pless, V.S.,seeR.A. Brualdi 102(1992) 239–247Plošcica, M. and M. Zelina, Cancellation among finite unary algebras159(1-3) (1996) 191–198Plouffe, S.,seeJ.-P. Allouche 139(1-3) (1995) 455–461Pluhár, A.,seeZ. Blázsik 115(1993) 51–55Plummer, M.D. and N. Robertson, Path traversability in planar graphs7 (1974) 289–303Plummer, M.D., Onn-extendable graphs31 (1980) 201–210Plummer, M.D., Toughness and matching extension in graphs72 (1988) 311–320Plummer, M.D.,seeD.A. Holton 96 (1991) 81–99Plummer, M.D., Matching theory—a sampler: from Dénes König to the present100(1992) 177–219Plummer, M.D.,seeE. Györi 101(1992) 87–96Plummer, M.D., Extending matchings in planar graphs IV109(1992) 207–219Plummer, M.D., Extending matchings in claw-free graphs125(1994) 301–307Plummer, M.D., Extending matchings in graphs: A survey127(1-3) (1994) 277–292Plummer, M.D., Extending matchings in planar graphs V150(1-3) (1996) 315–324Plummer, M.D.,seeW. Goddard 167-168(1-3) (1997) 329–339Plummer, M.D.,seeR.E.L. Aldred 197-198(1-3) (1999) 29–40Pocchiola, M.,seeJ. Berstel 153(1-3) (1996) 29–39Podelski, A.,seeM. Nivat 114(1993) 379–401Pogosyan, G.,seeV. Lashkia 156(1-3) (1996) 277–283Poguntke, W.,seeE. Pesch 57 (1985) 99–104Poguntke, W.,seeB. Ganter 63 (1987) 153–156Poh, K.S.,seeK.M. Koh 61 (1986) 61–70Poh, K.S.,seeK.M. Koh 69 (1988) 241–251Poh, K.S.,seeK.M. Koh 72 (1988) 225–236Poh, K.S.,seeK.M. Koh 151(1-3) (1996) 121–130Poirier, S., Cycle type and descent set in wreath products180(1-3) (1998) 315–343Polat, N., Sous-graphes traçables des graphes infinis38 (1982) 243–263


Polat, N., A compactness result for perfect matchings64 (1987) 229–237Polat, N., On the existence of minimal end-separators (Communication) 85 (1990) 97–98Polat, N. and G. Sabidussi, Asymmetrising sets in trees95 (1991) 271–289Polat, N., Asymmetrization of infinite trees95 (1991) 291–301Polat, N., A minimax theorem for infinite graphs with ideal points103(1992) 57–65Polat, N., Similarity and asymmetrization of trees109(1992) 221–238Polat, N., Minimax theorems for infinite graphs with the ends as ideal points130(1-3) (1994) 89–96Polat, N. and G. Sabidussi, Fixed elements of infinite trees130(1-3) (1994) 97–102Polat, N., A Helly theorem for geodesic convexity in strongly dismantlable graphs140(1-3) (1995) 119–127Polat, N., Stable graphs for a family of endomorphisms150(1-3) (1996) 325–335Polat, N., Finite invariant sets in infinite graphs158(1-3) (1996) 211–221Polat, N.,seeM. Chastand 160(1-3) (1996) 93–104Polat, N.,seeF. Laviolette 194(1-3) (1999) 151–172Poli, A., Important algebraic calculations forn-variables polynomial codes56 (1985) 255–263Poli, A. and J.A. Thiong-Ly, Automorphisms of principal nilpotent self-dual codes in certain modular algebras

56 (1985) 265–273Policriti, A., seeD. Dikranjan 159(1-3) (1996) 83–94Polito, P.,seeG. Lunardon 174(1-3) (1997) 191–198Politof, T. and A. Satyanarayana, Minors of quasi 4-connected graphs126(1994) 245–256Politof, T. and A. Satyanarayana, The structure of quasi 4-connected graphs161(1-3) (1996) 217–228Poljak, S. and A. Pultr, On the dimension of trees34 (1981) 165–171Poljak, S. and V. Rödl, On set systems determined by intersections34 (1981) 173–184Poljak, S. and D. Turzik, A note on sticky matroids (Note) 42 (1982) 119–123Poljak, S. and D. Turzík, A polynomial time heuristic for certain subgraph optimization problems with guaranteed

worst case bound (Note) 58 (1986) 99–104Poljak, S.,seeM. Loebl 76 (1989) 241–246Poljak, S.,seeY. Crama 102(1992) 143–147Poljak, S. and D. Turzík, Max-cut in circulant graphs108(1992) 379–392Poljak, S.,seeC. Delorme 111(1993) 145–156Poljak, S., On existence theorems111(1993) 423–434Pollack, J.,seeD. Klarner 32 (1980) 45–52Pollington, A.D., On the density ofB2-bases (Note) 58 (1986) 209–211Pomerance, C., On a tiling problem of R.B. Eggleton18 (1977) 63–70Ponomarenko, I.,seeS. Evdokimov 197-198(1-3) (1999) 247–267Popescu, D.-R., Une méthode d’énumération des cycles négatifs d’un graphe signé150(1-3) (1996) 337–345Porcu, L.,seeE. Dedò 55 (1985) 1–11Porta, H.,seeA.S. Fraenkel 135(1-3) (1994) 93–101Porter, T.D.,seeC.A. Barefoot 150(1-3) (1996) 31–48Porto, O.,seeH. Everett 165-166(1-3) (1997) 223–242Porubský, Š., A characterization of finite unions of arithmetic sequences38 (1982) 73–77Pósa, L., Hamiltonian circuits in random graphs14 (1976) 359–364Post, K.,seeD.A. Klarner 106/107(1992) 303–309Postnikov, A.,seeI. Pak 178(1-3) (1998) 277–281Pott, A., A note on self-orthogonal codes (Note) 76 (1989) 283–284Pott, A. and M. Shrikhande, t-Designs with few intersection numbers (Note) 90 (1991) 215–217Pott, A.,seeK.T. Arasu 97 (1991) 25–38Pott, A.,seeK.T. Arasu 97 (1991) 39–45Pott, A.,seeK.T. Arasu 106/107(1992) 19–23Pott, A.,seeK.T. Arasu 147(1-3) (1995) 1–17Potter, L.K.,seeA.P. Godbole 190(1-3) (1998) 79–93Poucher, W.B., Finite embedding theorems for partial pairwise balanced designs18 (1977) 291–298Poupard, C., De nouvelles significations enumeratives des nombres d’Entringer38 (1982) 265–271Poupard, Y., Etude et denombrement paralleles des partitions non-croisees d’un cycle et des decoupages d’un

polygone convexe 2 (1972) 279–288


Pouzet, M., Sur certains tournois reconstructibles application a leurs groupes d’automorphismes (Note) 24(1978) 225–229

Pouzet, M.,seeR. Assous 25 (1979) 1–5Pouzet, M.,seeD. Duffus 35 (1981) 39–52Pouzet, M. and N. Zaguia, Dimension de Krull des ensembles ordonnes53 (1985) 173–192Pouzet, M. and I. Rival, Is there a diagram invariant?73 (1988/89) 181–188Pouzet, M.,seeJ.-M. Brochet 95 (1991) 23–47Pouzet, M. and I.G. Rosenberg, General metrics and contracting operations130(1-3) (1994) 103–169Pouzet, M.,seeM. Kabil 192(1-3) (1998) 145–186Pouzet, M., A projection property and Arrow’s impossibility theorem192(1-3) (1998) 293–308Powers, R.G., Some asymptoticith Ramsey numbers41 (1982) 271–279Powers, R.G., Theith Ramsey number for matchings (Note) 61 (1986) 115–118Prabhu, N.,seeG. Bohus 187(1-3) (1998) 259–264Praeger, C.E.,seeJ.D. Henstridge 31 (1980) 181–183Praeger, C.E., Balanced directed cycle designs based on groups92 (1991) 275–290Praeger, C.E.,seeC.M. O’Keefe 115(1993) 231–244Praeger, C.E.,seeP.J. Cameron 118(1993) 33–43Praeger, C.E. and B.P. Raposa, Non-symmetric nearly triply regular designs151(1-3) (1996) 201–212Praeger, C.E.,seeX.G. Fang 182(1-3) (1998) 85–99Pragacz, P.,seeA. Lascoux 126(1994) 209–215Pranesachar, C.R., On the number of two-line and three-line Latin rectangles—An alternative approach38

(1982) 79–86Prasad, K.C.,seeJ.C. Parnami 20 (1977) 207–208Préa, P., Graphs and topologies on discrete sets103(1992) 189–197Préa, P., Distance sequences in infinite regular tessellations146(1-3) (1995) 211–233Préa, P., About weak connectivity165-166(1-3) (1997) 579–586Preece, D.A., Double Youden rectangles — an update with examples of size 5× 11 125(1994) 309–317Preece, D.A., P.W. Brading, C.W.H. Lam and M. Côté, Balanced 6×6 designs for 4 equally replicated treatments

125(1994) 319–327Preece, D.A., How many 7×7 Latin squares can be partitioned into Youden squares?138(1-3) (1995) 343–352Preece, D.A. and B.J. Vowden, Graeco-Latin squares with embedded balanced superimpositions of Youden

squares 138(1-3) (1995) 353–363Preece, D.A.,seeP.J. Owens 167-168(1-3) (1997) 519–525Preece, D.A., Some 6×11 Youden squares and double Youden rectangles167-168(1-3) (1997) 527–541Preece, D.A.,seeN.C.K. Phillips 197-198(1-3) (1999) 657–670Preece, D.A. and B.J. Vowden, Some series of cyclic balanced hyper-Graeco-Latin superimpositions of three

Youden squares 197-198(1-3) (1999) 671–682Preece, D.A.,seeD.H. Rees 197-198(1-3) (1999) 691–712Preissmann, M., Even polyhedral decompositions of cubic graphs (Communication) 32 (1980) 331–334Preissmann, M., Snarks of order 18 (Communication) 42 (1982) 125–126Preissmann, M., A class of strongly perfect graphs (Note) 54 (1985) 117–120Preissmann, M., D. de Werra and N.V.R. Mahadev, A note of superbrittle graphs61 (1986) 259–267Preissmann, M.,seeC.T. Hoàng 98 (1991) 161–174Preissmann, M.,seeC.T. Hoàng 102(1992) 67–74Preissmann, M.,seeF. Maffray 162(1-3) (1996) 313–317Prellberg, T.,seeH. Harborth 73 (1988/89) 89–90Pretorius, L.M.,seeC.J. Swanepoel 167-168(1-3) (1997) 583–592Pretorius, L.M.,seeW.L. Fouché 197-198(1-3) (1999) 331–350Pretzel, O., Another proof of Dilworth’s decomposition theorem (Note) 25 (1979) 91–92Pretzel, O., A construction for partially ordered sets32 (1980) 59–68Pretzel, O., A non-covering graph of girth six63 (1987) 241–244Pretzel, O. and D. Youngs, Balanced graphs and noncovering graphs88 (1991) 279–287Priestley, H.,seeJ.D. Lawson 63 (1987) 225–230Priestley, H.A.,seeM.E. Adams 66 (1987) 1–13Priestley, H.A.,seeB.A. Davey 113(1993) 41–58


Prikry, K., On a problem of Erdös, Hajnal and Rado2 (1972) 51–59Prikry, K., seeJ.E. Baumgartner 14 (1976) 17–21Prikry, K., seeE.C. Milner 95 (1991) 183–191Primrose, E.J.F., A correspondence between two Catalan sets (Communication) 65 (1987) 313–315Prince, A.R., The commutative ring of a symmetric design (Note) 80 (1990) 101–103Prince, A.R., Oval configurations of involutions in symmetric groups174(1-3) (1997) 277–282Prisner, E., A characterization of interval catch digraphs73 (1989) 285–289Prisner, E., Convergence of iterated clique graphs103(1992) 199–207Prisner, E., Radius versus diameter in cocomparability and intersection graphs163(1-3) (1997) 109–117Pritikin, D., seeZ. Miller 93 (1991) 211–228Pritikin, D., seeZ. Miller 131(1-3) (1994) 183–194Proctor, R.A., M.E. Saks and D.G. Sturtevant, Product partial orders with the Sperner property30 (1980) 173–

180Proctor, R.A. and D.C. Wilson, Interpretation of a basic hypergeometric identity with Lie characters and Young

tableaux 137(1-3) (1995) 297–302Prodinger, H., On a generalization of the Dyck-language over a two letter alphabet28 (1979) 269–276Prodinger, H. and F.J. Urbanek, Infinite 0–1-sequences without long adjacent identical blocks28 (1979) 277–

289Prodinger, H., Non-repetitive sequences and Gray code (Note) 43 (1983) 113–116Prodinger, H., A correspondence between ordered trees and noncrossing partitions (Note) 46 (1983) 205–206Prodinger, H.,seeP. Kirschenhofer 52 (1984) 305–306Prodinger, H.,seeP. Flajolet 65 (1987) 149–156Prodinger, H., How to select a loser120(1993) 149–159Prodinger, H., Combinatorics of geometrically distributed random variables: Left-to-right maxima153 (1-3)

(1996) 253–270Prodinger, H.,seeX. Gourdon 169(1-3) (1997) 227–232Prodon, A., A note on the separation problem for the matching matroid (Note) 52 (1984) 307–311Prohle, P.,seeJ.D. Berman 112(1993) 1–20Prömel, H.J. and B. Voigt, Recent results in partition (Ramsey) theory for finite lattices35 (1981) 185–198Prömel, H.J. and B. Voigt, Partition theorems for parameter systems and graphs36 (1981) 83–96Prömel, H.J. and B. Voigt, Canonizing Ramsey theorems for finite graphs and hypergraphs54 (1985) 49–59Prömel, H.J., Some remarks on natural orders for combinatorial cubes73 (1988/89) 189–198Prömel, H.J., W. Thumser and B. Voigt, Fast growing functions based on Ramsey theorems95 (1991) 341–358Prömel, H.J. and B. Voigt, From wqo to bqo, via Ellentuck’s theorem108(1992) 83–106Prömel, H.J.,seeS. Hougardy 136(1-3) (1994) 175–223Prömel, H.J. and A. Steger, CountingH -free graphs 154(1-3) (1996) 311–315Proskurowski, A.,seeA. Farley 25 (1979) 189–193Proskurowski, A., Separating subgraphs ink-trees: Cables and caterpillars49 (1984) 275–285Proskurowski, A.,seeS. Arnborg 80 (1990) 1–19Pruchnewski, A.,seeT. Böhme 191(1-3) (1998) 31–43Prüß, V., A characterization of matroidal families of multigraphs52 (1984) 101–105Przytycka, T.,seeS. Bellantoni 114(1993) 41–49Przytycka, T.M. and J.H. Przytycki, A simple construction of high representativity triangulations173 (1-3)

(1997) 209–228Przytycki, J.H.,seeT.M. Przytycka 173(1-3) (1997) 209–228Pták, V.,seeA. Lešanovský 58 (1986) 35–44Pták, V., Thickness of families of sets and a minimax lemma108(1992) 175–181Pudlák, P. and V. Rödl, Partition theorems for systems of finite subsets of integers39 (1982) 67–73Pudlák, P. and V. Rödl, Some combinatorial-algebraic problems from complexity theory136(1-3) (1994) 253–

279Puech, J.,seeO. Favaron 179(1-3) (1998) 257–265Puech, J.,seeO. Favaron 197-198(1-3) (1999) 269–284Pulapaka, H. and A. Vince, Non-revisiting paths on surfaces with low genus182(1-3) (1998) 267–277Pulé, J.V.,seeN. Macris 154(1-3) (1996) 301–305Pulito, C.,seeL. Borzacchini 39 (1982) 255–261


Pulleyblank, W.,seeG. Cornuéjols 29 (1980) 135–159Pulleyblank, W.R.,seeD. Naddef 34 (1981) 283–291Pullman, N.J.,seeD.A. Gregory 41 (1982) 97–99Pullman, N.J.,seeL.B. Beasley 104(1992) 143–157Pullman, N.J.,seeL.B. Beasley 195(1-3) (1999) 53–66Pultr, A. and J. Vinárek, Productive classes and subdirect irreducibility, in particular for graphs20 (1977) 159–

176Pultr, A.,seeJ. Nešetril 22 (1978) 287–300Pultr, A.,seeS. Poljak 34 (1981) 165–171Pultr, A., Notes on an extension of the structure of frame108(1992) 107–114Pultr, A., On Sabidussi–Fawcett subdirect representation109(1992) 239–253Purdy, G., Some extremal problems in geometry7 (1974) 305–315Purdy, G. and T. Strommer, The maximal sizes of faces and vertices in an arrangement (Note) 28 (1979) 331–

334Purdy, G., The independent sets of rankk of a matroid 38 (1982) 87–91Purdy, G.,seeP. Erdös 40 (1982) 45–52Purdy, G., Two results about points, lines and planes60 (1986) 215–218Purdy, G.B., Triangles in arrangements of lines25 (1979) 157–163Purdy, G.B. and J.E. Wetzel, Two-coloring inequalities for Euclidean arrangements in general position31

(1980) 53–58Putcha, M.S., Paths in graphs and minimalπ -sequences in semigroups11 (1975) 173–185Pyatkin, A.V., Proof of Melnikov–Vizing conjecture for multigraphs with maximum degree at most 3185(1-3)

(1998) 275–278Pyber, L., An extension of a Frankl–Füredi theorem52 (1984) 253–268Pyber, L., On one-factorizations of the complete graph (Note) 67 (1987) 209–210Pyber, L. and Z. Tuza, Menger-type theorems with restrictions on path lengths120(1993) 161–174Pyber, L.,seeP. Erdös 170(1-3) (1997) 249–251Qian, J., On the upper bound of the diameter of interchange graphs195(1-3) (1999) 277–285Qiao, L.,seeW. Honghui 61 (1986) 213–219Qin, J.,seeH.A. Kierstead 144(1-3) (1995) 47–57Qing, X., Reversible (m, n, k, λ1, λ2)-abelian divisible difference sets withk-λ1 nonsquare 142 (1-3) (1995)

193–201Qiu, W., A necessary condition on the existence of abelian difference sets137(1-3) (1995) 383–386Qiu, Y. and X.F. Jia, The maximum size of graphs satisfying a degree condition (Note) 104(1992) 201–204Quackenbush, R.,seeR. McKenzie 35 (1981) 157–163Quackenbush, R.W., Near-boolean algebras I: Combinatorial aspects10 (1974) 301–308Quackenbush, R.W., Pseudovarieties of finite algebras isomorphic to bounded distributive lattices28 (1979)

189–192Quackenbush, R.W., Non-modular varieties of semimodular lattices with a spanningM3 53 (1985) 193–205Quaife, H.,seeE. Engelhardt 78 (1989) 257–266Quattrocchi, G., On the intersection of twoS(3,4,2v) having a same derived triple system82 (1990) 279–286Quattrocchi, G. and S. Milici, Repeated blocks in maximum packing of triples with index 2 (Note) 115(1993)

287–291Quattrocchi, G.,seeS. Milici 145(1-3) (1995) 191–200Quattrocchi, G., On arcs in path designs of block size four174(1-3) (1997) 283–292Quebbemann, H.-G., On even codes98 (1991) 29–34Quest, M. and G. Wegner, Characterization of the graphs with boxicity6 2 81 (1990) 187–192Quilliot, A., Circular representation problem on hypergraphs51 (1984) 251–264Quilliot, A., Representation theorems for graphs whose the vertex set is partially ordered53 (1985) 207–219Quilliot, A., A retraction problem in graph theory54 (1985) 61–71Quilliot, A., Une condition pour qu’une famille de triangles soit orientable en un ordre cyclique91 (1991)

171–182Quilliot, A., Une extension du problème du point fixe pour des graphes simples111(1993) 435–445Quilliot, A., seeF. Bendali 130(1-3) (1994) 19–37


Quilliot, A., On the properties of the subsets of a discrete domain defined by the local optimae of a functionendowed with some geometrical properties192(1-3) (1998) 309–322

Quinn, J.J., Cycle packings in graphs and digraphs149(1-3) (1996) 325–328Quinn Massey, J.J.,seeR.A. Brualdi 122(1993) 51–58Quinodoz, N.,seeP. Hansen 165-166(1-3) (1997) 393–409Quintana, J.,seeH.A. Kierstead 178(1-3) (1998) 81–92Quintana, J.A.,seeI.J. Dejter 72 (1988) 63–70Quintas, L.V.,seeZ. Palka 52 (1984) 243–251Quintas, L.V.,seeK.T. Balinska 114(1993) 19–22Quintas, L.V.,seeG.O.H. Katona 121(1993) 113–116Quintas, L.V.,seeK.T. Balinska 150(1-3) (1996) 17–29Quintero, A.,seeR. Ayala 194(1-3) (1999) 13–37Rabinovitch, I. and I. Rival, The rank of a distributive lattice25 (1979) 275–279Rabinovitch, I.,seeS.B. Maurer 31 (1980) 297–313Rabinovitch, I.,seeS.B. Maurer 32 (1980) 167–189Raczunas, M. and P. Chrz¸astowski-Wachtel, A Diophantine problem of Frobenius in terms of the least common

multiple 150(1-3) (1996) 347–357Radcliffe, A.J. and A.D. Scott, Every tree contains a large induced subgraph with all degrees odd140 (1-3)

(1995) 275–279Radcliffe, A.J.,seeD.M. Berman 175(1-3) (1997) 35–40Rado, R., Theorems on intervals of ordered sets35 (1981) 199–201Radziszowski, S.P.,seeD. de Caen 91 (1991) 65–77Raghavarao, D., Boolean sums of sets of certain designs (Note) 10 (1974) 401–403Raghunathan, T.T., M.M. Shikare and B.N. Waphare, Splitting in a binary matroid184(1-3) (1998) 267–271Rahilly, A., On the line structure of designs92 (1991) 291–303Raines, M.E. and C.A. Rodger, Embedding partial extended triple systems and totally symmetric quasigroups

176(1-3) (1997) 211–222Rajan, D.S., The equationsDkY =Xn in combinatorial species118(1993) 197–206Rajan, D.S. and A.M. Shende, A characterization of root lattices161(1-3) (1996) 309–314Rajendran, B.,seeR. Aravamudhan 49 (1984) 193–195Rajendran, B.,seeR. Aravamudhan 58 (1986) 303–305Rajkundlia, D.P., Some techniques for constructing infinite families of BIBD’s44 (1983) 61–96Rajlich, J.,seeV. Koubek 57 (1985) 203–208Rajpal, S., On binaryk-paving matroids and Reed–Muller codes190(1-3) (1998) 191–200Raju, B.S.P.,seeD.V.S. Sastry 48 (1984) 113–119Rall, D.F., Domatically critical and domatically full graphs86 (1990) 81–87Rall, D.F.,seeB.L. Hartnell 128(1-3) (1994) 173–177Rall, D.F.,seeB.L. Hartnell 197-198(1-3) (1999) 409–413Ramachandran, S., A test for legitimate decks25 (1979) 165–173Ramachandran, S.,N -reconstructibility of non-reconstructible digraphs46 (1983) 279–294Ramachandra Rao, A.,seeC. Berge 17 (1977) 23–26Ramana, M.V., E.R. Scheinerman and D. Ullman, Fractional isomorphism of graphs132(1-3) (1994) 247–265Ramírez-Alfonsín, J.L., The spread ofKn 175(1-3) (1997) 221–229Ramírez Alfonsín, J.L.,seeD. Forge 187(1-3) (1998) 109–122Rampon, J.-X.,seeM. Habib 111(1993) 289–303Rampon, J.-X.,seeD. Kratsch 162(1-3) (1996) 305–310Rampon, J.-X.,seeH. Müller 165-166(1-3) (1997) 507–517Rampon, J.-X.,seeD. Kratsch 190(1-3) (1998) 163–175Ramras, M., A new method of generating Hamiltonian cycles on then-cube (Note) 85 (1990) 329–331Ramsay, C.,seeG.M. Hamilton 162(1-3) (1996) 133–150Ramsay, C., I.T. Roberts and F. Ruskey, Completely separating systems ofk-sets 183(1-3) (1998) 265–275Randerath, B.,seeT. Niessen 185(1-3) (1998) 89–103Randerath, B. and L. Volkmann, Characterization of graphs with equal domination and covering number191

(1-3) (1998) 159–169Randrianarivony, A.,seeD. Dumont 132(1-3) (1994) 37–49


Randrianarivony, A.,q,p-Analogue des nombres de Catalan178(1-3) (1998) 199–211Rankin, S.,seeD. Borwein 73 (1989) 291–296Rao, K.P.S.B.,seeD. Moak 131(1-3) (1994) 195–204Rao, M.R.,seeM. Conforti 104(1992) 23–47Rao, M.R.,seeM. Conforti 110(1992) 81–118Rao, S.B.,seeV.N. Bhat-Nayak 20 (1977) 93–102Rao, S.B., The number of open chains of length three and the parity of the number of open chains of lengthk in

self-complementary graphs28 (1979) 291–301Rao, S.B.,seeP. Das 43 (1983) 9–20Rao, S.B., On regular and strongly-regular self-complementary graphs54 (1985) 73–82Rao Hebbare, S.P.,seeT. Gangopadhyay 32 (1980) 229–244Rao Hebbare, S.P.,seeT. Gangopadhyay 32 (1980) 245–255Rao Hebbare, S.P.,seeJ.-M. Laborde 39 (1982) 161–166Rapaport, I.,seeJ. Mazoyer 199(1-3) (1999) 103–122Raposa, B.P.,seeC.E. Praeger 151(1-3) (1996) 201–212Rara, H.M., Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and

the singularity of square planar grids151(1-3) (1996) 213–219Rashidi, R.,seeB.P. Mull 143(1-3) (1995) 209–220Rasmussen, C.W.,seeJ.R. Lundgren 119(1993) 113–122Rasmussen, C.W.,seeJ.R. Lundgren 119(1993) 123–139Rasmussen, D.J. and C.D. Savage, Hamilton-connected derangement graphs onSn 133(1-3) (1994) 217–223Rasmussen, S.,seeB. Bollobás 75 (1989) 55–68Raspaud, A.,seeD. Amar 87 (1991) 111–118Raspaud, A., Postman tours and cycle covers111(1993) 447–454Raspaud, A.,seeO. Ordaz 161(1-3) (1996) 207–215Raspaud, A.,seeJ. Nešetril 165-166(1-3) (1997) 519–530Raspaud, A.,seeO.V. Borodin 188(1-3) (1998) 73–85Rathie, P.N., The enumeration of Hamiltonian polygons in rooted planar triangulations6 (1973) 163–168Ratier, G., On the stable marriage polytope148(1-3) (1996) 141–159Rautenbach, D. and L. Volkmann, The domatic number of block-cactus graphs187(1-3) (1998) 185–193Rautenbach, D., The influence of special vertices on strong domination197-198(1-3) (1999) 683–690Ravikumar, B.,seeM.J. Chung 81 (1990) 1–9Ravindra, G. and K.R. Parthasarathy, Perfect product graphs20 (1977) 177–186Ravindra, G., Perfectness of normal products of graphs24 (1978) 291–298Rawlings, D., Multicolored permutations, sequences, and tableaux83 (1990) 63–79Rawlings, D., Limit formulas forq-exponential functions (Communication) 126(1994) 379–383Rawlings, D.,seeJ.-M. Fedou 143(1-3) (1995) 31–45Rawsthorne, D.A., Tiling complexity of smalln-ominoes(N < 10) 70 (1988) 71–75Ray, N. and C. Wright, Umbral interpolation and the addition/contraction tree for graphs103(1992) 67–74Ray, N. and W. Schmitt, Ultimate chromatic polynomials125(1994) 329–341Ray, N.,seeC. Lenart 167-168(1-3) (1997) 419–444Ray, N.,seeC. Lenart 180(1-3) (1998) 255–280Ray-Chaudhuri, D.K.,seeH. Hanani 3 (1972) 343–357Ray-Chaudhuri, D.K.,seeH.-P. Ko 39 (1982) 37–58Ray-Chaudhuri, D.K. and T. Zhu, A recursive method for construction of designs106/107(1992) 399–406Razborov, A.A., The gap between the chromatic number of a graph and the rank of its adjacency matrix is

superlinear 108(1992) 393–396Razpet, M., On divisibility of binomial coefficients135(1-3) (1994) 377–379Re, P.M.L.,seeP.D. Vito 129(1-3) (1994) 43–52Read, R.C.,seeF. Harary 11 (1975) 371–389Read, R.C.,seeF. Hering 40 (1982) 203–217Read, R.C. and R.W. Robinson, Enumeration of labelled multigraphs by degree parities42 (1982) 99–105Read, R.C.,seeN. Hegde 47 (1983) 109–112Read, R.C., A note on the chromatic uniqueness ofW10 (Note) 69 (1988) 317Read, R.C., Combinatorial problems in the theory of music167-168(1-3) (1997) 543–551


Readdy, M.,seeR. Ehrenborg 157(1-3) (1996) 107–125Readdy, M.A., Extremal problems for the Möbius function in the face lattice of then-octahedron 139 (1-3)

(1995) 361–380Reay, J.,seeR. Ding 68 (1988) 171–177Reay, J.R., Twelve general position points always form three intersecting tetrahedra28 (1979) 193–199Recasens, J., On a geometric combinatorial problem184(1-3) (1998) 273–279Recski, A., On random partitions16 (1976) 173–177Recski, A., On the sum of matroids, III36 (1981) 273–287Recski, A., Bracing cubic grids — A necessary condition73 (1988/89) 199–206Recski, A., Applications of combinatorics to statics—a second survey108(1992) 183–188Redelmeier, D.H., Counting polyominoes: Yet another attack36 (1981) 191–203Redish, K.A. and W.F. Smyth, Closed form expressions for the iterated floor function (Note) 91 (1991) 317–321Redouane, Y.,seeO. Favaron 165-166(1-3) (1997) 243–251Reed, B., A note on the semi-strong perfect graph conjecture (Communication) 54 (1985) 111–112Reed, B.,seeC.T. Hoàng 66 (1987) 103–107Reed, B.,seeA. Frieze 118(1993) 69–74Reed, B.,seeL. Perkovic 165-166(1-3) (1997) 567–578Reed, B.,seeC. McDiarmid 199(1-3) (1999) 123–137Reed, B.A., A note on even pairs (Communication) 65 (1987) 317–318Reed, B.A.,seeC.T. Hoàng 74 (1989) 173–200Reed, B.A.,seeH. Everett 165-166(1-3) (1997) 223–242Reeds, J.A.,seeP.C. Fishburn 91 (1991) 149–159Rees, D.H. and D.A. Preece, Perfect Graeco-Latin balanced incomplete block designs (pergolas)197-198(1-3)

(1999) 691–712Rees, H.D.,seeL.S. Charlap 82 (1990) 153–163Rees, R., Minimal clique partitions and pairwise balanced designs61 (1986) 269–280Rees, R., Frames and theg(k)(v) problem 71 (1988) 243–256Rees, R. and D.R. Stinson, On combinatorial designs with subdesigns77 (1989) 259–279Rees, R., The existence of restricted resolvable designs I: (1, 2)-factorizations ofK2n 81 (1990) 49–80Rees, R., The existence of restricted resolvable designs II: (1, 2)-factorizations ofK2n+1 81 (1990) 263–301Rees, R.,seeS. McGuinness 83 (1990) 49–62Rees, R. and D.R. Stinson, On the number of blocks in a perfect convering ofv points 83 (1990) 81–93Rees, R.,seeE. Lamken 92 (1991) 197–209Rees, R., The spectrum of restricted resolvable designs withr = 2 92 (1991) 305–320Rees, R. and W.D. Wallis, The spectrum of maximal sets of one-factors97 (1991) 357–369Rees, R.S.,seeM.C. Marino 97 (1991) 295–300Reid, K.B., Equivalence ofn-tournaments viak-path reversals 6 (1973) 263–280Reid, K.B.,seeB. Alspach 12 (1975) 205–209Reid, K.B., Cycles in the complement of a tree15 (1976) 163–174Reid, K.B., Every vertex a king 38 (1982) 93–98Reid, K.B., Bipartite graphs obtained from adjacency matrices of orientations of graphs72 (1988) 321–330Reid, K.B. and W. Gu, Plurality preference digraphs realized by trees, II: On realization numbers101 (1992)

231–249Reid, K.B. and W. Gu, Plurality preference digraphs realized by trees—I. Necessary and sufficient conditions

147(1-3) (1995) 185–196Reid, M., D.S. Jungreis and D. Witte, Distances forbidden by some two-coloring ofQ2 82 (1990) 53–56Reid, T.J., Triangles in 3-connected matroids90 (1991) 281–296Reid, T.J., A note on roundedness in 4-connected matroids (Note) 91 (1991) 211–214Reid, T.J.,seeP. Erdos 141(1-3) (1995) 285–290Reid, T.J.,seeP. Erdos 158(1-3) (1996) 283–286Reid, T.J. and L.I. Virden, On rounded five-element lines of matroids163(1-3) (1997) 119–127Reif, J.H. and P.G. Spirakis,k-connectivity in random undirected graphs54 (1985) 181–191Reilly, J.W. and S.M. Tanny, Counting permutations by successions and other figures32 (1980) 69–76Reiner, D.L., Aq-analog of the Campbell-Baker-Hausdorff formula (Communication) 43 (1983) 125–129Reiner, E., Variation on a theme of Solomon193(1-3) (1998) 247–255


Reiner, V., Descents and one-dimensional characters for classical Weyl groups140(1-3) (1995) 129–140Reiner, V., Non-crossing partitions for classical reflection groups177(1-3) (1997) 195–222Reischer, C.,seeL. Martin 22 (1978) 195–196Reiterman, J., V. Rödl, E. Šinajová and M. T˚uma, Threshold hypergraphs54 (1985) 193–200Reiterman, J., V. Rödl and E. Šinajová, Geometrical embeddings of graphs74 (1989) 291–319Reiterman, J.,seeA. Fedeli 108(1992) 13–23Rémila, E.,seeC. Kenyon 152(1-3) (1996) 191–210Rémila, E., Tiling a simply connected figure with bars of length 2 or 3160(1-3) (1996) 189–198Remmel, J.B., Permutation statistics and(k, l)-hook Schur functions 67 (1987) 271–298Remmel, J.B., Formulas for the expansion of the Kronecker productsS(m,n)⊗ S(1p−r ,r) andS

(1k2l ) ⊗ S(1p−r ,r)99 (1992) 265–287

Remmel, J.B.,seeD.A. Beck 153(1-3) (1996) 3–27Remmel, J.B.,seeL. Carini 193(1-3) (1998) 147–177Remmel, J.B. and M. Shimozono, A simple proof of the Littlewood–Richardson rule and applications193(1-3)

(1998) 257–266Ren, H., Another cycle structure theorem for hamiltonian graphs199(1-3) (1999) 237–243Ren, S., A sufficient condition for graphs with large neighborhood unions to be traceable161 (1-3) (1996)

229–234Rendl, F. and M. Leclerc, A multiply constrained matroid optimization problem73 (1988/89) 207–212Rendl, F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane119(1993) 167–174Renner, L.,seeD. Borwein 73 (1989) 291–296Restivo, A., On codes having no finite completions17 (1977) 309–316Restivo, A.,seeA. de Luca 27 (1979) 297–308Reutenauer, C.,seeC. Malvenuto 132(1-3) (1994) 137–143Reutenauer, C.,seeC. Malvenuto 193(1-3) (1998) 225–233Reuter, K., Matchings for linearly indecomposable modular lattices63 (1987) 245–247Reuter, K., Note on the Ahlswede–Daykin inequality (Note) 65 (1987) 209–212Reuter, K., The jump number and the lattice of maximal antichains88 (1991) 289–307Reverdy-Vilotitch, F., La reconstruction au sens de Ulam de certaines multirelations binaires (Note) 93 (1991)

89–95Révész, G. and J. Szigeti, Eulerian trace identities (Note) 147(1-3) (1995) 313–319Reynaud, F., Theorie des ecoulements dans les graphes orientes sans circuit12 (1975) 37–53Reynolds, D.F.,seeG. Exoo 71 (1988) 119–127Reznick, B., P. Tiwari and D.B. West, Decomposition of product graphs into complete bipartite subgraphs

(Communication) 57 (1985) 189–193Reznick, B., Lattice point simplices60 (1986) 219–242Rho, Y., An extremal problem concerning graphs not containingKt andKt,n−t 187(1-3) (1998) 195–209Rhodes, F., Digital metrics generated by families of paths135(1-3) (1994) 265–277Rhodes, F., Metric subgraphs of the chamfer metrics and the Melter–Tomescu path generated metrics147(1-3)

(1995) 197–209Rhodes, F. and R.A. Melter, Geodetic metrizations of graphs194(1-3) (1999) 267–279Rhodes, S.J.,seeA.G. Chetwynd 141(1-3) (1995) 47–59Rhodes, S.J.,seeA.G. Chetwynd 177(1-3) (1997) 17–32Rice, V. and R.D. Ringeisen, On cohesion stable graphs126(1994) 257–272Richard, D., All arithmetical sets of powers of primes are first-order definable in terms of the successor function

and the coprimeness predicate53 (1985) 221–247Richard, J.,seeR. Cori 2 (1972) 115–162Richmond, L.B.,seeE.A. Bender 50 (1984) 1–8Richmond, L.B.,seeE.A. Bender 50 (1984) 135–141Richter, R.B., Nonplanar graphs and well-covered cycles (Note) 85 (1990) 221–222Richter, R.B.,seeP.Z. Chinn 87 (1991) 237–248Richter, R.B., Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces89 (1991) 261–268Richter, R.B.,seeD. McQuillan 104(1992) 311–320Richter, R.B., P.D. Seymour and J. Širán, Circular embeddings of planar graphs in nonspherical surfaces126

(1994) 273–280


Rieper, R.G.,seeJ. Chen 128(1-3) (1994) 73–94Rifà, J.,seeJ. Borges 111(1993) 65–69Rigoni, C., Construction ofn variable codes 56 (1985) 275–280Rigoni, C.,seeM. Ventou 56 (1985) 291–298Riis, S., Bootstrapping the primitive recursive functions by only 27 colors169(1-3) (1997) 269–272Rincón-Mejía, H.A.,seeH. Galeana-Sánchez 152(1-3) (1996) 141–145Rine, D.C., Conditional and Post algebra expressions10 (1974) 309–323Ringeisen, R.,seeL. Beineke 31 (1980) 153–159Ringeisen, R.D., Graphs of given genus and arbitrarily large maximum genus6 (1973) 169–174Ringeisen, R.D.,seeC.H.C. Little 21 (1978) 69–74Ringeisen, R.D. and M.J. Lipman, Cohesion and stability in graphs46 (1983) 191–198Ringeisen, R.D., On cycle permutation graphs51 (1984) 265–275Ringeisen, R.D.,seeV. Rice 126(1994) 257–272Ringeisen, R.D.,seeB.L. Piazza 127(1-3) (1994) 265–276Ringel, G., On the genus of the graphKn ×K2 or then-prism 20 (1977) 287–294Ringel, G.,seeB. Jackson 46 (1983) 15–20Ringel, G.,seeN. Hartsfield 78 (1989) 89–94Ringel, G.,seeN. Hartsfield 81 (1990) 19–23Ringel, G.,seeH. Lenz 97 (1991) 3–16Ringel, G., A.S. Lladó and O. Serra, On the tree number of regular graphs165-166(1-3) (1997) 471–479Ringel, G., A.S. Lladó and O. Serra, On the tree number of regular graphs165-166(1-3) (1997) 587–588Riordan, J., Ballots and rooks4 (1973) 383–387Riordan, J. and P.R. Stein, Proof of a conjecture on Genocchi numbers5 (1973) 381–388Riordan, O.,seeB. Bollobás 179(1-3) (1998) 223–230Riordan, O.,seeB. Bollobás 195(1-3) (1999) 67–80Riskin, A., Projective plane embeddings of polyhedral pinched maps126(1994) 281–291Riskin, A. and D.W. Barnette, On the noninterpolation of polyhedral maps131(1-3) (1994) 211–219Riskin, A., The genus 2 crossing number ofK9 145(1-3) (1995) 211–227Rival, I., seeD. Duffus 19 (1977) 139–158Rival, I., seeI. Rabinovitch 25 (1979) 275–279Rival, I., seeA. Björner 29 (1980) 245–250Rival, I., seeD. Duffus 32 (1980) 1–7Rival, I., seeD. Duffus 35 (1981) 39–52Rival, I., seeD. Duffus 35 (1981) 53–118Rival, I. and R. Wille, The smallest order variety containing all chains35 (1981) 203–212Rival, I., seeR. Nowakowski 43 (1983) 223–234Rival, I. and N. Zaguia, Greedy linear extensions with constraints63 (1987) 249–260Rival, I., seeR. Nowakowski 70 (1988) 169–184Rival, I., seeM. Pouzet 73 (1988/89) 181–188Rival, I., seeJ. Czyzowicz 82 (1990) 233–250Rival, I., seeW.P. Liu 87 (1991) 163–174Rival, I., seeW.-P. Liu 88 (1991) 239–247Rival, I., seeS. Foldes 102(1992) 13–23Rival, I. and J. Urrutia, Representing orders by moving figures in space109(1992) 255–263Rival, I. and N. Zaguia, Perpendicular orders137(1-3) (1995) 303–313Rival, I., seeW.-P. Liu 144(1-3) (1995) 59–66Rivera-Campo, E.,seeJ. Czyzowicz 137(1-3) (1995) 147–153Rivera-Campo, E.,seeV. Neumann-Lara 167-168(1-3) (1997) 511–517Rivera-Campo, E.,seeV. Neumann-Lara 197-198(1-3) (1999) 633–636Rivest, R.L.,seeD.A. Klarner 8 (1974) 31–40Rivest, R.L., The game of “N questions” on a tree 17 (1977) 181–186Riviere, M., Amas dans les graphes planaires19 (1977) 281–286Robbins, D.P.,seeW.H. Mills 67 (1987) 43–55Robbins, D.P.,seeL.S. Charlap 82 (1990) 153–163Roberts, F.S.,T -colorings of graphs: recent results and open problems93 (1991) 229–245


Roberts, I.T.,seeG.M. Hamilton 162(1-3) (1996) 133–150Roberts, I.T.,seeC. Ramsay 183(1-3) (1998) 265–275Roberts, J.,seeJ.F. Fink 86 (1990) 47–57Roberts, J.A.,seeS.A. Burr 8 (1974) 245–250Roberts, J.D.,seeS.Y. Kettoola 40 (1982) 123–124Robertson, I.,T -chromatic polynomials 135(1-3) (1994) 279–286Robertson, J.,seeD. Detemple 47 (1983) 211–219Robertson, J.,seeK. McAvaney 113(1993) 131–142Robertson, J.M.,seeD.W. DeTemple 113(1993) 255–258Robertson, N.,seeM.D. Plummer 7 (1974) 289–303Robertson, N.,seeR.P. Gupta 32 (1980) 37–43Robertson, N., P. Seymour and R. Thomas, Excluding infinite minors95 (1991) 303–319Robertson, N.,seeB. Mohar 149(1-3) (1996) 141–157Robinson, A.G. and A.J. Goldman, On Ringeisen’s Isolation Game80 (1990) 297–312Robinson, A.G. and A.J. Goldman, On the set coincidence game84 (1990) 261–283Robinson, A.G. and A.J. Goldman, On Ringeisen’s isolation game II90 (1991) 153–167Robinson, A.G. and A.J. Goldman, The isolation game for regular graphs112(1993) 173–184Robinson, D.F., Extending a function on a graph6 (1973) 89–99Robinson, R.W. and A.J. Schwenk, The distribution of degrees in a large random tree12 (1975) 359–372Robinson, R.W.,seeR.C. Read 42 (1982) 99–105Robinson, R.W.,seeL.R. Foulds 72 (1988) 129–139Robinson, R.W.,seeD.M. Gordon 128(1-3) (1994) 151–163Robison, A.D.,seeH. Edelsbrunner 81 (1990) 153–164Roblet, E. and X.G. Viennot, Théorie combinatoire des T-fractions et approximants de Padé en deux points153

(1-3) (1996) 271–288Robshaw, M.J.B.,seeK.G. Paterson 138(1-3) (1995) 327–341Roby, T., The connection between the Robinson–Schensted correspondence for skew oscillating tableaux and

graded graphs (Note) 139(1-3) (1995) 481–485Rodger, C.A., Embedding an incomplete latin square in a latin square with a prescribed diagonal51 (1984)

73–89Rodger, C.A.,seeA.J.W. Hilton 58 (1986) 63–78Rodger, C.A., Embedding partial Mendelsohn Triple Systems65 (1987) 187–196Rodger, C.A.,seeC.C. Lindner 77 (1989) 191–203Rodger, C.A.,seeC.C. Lindner 80 (1990) 273–280Rodger, C.A.,seeC.J. Colbourn 97 (1991) 139–148Rodger, C.A.,seeF.E. Bennett 103(1992) 129–137Rodger, C.A.,seeF.E. Bennett 103(1992) 139–151Rodger, C.A.,seeC.C. Lindner 104(1992) 83–90Rodger, C.A.,seeK.T. Phelps 112(1993) 165–172Rodger, C.A.,seeC.C. Lindner 117(1993) 151–159Rodger, C.A., Linear spaces with many small lines129(1-3) (1994) 167–180Rodger, C.A.,seeD.G. Hoffman 160(1-3) (1996) 177–187Rodger, C.A.,seeD.E. Bryant 171(1-3) (1997) 55–75Rodger, C.A.,seeC.C. Lindner 173(1-3) (1997) 1–14Rodger, C.A.,seeM.E. Raines 176(1-3) (1997) 211–222Rodger, C.A.,seeH.L. Fu 178(1-3) (1998) 63–71Rodger, C.A.,seeM. Daven 199(1-3) (1999) 207–215Rodier, F., Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson

149(1-3) (1996) 205–221Rodionov, V.I., On the number of labeled acyclic digraphs (Note) 105(1992) 319–321Roditty, Y.,seeY. Caro 82 (1990) 323–326Roditty, Y.,seeY. Caro 125(1994) 101–106Roditty, Y.,seeY. Caro 138(1-3) (1995) 177–186Roditty, Y.,seeY. Caro 164(1-3) (1997) 47–65Rödl, V.,seeJ. Nešetril 23 (1978) 49–55


Rödl, V.,seeS. Poljak 34 (1981) 173–184Rödl, V.,seeP. Pudlák 39 (1982) 67–73Rödl, V., On a problem in combinatorial geometry (Note) 45 (1983) 129–131Rödl, V.,seeS.A. Burr 54 (1985) 1–13Rödl, V.,seeJ. Reiterman 54 (1985) 193–200Rödl, V.,seeJ. Nešetril 54 (1985) 339–341Rödl, V.,seeP. Erdös 59 (1986) 21–34Rödl, V., On universality of graphs with uniformly distributed edges59 (1986) 125–134Rödl, V. and W.T. Trotter, A note of ranking functions (Note) 67 (1987) 307–309Rödl, V.,seeJ. Reiterman 74 (1989) 291–319Rödl, V.,seeJ. Nešetril 75 (1989) 327–334Rödl, V.,seeC.J. Colbourn 77 (1989) 57–63Rödl, V.,seeJ. Nešetril 101(1992) 223–229Rödl, V.,seeJ. Pelant 108(1992) 75–81Rödl, V.,seeR.A. Duke 108(1992) 261–278Rödl, V.,seeF. Franek 114(1993) 199–203Rödl, V.,seeR.J. Gould 118(1993) 259–262Rödl, V.,seeP. Pudlák 136(1-3) (1994) 253–279Rödl, V.,seeD. Duffus 137(1-3) (1995) 177–187Rodl, V.,seeH.A. Kierstead 150(1-3) (1996) 187–193Rödl, V.,seeT. Łuczak 181(1-3) (1998) 289–294Rodney, P.,seeE. Mendelsohn 133(1-3) (1994) 207–216Rodriguez, J. and A. Satyanarayana, A generalized chromatic polynomial, acyclic orientations with prescribed

sources and sinks, and network reliability112(1993) 185–197Rodriguez, J. and A. Satyanarayana, Chromatic polynomials with least coefficients172(1-3) (1997) 115–119Rodríguez, J.A. and J.L.A. Yebra, Bounding the diameter and the mean distance a graph from its eigenvalues:

Laplacian versus adjacency matrix methods196(1-3) (1999) 267–275Rödseth, Ö.J., Weighted multi-connected loop networks148(1-3) (1996) 161–173Rogers, D.G., Ascending sequences in permutations22 (1978) 35–40Rogers, D.G., Pascal triangles, Catalan numbers and renewal arrays22 (1978) 301–310Rogers, D.G.,seeK.M. Koh 25 (1979) 141–148Rogers, D.G., The enumeration of some restricted matrices27 (1979) 81–91Rogers, D.G.,seeK.M. Koh 31 (1980) 279–292Rogers, D.G., Rhyming schemes: Crossings and coverings33 (1981) 67–77Rogers, D.G., Eplett’s identity for renewal arrays36 (1981) 97–102Rogers, D.G., An arithmetic of complete permutations with constraints, I: An exposition of the general theory

70 (1988) 219–240Rogers, D.G.,seeD.J. Crampin 70 (1988) 241–256Rogers, D.G.,seeW.E. Clark 80 (1990) 249–265Rogers, D.G.,seeG.M. Hamilton 102(1992) 25–45Rogers, D.G.,seeT. Hayasaka 110(1992) 135–154Rogers, D.G., On critical perfect systems of difference sets135(1-3) (1994) 287–301Rogers, D.G.,seeG.M. Hamilton 162(1-3) (1996) 133–150Rogers, T.D., The graph of the square mapping on the prime fields148(1-3) (1996) 317–324Roghelia, N.N. and S.S. Sane, Classification of (16, 6, 2)-designs by ovals51 (1984) 167–177Roitman, M., An infinite family of integral graphs (Note) 52 (1984) 313–315Roman, S., The maximum number ofq-cliques in a graph with nop-clique 14 (1976) 365–371Roman, S., A problem on multi-colorings of graphs22 (1978) 41–47Rong, C.,seeT. Helleseth 195(1-3) (1999) 139–156Ronse, C., A generalization of the perfect shuffle47 (1983) 293–306Roos, C. and C. de Vroedt, Upper bounds forA(n,4) andA(n,6) derived from Delsarte’s linear programming

bound 40 (1982) 261–276Roos, C., A note on the existence of perfect constant weight codes (Note) 47 (1983) 121–123Roos, C. and A.J. van Zanten, On the existence of certain generalized Moore geometries, Part I51 (1984)

179–190


Roos, C. and A.J. van Zanten, On the existence of certain generalized Moore geometries, Part II51 (1984)277–282

Roos, C. and A.J. van Zanten, On the existence of certain generalized Moore geometries, Part III58 (1986)275–283

Roos, C., A.J. van Zanten and M.J. Coster, On the existence of certain generalized Moore geometries (Part IV)62 (1986) 139–144

Roos, C.,seeR.M. Damerell 76 (1989) 183–189Rosa, A., On reverse Steiner triple systems2 (1972) 61–71Rosa, A.,seeP. Hell 2 (1972) 229–252Rosa, A. and C. Huang, Another class of balanced graph designs: Balanced circuit designs12 (1975) 269–293Rosa, A.,seeC.C. Lindner 13 (1975) 31–39Rosa, A.,seeC.C. Lindner 22 (1978) 147–181Rosa, A.,seeC. Huang 27 (1979) 261–277Rosa, A.,seeK.T. Phelps 33 (1981) 57–66Rosa, A.,seeC.J. Colbourn 45 (1983) 165–179Rosa, A., Repeated blocks in indecomposable twofold triple systems65 (1987) 261–276Rosa, A.,seeK. Heinrich 77 (1989) 97–121Rosa, A.,seeR. Mathon 77 (1989) 205–216Rosa, A.,seeC.J. Colbourn 89 (1991) 149–160Rosa, A.,seeC.J. Colbourn 92 (1991) 49–64Rosa, A.,seeP.K. Das 109(1992) 59–67Rosa, A. and Š. Znám, Packing pentagons into complete graphs: how clumsy can you get?128 (1-3) (1994)

305–316Rose, D.J., On simple characterizations ofk-trees 7 (1974) 317–322Rosenberg, A.L., An extrinsic characterization of addressable data graphs9 (1974) 61–70Rosenberg, I.G., Minimization of pseudo-Boolean functions by binary development7 (1974) 151–165Rosenberg, I.G., Aggregation of equations in integer programming10 (1974) 325–341Rosenberg, I.G., Characterization of diagrams by 0-1 inequalities63 (1987) 261–270Rosenberg, I.G.,seeZ. Füredi 71 (1988) 149–163Rosenberg, I.G.,seeS. Hazan 130(1-3) (1994) 77–82Rosenberg, I.G.,seeM. Pouzet 130(1-3) (1994) 103–169Rosenberg, I.G.,seeV. Lashkia 156(1-3) (1996) 277–283Rosenberg, S.J., A large index theorem for orthogonal arrays, with bounds137(1-3) (1995) 315–318Rosenberg, W.J., Consecutive zeros in convolutional codewords3 (1972) 247–264Rosenfeld, M. and D. Barnette, Hamiltonian circuits in certain prisms5 (1973) 389–394Rosenfeld, M.,seeB. Alspach 19 (1977) 103–111Rosenfeld, M.,seeP.R. Goodey 21 (1978) 229–235Rosenfeld, M.,seeB. Alspach 34 (1981) 199–202Rosenfeld, M., The number of cycles in 2-factors of cubic graphs84 (1990) 285–294Rosenmüller, J. and H.G. Weidner, Extreme convex set functions with finite carrier: General theory10 (1974)

343–382Rosenstiehl, P., Scaffold permutations75 (1989) 335–342Rosenstiehl, R.,seeJ.L. Fouquet 165-166(1-3) (1997) 1–2Rosenthal, A., On finding shortest paths in nonnegative networks10 (1974) 159–162Rosický, J.,seeJ. Adámek 108(1992) 133–137Ross, J.A.,seeR.A. Brualdi 33 (1981) 123–138Ross, J.A.,seeC.L. Lucchesi 47 (1983) 267–273Ross, N.J., Remarks on the mobius function of a subposet (Communication) 73 (1989) 305–307Rostom, N.K.A.,seeJ.D. Key 69 (1988) 235–239Rota, G.-C.,seeS.A. Joni 37 (1981) 193–202Rota, G.-C.,seeW.Y.C. Chen 104(1992) 7–22Rota, G.-C.,seeR. Huang 128(1-3) (1994) 225–236Rota, G.-C., Report on the present state of combinatorics153(1-3) (1996) 289–303Rota, G.-C., Combinatorics, representation theory and invariant theory: The story of a ménage à trois193(1-3)

(1998) 5–16


Rota, R., Hyperaffine planes over hyperrings155(1-3) (1996) 215–223Rotem, D., Stack sortable permutations33 (1981) 185–196Rotem, D.,seeM.C. Golumbic 43 (1983) 37–46Roth, A.J. and M. Sobel, A probabilistically attained set of polynomials that generate stirling numbers of the

second kind 32 (1980) 77–84Roth, R.,seeR.J. Gould 66 (1987) 91–102Roth, R.L., Color symmetry and group theory38 (1982) 273–296Roth, R.L., Perfect colorings of multipatterns in the plane122(1993) 269–286Roth, R.M. and A. Lempel,t-Sum generators of finite Abelian groups103(1992) 279–292Rothblum, U.G., On the number of complementary trees in a graph15 (1976) 359–371Rothblum, U.G.,seeF.K. Hwang 160(1-3) (1996) 1–23Rothschild, B.L.,seeD.J. Kleitman 2 (1972) 173–178Rothstein, J.,seeS.E. Bammel 11 (1975) 93–95Rotman, J.J., Finite planes and graphs64 (1987) 43–79Rottenberg, R.R., On ordinary planes5 (1973) 395–401Roudneff, J.-P., On the number of triangles in simple arrangements of pseudolines in the real projective plane

60 (1986) 243–251Roudneff, J.-P.,seeH. Meyniel 70 (1988) 311–313Roudneff, J.-P., Partitions of points into intersecting tetrahedra81 (1990) 81–86Roudneff, J.-P., Cells with many facets in arrangements of hyperplanes98 (1991) 185–191Rousseau, C.,seeY. Li 170(1-3) (1997) 265–267Rousseau, C.C.,seeR.J. Faudree 6 (1973) 35–52Rousseau, C.C.,seeS.A. Burr 33 (1981) 227–237Rousseau, C.C.,seeS.A. Burr 38 (1982) 23–32Rousseau, C.C.,seeP. Erdös 67 (1987) 227–233Rousseau, C.C.,seeP. Erdos 72 (1988) 103–112Rousseau, C.C.,seeR.J. Faudree 72 (1988) 119–127Rousseau, C.C.,seeP. Erdos 85 (1990) 53–58Rousseau, C.C.,seeP. Erdos 101(1992) 23–31Rousseau, C.C.,seeP. Erdös 113(1993) 259–262Rousseau, C.C.,seeP. Erdos 127(1-3) (1994) 139–152Rousseau, C.C.,seeP. Erdos 127(1-3) (1994) 153–161Rousseau, C.C.,seeY. Li 170(1-3) (1997) 269–275Rousseau, C.C.,seeP. Erdos 200(1-3) (1999) 55–60Rousseau, R., Representations of a sublattice of the partition lattice on a lattice47 (1983) 307–314Roussel, F.,seeV. Giakoumakis 165-166(1-3) (1997) 311–332Rowlinson, P.,seeY. Yang 125(1994) 399–406Royle, G.F.,seeP.H. Fisher 71 (1988) 19–32Royle, G.F.,seeY.M. Chee 97 (1991) 93–100Royle, G.F.,seeA.D. Gardiner 103(1992) 161–170Royle, G.F.,seeD.L. Kreher 156(1-3) (1996) 269–275Royle, G.F., An orderly algorithm and some applications in finite geometry185(1-3) (1998) 105–115Rozenberg, G.,seeG.T. Herman 6 (1973) 235–247Rozenberg, G., D0L sequences7 (1974) 323–347Rozenberg, G.,seeA. Ehrenfeucht 15 (1976) 223–234Rozenberg, G.,seeA. Ehrenfeucht 22 (1978) 233–242Rozenberg, G.,seeA. Ehrenfeucht 128(1-3) (1994) 113–141Rozenberg, G.,seeA. Ehrenfeucht 190(1-3) (1998) 259–264Rucinski, A., The behaviour of( n

k,...,k,n−ik )ci/i! is asymptotically normal 49 (1984) 287–290Rucinski, A.,seeZ. Palka 61 (1986) 253–258Rucinski, A., Matching and covering the vertices of a random graph by copies of a given graph105 (1992)

185–197Rucinski, A.,seeT. Łuczak 148(1-3) (1996) 311–316Rucinski, A. and M. Truszczynski, A note on local colorings of graphs164(1-3) (1997) 251–255Rudeanu, S.,seeC.H. Cunkle 7 (1974) 41–51


Rudeanu, S., Local properties of Boolean functions I: Injectivity13 (1975) 143–160Rudeanu, S., Local properties of Boolean functions II: Isotony13 (1975) 161–183Rudeanu, S., Linear Boolean equations and generalized minterms43 (1983) 241–248Rudeanu, S., Unique solutions of Boolean ring equations (Note) 122(1993) 381–383Rudolf, R.,seeD. Fortin 189(1-3) (1998) 105–115Rueda, O.,seeL. Iturrioz 18 (1977) 35–44Ruiz, M.-J.P.,Cn-factors of group graphs72 (1988) 331–336Ruiz, S., Randomly decomposable graphs57 (1985) 123–128Ruiz, S.,seeY. Alavi 72 (1988) 3–13Rumsey Jr., H.,seeW.H. Mills 67 (1987) 43–55Runge, B., Codes and Siegel modular forms148(1-3) (1996) 175–204Rusin, D.J.,seeJ.A. Gallian 27 (1979) 245–259Ruskey, F., A simple proof of a formula of Dershowitz and Zaks (Note) 43 (1983) 117–118Ruskey, F.,seeC.W. Ko 71 (1988) 47–56Ruskey, F.,seeM. Jiang 133(1-3) (1994) 159–169Ruskey, F.,seeC. Ramsay 183(1-3) (1998) 265–275Russell, A.,seeM. Klugerman 186(1-3) (1998) 289–293Russell, D.L., Sums of products of terms from linear recurrence sequences28 (1979) 65–79Rusu, I., A new class of perfect Hoàng graphs145(1-3) (1995) 279–285Rusu, I., Properly orderable graphs158(1-3) (1996) 223–229Rusu, I.,seeJ.-L. Fouquet 165-166(1-3) (1997) 291–302Rusu, I., Building counterexamples171(1-3) (1997) 213–227Ruth, G.R.,seeC.L. Liu 4 (1973) 171–184Rüttimann, G.T.,seeS.P. Gudder 68 (1988) 221–244Rüttimann, G.T.,seeS.P. Gudder 68 (1988) 245–255Ruzsa, I.Z.,seeP. Erdos 111(1993) 189–196Ryan, J.,seeD.C. Fisher 103(1992) 313–320Ryan, J.,seeD.C. Fisher 110(1992) 275–278Ryan, J.,seeM. Sutton 195(1-3) (1999) 287–293Ryjácek, Z.,N2-locally disconnected graphs121(1993) 189–193Ryjácek, Z. and I. Schiermeyer, On the independence number inK1,r+1-free graphs 138(1-3) (1995) 365–374Ryjácek, Z., Hamiltonicity in claw-free graphs through induced bulls140(1-3) (1995) 141–147Ryjácek, Z.,seeR. Faudree 164(1-3) (1997) 87–147Ryjácek, Z., Matching extension inK1,r -free graphs with independent claw centers164(1-3) (1997) 257–263Ryjácek, Z.,seeH.J. Broersma 167-168(1-3) (1997) 155–166Ryjácek, Z. and I. Schiermeyer, 2-factors and hamiltonicity191(1-3) (1998) 171–177Ryjácek, Z.,seeB. Bollobás 195(1-3) (1999) 67–80Ryjácek, Z.,seeJ. Brousek 196(1-3) (1999) 29–50Ryjácek, Z.,seeJ. Brousek 197-198(1-3) (1999) 143–155Ryser, H.J.,seeJ.H. van Lint 3 (1972) 381–396Ryser, H.J., Matrices and set differences49 (1984) 169–173Sabidussi, G., Meshes on 3-connected graphs1 (1971) 269–276Sabidussi, G.,seeS. Foldes 30 (1980) 117–120Sabidussi, G., Color-reversal by local complementation64 (1987) 81–86Sabidussi, G.,seeW. Imrich 81 (1990) 237–245Sabidussi, G.,seeN. Polat 95 (1991) 271–289Sabidussi, G.,seeJ. Lützen 100(1992) 9–82Sabidussi, G.,seeM. Christiansen 100(1992) 83–97Sabidussi, G., Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation

of graphs 1889–1891100(1992) 99–155Sabidussi, G., Binary invariants and orientations of graphs101(1992) 251–277Sabidussi, G.,seeH. Fleischner 109(1992) 103–116Sabidussi, G.,seeN. Polat 130(1-3) (1994) 97–102Sachs, H. and M. Stiebitz, On constructive methods in the theory of colour-critical graphs74 (1989) 201–226


Sachs, H., How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs101(1992) 279–284

Sachs, H.,seeT. Wang 104(1992) 281–292Sachs, H., Coin graphs, polyhedra, and conformal mapping134(1-3) (1994) 133–137Sachs, H., Graph Theory in Organic Chemistry: Problems and Methods in the Chemistry of Carbon Footballs and

Tubes (Fullerenes) 165-166(1-3) (1997) 597–598Saclé, J.-F.,seeO. Favaron 111(1993) 197–220Saclé, J.-F., Lower bounds for the size in four families of minimum broadcast graphs150(1-3) (1996) 359–369Saclé, J.-F. and M. Wo´zniak, A note on packing of three forests164(1-3) (1997) 265–274Saclé, J.-F. and M. Wo´zniak, On graphs which contain each tree of given size165-166(1-3) (1997) 589–595Sagan, B.,seeS.A. Joni 37 (1981) 193–202Sagan, B.E., A note on Abel polynomials and rooted labeled forests44 (1983) 293–298Sagan, B.E., Inductive and injective proofs of log concavity results68 (1988) 281–292Sagan, B.E., Inductive proofs ofq-log concavity 99 (1992) 289–306Sagan, B.E., Y.-N. Yeh and G.M. Ziegler, Maximizing Möbius functions on subsets of Boolean algebras126

(1994) 293–311Sagan, B.E.,seeS. Dulucq 139(1-3) (1995) 129–142Sagan, B.E.,seeJ.-P. Allouche 139(1-3) (1995) 455–461Saidi, S., Codes for perfectly correcting errors of limited size118(1993) 207–223Sain, M.K.,seeJ.L. Massey 3 (1972) 163–175Saito, A.,seeM. Kano 47 (1983) 113–116Saito, A.,seeY. Egawa 68 (1988) 179–189Saito, A.,seeR.E.L. Aldred 88 (1991) 1–9Saito, A., One-factors andk-factors (Note) 91 (1991) 323–326Saito, A., Cycles of length 2 modulo 3 in graphs101(1992) 285–289Saito, A.,seeN. Dean 121(1993) 37–49Saito, A.,seeT. Nishimura 162(1-3) (1996) 319–323Saito, A.,seeB. Bollobás 195(1-3) (1999) 67–80Saito, N.,seeT. Asano 38 (1982) 1–6Saito, S. and T. Hayasaka, The Langford(4, n)-sequence: A trigonometric approach28 (1979) 81–88Saito, S. and T. Hayasaka, Langford sequences: Some connections with complete and additive permutations84

(1990) 63–70Saito, S.,seeT. Hayasaka 110(1992) 135–154Šajna, M., Half-transitivity of some metacirculants185(1-3) (1998) 117–136Sakai, D. and C. Wang, No-hole(r + 1)-distant colorings 119(1993) 175–189Sakaloglu, A. and A. Satyanarayana, Planar graphs with least chromatic coefficients172(1-3) (1997) 121–130Sakamoto, A.,seeM. Kano 82 (1990) 219–222Sakarovitch, M.,seeJ.D. MacAllister 20 (1977) 133–142Sakarovitch, M., Quelques theoremes de dualite combinatoire21 (1978) 201–212Saks, M., Some sequences associated with combinatorial structures59 (1986) 135–166Saks, M.,seeJ. Kahn 63 (1987) 183–195Saks, M.,seeL. Lovász 75 (1989) 319–325Saks, M.,seeM. Karchmer 114(1993) 275–282Saks, M.,seeR. Hochberg 138(1-3) (1995) 261–265Saks, M.E.,seeR.A. Proctor 30 (1980) 173–180Salazar, R.,seeE. Montenegro 122(1993) 377–380Sali, A., Constructions of ranked posets70 (1988) 77–83Sali, A.,seeR.P. Anstee 175(1-3) (1997) 13–21Sali, A. and G. Simonyi, Intersecting set systems and graphic matroids185(1-3) (1998) 279–285Sallee, J.F., A triangulation of then-cube 40 (1982) 81–86Salomaa, A., Solution of a decision problem concerning unary Lindenmayer systems9 (1974) 71–77Salvetti, M., On the homotopy theory of complexes associated to metrical-hemisphere complexes113 (1993)

155–177Salvetti, M. and F. Stumbo, Artin groups associated to infinite Coxeter groups163(1-3) (1997) 129–138Salvi, N.Z.,seeD. Marušic 102(1992) 279–285


Salvi, N.Z., Maximal intersection critical families of finite sets155(1-3) (1996) 267–269Salvy, B.,seeX. Gourdon 153(1-3) (1996) 145–163Salzberg, P.M., Random number generation: A combinatorial approach54 (1985) 313–320Salzberg, P.M., M.A. López and R.E. Giudici, On the chromatic uniqueness of bipartite graphs58 (1986) 285–

294Sampathkumar, E. and V.N. Bhave, Partition graphs and coloring numbers of a graph16 (1976) 57–60Sampathkumar, E. and C.V. Venkatachalam, Chromatic partitions of a graph74 (1989) 227–239Sampathkumar, E., The least point covering and domination numbers of a graph86 (1990) 137–142Sampathkumar, E., Generalizations of independence and chromatic numbers of a graph115(1993) 245–251Sampathkumar, E. and G.D. Kamath, A generalization of chromatic index124(1994) 173–177Sampathkumar, E. and L.P. Latha, Strong weak domination and domination balance in a graph161(1-3) (1996)

235–242Sampathkumar, R.,seeR. Balakrishnan 156(1-3) (1996) 19–28Sampathkumar, R.,seeR. Balakrishnan 186(1-3) (1998) 15–24Sanchez-Anton, J.M.,seeD.J. Wilde 1 (1971) 277–294Sánchez-Arroyo, A., Determining the total colouring number is NP-hard (Communication) 78 (1989) 315–319Sánchez-Arroyo, A.,seeC.J.H. McDiarmid 111(1993) 389–392Sánchez-Arroyo, A.,seeC.J.H. McDiarmid 124(1994) 155–162Sánchez-Arroyo, A., A new upper bound for total colourings of graphs138(1-3) (1995) 375–377Sánchez-Flores, A., A counterexample to a generalization of Richardson’s theorem (Note) 65 (1987) 319–320Sanchez-Flores, A., An improved upper bound for Ramsey numberN (3,3,3,3;2) 140(1-3) (1995) 281–286Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number87 (1991)

65–72Sanchis, L.A., Some results on characterizing the edges of connected graphs with a given domination number

140(1-3) (1995) 149–166Sander, J.W., On maximal antihierarchic sets of integers113(1993) 179–189Sanders, D.P., On circuits through five edges159(1-3) (1996) 199–215Sanders, E.L.,seeA.R. Bednarek 5 (1973) 1–14Sanders, R.S., Graphs on which a dihedral group acts edge-transitively118(1993) 225–232Sandquist, E.J.,seeA.P. Godbole 190(1-3) (1998) 79–93Sands, A.D., On generalized Catalan numbers (Note) 21 (1978) 219–221Sands, B., Generating sets for lattices of dimension two29 (1980) 287–292Sands, B., Counting antichains in finite partially ordered sets35 (1981) 213–228Sane, S.S.,seeN.N. Roghelia 51 (1984) 167–177Sane, S.S.,seeN.B. Limaye 64 (1987) 199–207Sane, S.S., Hussain chains revisited (Note) 70 (1988) 211–213Sane, S.S.,seeR.M. Pawale 96 (1991) 71–74Sangalli, A.A.L.,seeA. Achache 130(1-3) (1994) 3–7Sankaran, P. and K. Varadarajan, A note on the homotopy type of posets126(1994) 313–323Sankaranarayana, R.S. and L.K. Stewart, Recursively decomposable well-covered graphs161(1-3) (1996) 243–

263Sankoff, D. and P.H. Sellers, Shortcuts, diversions, and maximal chains in partially ordered sets4 (1973) 287–

293Santha, M. and U.V. Vazirani, Parallel searching of multidimensional cubes114(1993) 425–433Santmyer, J.M., A Stirling like sequence of rational numbers171(1-3) (1997) 229–235Santoro, N.,seeV. Neumann-Lara 62 (1986) 65–70Santoro, N.,seeM.D. Atkinson 80 (1990) 115–122Sanyal, B.K.,seeM.K. Sen 147(1-3) (1995) 235–245Sapir, M.V.,seeT.E. Hall 161(1-3) (1996) 151–160Saražin, M.L., A simple upper bound for the hamiltonian index of a graph134(1-3) (1994) 85–91Sarkar, A.,seeB. Bollobás 200(1-3) (1999) 5–19Sárkozy, A.,seeP. Erdos 75 (1989) 155–166Sárközy, A.,seeP. Erdos 102(1992) 249–264Sárközy, A.,seeP. Erdos 136(1-3) (1994) 75–99Sárközy, A.,seeP. Erdos 200(1-3) (1999) 149–164


Sarkozy, G.N.,seeA.C. Atkins 195(1-3) (1999) 235–237Sarmiento, I., A characterisation of jointless Dowling geometries197-198(1-3) (1999) 713–731Sarti, S.D., Remarks on umbral evaluations of chromatic polynomials (Note) 126(1994) 431–437Sarvate, D.G. and R.C. Hamm, Row-column directed block designs92 (1991) 321–328Sarvate, D.G.,seeJ. Hammer 102(1992) 149–154Sassano, A.,seeP. Nobili 119(1993) 141–166Sastry, D.V.S. and B.S.P. Raju, Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs

48 (1984) 113–119Sastry, N.S.N.,seeB. Bagchi 57 (1985) 307–310Sathaye, A.,seeS.S. Abhyankar 133(1-3) (1994) 25–46Sato, I., Clique graphs of packed graphs (Note) 62 (1986) 107–109Sato, I.,seeH. Mizuno 69 (1988) 283–294Sato, I., Enumeration of packed graphs (Note) 82 (1990) 331–333Sato, I., Isomorphisms of some graph coverings128(1-3) (1994) 317–326Sato, I.,seeH. Mizuno 142(1-3) (1995) 295–298Sato, I.,seeH. Mizuno 176(1-3) (1997) 197–202Sato, M.,seeT.T. Cong 40 (1982) 153–162Sato, M. and T.T. Cong, The number of minimal lattice paths restricted by two parallel lines43 (1983) 249–261Sato, M., Note on the number of minimal lattice paths restricted by two parallel lines (Note) 44 (1983) 117–121Satyanarayana, A. and R. Tindell, Chromatic polynomials and network reliability67 (1987) 57–79Satyanarayana, A.,seeJ. Rodriguez 112(1993) 185–197Satyanarayana, A.,seeT. Politof 126(1994) 245–256Satyanarayana, A.,seeT. Politof 161(1-3) (1996) 217–228Satyanarayana, A.,seeJ. Rodriguez 172(1-3) (1997) 115–119Satyanarayana, A.,seeA. Sakaloglu 172(1-3) (1997) 121–130Satyanarayana, K.,seeM.L. Narayana Rao 66 (1987) 175–190Sauer, N.,seeE.C. Milner 35 (1981) 165–171Sauer, N.,seeA. Hajnal 59 (1986) 61–67Sauer, N.,seeA. Bialostocki 59 (1986) 221–228Sauer, N.,seeK. Böröczky 115(1993) 57–63Sauer, N.,seeA. Hajnal 117(1993) 113–125Sauer, N.,seeD. Duffus 152(1-3) (1996) 125–139Sauer, N., Edge partitions of the countable triangle free homogeneous graph185(1-3) (1998) 137–181Sauer, N.W.,seeM. El-Zahar 94 (1991) 1–10Saunders, B.D. and H. Schneider, Flows on graphs applied to diagonal similarity and diagonal equivalence for

matrices 24 (1978) 205–220Savage, C., Short strings containing allk-element permutations42 (1982) 281–285Savage, C.D.,seeD.J. Rasmussen 133(1-3) (1994) 217–223Savage, C.D.,seeJ.M. Nolan 179(1-3) (1998) 277–283Savage, C.D. and C.-Q. Zhang, The connectivity of acyclic orientation graphs184(1-3) (1998) 281–287Savický, P., Random Boolean formulas representing any Boolean function with asymptotically equal probability

83 (1990) 95–103Savický, P., Bent functions and random boolean formulas147(1-3) (1995) 211–234Savini, S.,seeL.F. Monteiro 189(1-3) (1998) 177–189Sbihi, N., Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile29 (1980)

53–76Sbihi, N.,seeD. Naddef 31 (1980) 107–109Sbihi, N. and J.P. Uhry, A class ofh-perfect graphs 51 (1984) 191–205Scapellato, R., OnF -geodetic graphs 80 (1990) 313–325Scapellato, R.,seeD. Marušic 102(1992) 279–285Scapellato, R.,seeD. Marušic 109(1992) 161–170Scapellato, R., A characterization of bipartite graphs associated with BIB-designs withλ= 1 (Note) 112(1993)

283–287Scapellato, R.,seeD. Marušic 134(1-3) (1994) 93–98Scapellato, R.,seeD. Marušic 134(1-3) (1994) 99–110


Scapellato, R.,seeW. Pacco 173(1-3) (1997) 291–296Schaar, G., On ‘maximal’ Hamiltonian cycles in the square of a block121(1993) 195–198Schaar, G., On the Hamiltonicity exponent of directed cacti164(1-3) (1997) 275–284Schaar, G. and A. Pawel Wojda, An upper bound for the Hamiltonicity exponent of finite digraphs164 (1-3)

(1997) 313–316Schäfer, D. and K.E. Wolff, Pólya enumeration of expansions of resolvable incidence structures43 (1983) 263–

271Schäffer, A.A., Shortest prefix strings containing all subset permutations64 (1987) 239–252Schäffer, A.A.,seeJ. Feigenbaum 109(1992) 77–102Schalkwijk, J.P.M., Some aspects of the information theoretic dialogue106/107(1992) 407–413Scharbrodt, M.,seeM. Jünger 182(1-3) (1998) 169–176Scharlau, R.,seeA.W.M. Dress 60 (1986) 121–138Scheim, D.E., The number of edge 3-colorings of a planar cubic graph as a permanent8 (1974) 377–382Schein, B.M., Semigroups of tolerance relations64 (1987) 253–262Scheinerman, E.R., Characterizing intersection classes of graphs55 (1985) 185–193Scheinerman, E.R., Irrepresentability by multiple intersection, or why the interval number is unbounded55

(1985) 195–211Scheinerman, E.R., Irredundancy in multiple interval representations (Note) 63 (1987) 101–108Scheinerman, E.R., On the interval number of random graphs (Note) 82 (1990) 105–109Scheinerman, E.R., An evolution of interval graphs82 (1990) 287–302Scheinerman, E.R.,seeM.V. Ramana 132(1-3) (1994) 247–265Scheinerman, E.R.,seeM. Jacobson 176(1-3) (1997) 159–175Scheinerman, E.R.,seeC.M. Fiduccia 181(1-3) (1998) 113–138Schellenberg, P.J.,seeR.C. Mullin 37 (1981) 79–104Schellenberg, P.J.,seeD.G. Hoffman 97 (1991) 243–250Schelp, R.,seeP. Erdos 141(1-3) (1995) 285–290Schelp, R.,seeP. Erdos 158(1-3) (1996) 283–286Schelp, R.H.,seeR.J. Faudree 6 (1973) 35–52Schelp, R.H.,seeR.J. Faudree 8 (1974) 313–329Schelp, R.H.,seeR.J. Faudree 10 (1974) 269–277Schelp, R.H.,seeR.J. Faudree 16 (1976) 149–155Schelp, R.H.,seeR.J. Faudree 32 (1980) 105–123Schelp, R.H.,seeS.A. Burr 33 (1981) 227–237Schelp, R.H.,seeS.A. Burr 38 (1982) 23–32Schelp, R.H.,seeP. Erdös 67 (1987) 227–233Schelp, R.H.,seeP. Erdos 72 (1988) 103–112Schelp, R.H.,seeR.J. Faudree 72 (1988) 119–127Schelp, R.H.,seeR.J. Faudree 76 (1989) 223–240Schelp, R.H.,seeR.J. Faudree 78 (1989) 83–87Schelp, R.H.,seeP. Erdos 85 (1990) 53–58Schelp, R.H.,seeP. Bendrossian 115(1993) 39–50Schelp, R.H.,seeR.J. Faudree 126(1994) 121–135Schelp, R.H.,seeP. Erdos 127(1-3) (1994) 153–161Schelp, R.H.,seeO. Favaron 159(1-3) (1996) 103–109Schelp, R.H.,seeG. Chen 170(1-3) (1997) 231–236Schelp, R.H.,seeG. Chen 191(1-3) (1998) 65–82Schelp, R.H.,seeB. Bollobás 195(1-3) (1999) 67–80Schelp, R.H.,seeP. Erdos 200(1-3) (1999) 55–60Schelten, A. and U. Schelten, Neighborhood conditions for graphs with induced claws191 (1-3) (1998) 179–

189Schelten, A. and I. Schiermeyer, Ramsey numbersr(K3,G) for G∼=K7− 2P2 andG∼=K7− 3P2 191 (1-3)

(1998) 191–196Schelten, U.,seeA. Schelten 191(1-3) (1998) 179–189Schestag, I.,seeA. Beutelspacher 59 (1986) 207–220Schiermeyer, I., Computation of the 0-dual closure for hamiltonian graphs111(1993) 455–464


Schiermeyer, I.,seeH.J. Broersma 124(1994) 37–47Schiermeyer, I., Thek-SATISFIABILITY problem remains NP-complete for dense families125(1994) 343–346Schiermeyer, I.,seeZ. Ryjácek 138(1-3) (1995) 365–374Schiermeyer, I.,seeH.J. Broersma 167-168(1-3) (1997) 155–166Schiermeyer, I.,seeT. Böhme 191(1-3) (1998) 31–43Schiermeyer, I.,seeZ. Ryjácek 191(1-3) (1998) 171–177Schiermeyer, I.,seeA. Schelten 191(1-3) (1998) 191–196Schiermeyer, I.,seeJ. Brousek 197-198(1-3) (1999) 143–155Schiller, J., Perceptron order for cylindrical, polar, and spherical connectivity14 (1976) 77–81Schindler, C., Constructible hypergraphs91 (1991) 183–191Schmeichel, E.,seeA.M. Hobbs 42 (1982) 317–320Schmeichel, E.,seeS.-M. Lee 93 (1991) 201–209Schmeichel, E.,seeD. Bauer 124(1994) 13–17Schmeichel, E.,seeS.L. Hakimi 149(1-3) (1996) 93–98Schmeichel, E.,seeD. Bauer 155(1-3) (1996) 13–18Schmeichel, E.F.,seeJ.B. Collier 18 (1977) 265–271Schmeichel, E.F.,seeD. Bauer 79 (1989/90) 59–70Schmeichel, E.F.,seeD. Bauer 79 (1989/90) 147–152Schmerl, J.H.,seeH.A. Kierstead 45 (1983) 277–285Schmerl, J.H.,seeH.A. Kierstead 58 (1986) 253–262Schmerl, J.H. and W.T. Trotter, Critically indecomposable partially ordered sets, graphs, tournaments and other

binary relational structures113(1993) 191–205Schmerl, J.H., Tiling space with notched cubes133(1-3) (1994) 225–235Schmid, H.J., A geometrical interpretation of the Hungarian method21 (1978) 297–308Schmid, J., On maximal sublattices of finite lattices199(1-3) (1999) 151–159Schmidt, B., Nonexistence of a (783,69,6)-difference set178(1-3) (1998) 283–285Schmidt, F.W.,seeR. Simion 46 (1983) 107–108Schmidt, G.,seeR. Berghammer 43 (1983) 1–7Schmidt, G. and T. Ströhlein, Relation algebras: Concept of points and representability54 (1985) 83–92Schmidt, J. and E. Shamir, A threshold for perfect matchings in randomd-pure hypergraphs 45 (1983) 287–295Schmidt, J.P., Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number

66 (1987) 259–277Schmidt, R., On the existence of uncountably many matroidal families27 (1979) 93–97Schmidt, W., Greedoids and searches in directed graphs93 (1991) 75–88Schmitt, E.,seeI. Diener 55 (1985) 13–19Schmitt, P., Spreading information by conferences (Note) 15 (1976) 305–306Schmitt, W.,seeN. Ray 125(1994) 329–341Schmitt, W.R.,seeV. Domocos 132(1-3) (1994) 377–381Schmutz, E., Partitions whose parts are pairwise relatively prime81 (1990) 87–89Schneider, B.,seeJ. Aubert 37 (1981) 19–27Schneider, B.,seeJ. Aubert 38 (1982) 7–16Schneider, H.,seeB.D. Saunders 24 (1978) 205–220Schneider, M.H.,seeM. Hartmann 137(1-3) (1995) 223–240Schneider, R.,seeA. Geroldinger 150(1-3) (1996) 123–130Schneider, R., On the chairman assignment problem159(1-3) (1996) 217–222Schoen, T.,seeT. Łuczak 181(1-3) (1998) 289–294Schönheim, J.,seeM. Herzog 1 (1972) 329–332Schönheim, J., Partition of the edges of the directed complete graph into 4-cycles11 (1975) 67–70Schönheim, J.,seeJ.C. Bermond 19 (1977) 113–120Schönheim, J.,seeY. Caro 33 (1981) 319–321Schönheim, J.,seeI. Krasikov 53 (1985) 137–145Schönheim, J.,seeJ.I. Brown 80 (1990) 123–143Schonheim, J.,seeI. Krasikov 124(1994) 133–136Schönheim, J.,seeY. Caro 138(1-3) (1995) 177–186Schönheim, J.,seeY. Caro 164(1-3) (1997) 47–65


Schott, R.,seeP. Feinsilver 180(1-3) (1998) 157–171Schrader, R.,seeU. Faigle 58 (1986) 295–301Schrader, R.,seeO. Goecke 82 (1990) 93–99Schrag, G., Automorphism groups and the full state spaces of the Petersen graph generalizations ofG32 70

(1988) 185–198Schrag, G. and L. Cammack, On the 2-extendability of the generalized Petersen graphs78 (1989) 169–177Schrage, G., Some inequalities for multidimensional (0, 1)-matrices23 (1978) 169–175Schreiber, S., Cyclical Steiner Triple Systems orthogonal to their opposites77 (1989) 281–284Schreiber, S., Symmetric quasigroups of odd order77 (1989) 285–297Schrijver, A.,seeA.E. Brouwer 20 (1977) 1–10Schrijver, A.,seeH.M. Mulder 25 (1979) 41–50Schrijver, A. and P.D. Seymour, Solution of two fractional packing problems of Lovász26 (1979) 177–184Schrijver, A., A counterexample to a conjecture of Edmonds and Giles (Communication) 32 (1980) 213–214Schrijver, A., On the number of edge-colourings of regular bipartite graphs38 (1982) 297–301Schrijver, A.,seeA.E. Brouwer 47 (1983) 177–182Schrijver, A.,seeC.A.J. Hurkens 73 (1988/89) 99–109Schrijver, A., Circuits in graphs embedded on the torus106/107(1992) 415–433Schrijver, A.,seeM. de Graaf 110(1992) 279–282Schrijver, A.,seeJ. Edmonds 165-166(1-3) (1997) 209–216Schröder, B.S.W., On CC-comparability invariance of the fixed point property179(1-3) (1998) 167–183Schroeder, M.J., Dependence systems with the operator–image exchange property133(1-3) (1994) 237–248Schroth, A.E., How to draw a hexagon199(1-3) (1999) 161–171Schughart, M.,seeT. Andreae 88 (1991) 11–20Schulte, E. and J.M. Wills, On Coxeter’s regular skew polyhedra60 (1986) 253–262Schulte, E., On a class of abstract polytopes constructed from binary codes84 (1990) 295–301Schulte, E. and A.I. Weiss, Chirality and projective linear groups131(1-3) (1994) 221–261Schulte, U., Constructing trees in bipartite graphs154(1-3) (1996) 317–320Schultz, M.,seeG. Chartrand 147(1-3) (1995) 73–86Schultz, M.,seeG. Chartrand 170(1-3) (1997) 63–79Schultz, P., Enumerations of rooted trees with an application to group presentations41 (1982) 199–214Schulz, C., An invertable 3-diagram with 8 vertices28 (1979) 201–205Schulz, C., Dual pairs of non-polytopal diagrams and spheres55 (1985) 65–72Schulz, M., An example of a cubic graph with two orbits and simple eigenvalue

√3 (Communication) 31(1980)

221–222Schulz, R.-H., A note on check character systems using Latin squares97 (1991) 371–375Schuster, S.,seeG. Chartrand 5 (1973) 313–315Schützenberger, M.P., Promotion des morphismes D’ensembles ordonnes2 (1972) 73–94Schützenberger, M.-P.,seeA. Lascoux 99 (1992) 165–179Schuur, P.C.,seeJ.B.M. Melissen 145(1-3) (1995) 333–342Schwahn, C.,seeH. Brandes 125(1994) 73–86Schwärzler, W., Being Hamiltonian is not a Tutte invariant (Communication) 91 (1991) 87–89Schwärzler, W. and A. Sebö, A generalized cut-condition for multiflows in matroids113(1993) 207–221Schwärzler, W.,seeA. Bouchet 181(1-3) (1998) 53–63Schweigert, D., Congruence relations of multialgebras53 (1985) 249–253Schwenk, A.,seeB. Manvel 94 (1991) 209–219Schwenk, A.J.,seeF. Harary 6 (1973) 359–365Schwenk, A.J.,seeR.W. Robinson 12 (1975) 359–372Schwenk, A.J., An asymptotic evalution of the cycle index of a symmetric group18 (1977) 71–78Sciriha, I. and S. Fiorini, On the characteristic polynomial of homeomorphic images of a graph174(1-3) (1997)

293–308Sciriha, I., On the construction of graphs of nullity one181(1-3) (1998) 193–211Scott, A.D.,seeA.J. Radcliffe 140(1-3) (1995) 275–279Scott, A.D.,seeB. Bollobás 170(1-3) (1997) 41–49Scott, A.D.,seeD.M. Berman 175(1-3) (1997) 35–40Scott, A.D., Reconstructing sequences175(1-3) (1997) 231–238


Scott, A.D., On graph decompositions modulok 175(1-3) (1997) 289–291Scott, D.D.,seeJ. Lehel 74 (1989) 341–346Scott, S.H.,seeA.J.W. Hilton 7 (1974) 111–127Scoville, R.,seeL. Carlitz 5 (1973) 45–59Scoville, R.,seeL. Carlitz 14 (1976) 215–239Scozzafava, R., Graphs and finite transformation semigroups5 (1973) 87–99Scurr, R. and G. Olive, Stirling numbers revisited189(1-3) (1998) 209–219Seager, S.,seeM. Katchalski 142(1-3) (1995) 141–154Seah, E. and D.R. Stinson, A perfect one-factorization forK36 70 (1988) 199–202Seberry, J.,seeC. Koukouvinos 88 (1991) 49–58Seberry, J.,seeC. Koukouvinos 92 (1991) 173–176Sebö, A., A quick proof of Seymour’s theorem ont-joins (Note) 64 (1987) 101–103Sebö, A.,seeW. Schwärzler 113(1993) 207–221Seidel, J.J.,seeJ.M. Goethals 12 (1975) 143–158Seidel, J.J., A note on path-zero graphs106/107(1992) 435–438Seidel, J.J., Isometric embeddings and geometric designs136(1-3) (1994) 281–293Seidman, S.B.,seeM.G. Everett 57 (1985) 217–223Seifert, B.G., On the arithmetic of cycles for the Collatz-Hasse (‘Syracuse’) conjectures68 (1988) 293–298Seifter, N., A note on infinite transitive graphs (Note) 58 (1986) 317–321Seifter, N.,seeW. Imrich 73 (1988/89) 111–117Seifter, N., Groups acting on graphs with polynomial growth89 (1991) 268–280Seifter, N.,seeW. Imrich 95 (1991) 101–117Seifter, N., On the girth of infinite graphs (Note) 118(1993) 275–283Seifter, N.,seeA. Lukács 186(1-3) (1998) 227–236Selfridge, J.L.,seeP. Erdos 200(1-3) (1999) 137–147Selkow, S.M., The independence number of graphs in terms of degrees (Communication) 122(1993) 343–348Selkow, S.M., A Probabilistic lower bound on the independence number of graphs132(1-3) (1994) 363–365Selkow, S.M.,seeC.A. Christen 149(1-3) (1996) 279–281Selkow, S.M., The enumeration of labeled graphs by number of cutpoints185(1-3) (1998) 183–191Selkow, S.M.,seeA.C. Atkins 195(1-3) (1999) 235–237Sellers, J., New congruences for generalized Frobenius partitions with two or three colors131 (1-3) (1994)

367–373Sellers, J.A., Recurrences for 2-colored and 3-colored F-partitions156(1-3) (1996) 303–310Sellers, J.A.,seeM.D. Hirschhorn 199(1-3) (1999) 85–101Sellers, P.H.,seeD. Sankoff 4 (1973) 287–293Sen, M.,seeS. Das 122(1993) 113–136Sen, M.K., B.K. Sanyal and D.B. West, Representing digraphs using intervals or circular arcs147(1-3) (1995)

235–245Senato, D., A. Venezia and J. Yang, Möbius polynomial species173(1-3) (1997) 229–256Sendrier, N.,seeH. Chabanne 112(1993) 245–248Senechal, I.J., Chain algebras37 (1981) 229–244Sénizergues, G.,seeB. Courcelle 182(1-3) (1998) 29–51Seress, Á., Gossiping old ladies46 (1983) 75–81Seress, Á.,seeP. Erdös 59 (1986) 21–34Seress, Á.,seeD. Miklós 68 (1988) 265–272Seress, Á., On vertex-transitive, non-Cayley graphs of orderpqr 182(1-3) (1998) 279–292Serfati, M., Une methode de resolution des equations postiennes a partir d’une solution particuliere17 (1977)

187–189Serfati, M., Boolean differential equations146(1-3) (1995) 235–246Serfati, M., On postian algebraic equations152(1-3) (1996) 269–285Serfati, M., The lattice theory ofr-ordered partitions 194(1-3) (1999) 205–227Serra, O.,seeJ. Gómez 114(1993) 219–235Serra, O.,seeJ.M. Brunat 138(1-3) (1995) 147–159Serra, O.,seeY.O. Hamidoune 159(1-3) (1996) 131–142Serra, O.,seeF. Hurtado 162(1-3) (1996) 187–197


Serra, O.,seeG. Ringel 165-166(1-3) (1997) 471–479Serra, O.,seeG. Ringel 165-166(1-3) (1997) 587–588Serra, O.,seeI.J. Dejter 182(1-3) (1998) 69–83Servatius, B.,seeC. Droms 109(1992) 69–75Servatius, B. and H. Servatius, Self-dual maps on the sphere134(1-3) (1994) 139–150Servatius, B. and H. Servatius, The 24 symmetry pairings of self-dual maps on the sphere140 (1-3) (1995)

167–183Servatius, B. and H. Servatius, Self-dual graphs149(1-3) (1996) 223–232Servatius, H., An Artin relation of lengthn in the braid group 104(1992) 185–189Servatius, H.,seeC. Droms 109(1992) 69–75Servatius, H.,seeB. Servatius 134(1-3) (1994) 139–150Servatius, H.,seeB. Servatius 140(1-3) (1995) 167–183Servatius, H.,seeB. Servatius 149(1-3) (1996) 223–232Šešelja, B. and A. Tepavcevic, On generation of finite posets by meet-irreducibles186(1-3) (1998) 269–275Sevast’janov, S. and W. Banaszczyk, To the Steinitz lemma in coordinate form169(1-3) (1997) 145–152Sewald, J.,seeL.F. Monteiro 189(1-3) (1998) 177–189Sewell, E.C. and L.E. Trotter Jr., Stability critical graphs and ranks facets of the stable set polytope147 (1-3)

(1995) 247–255Seyffarth, K., Hajós’ conjecture and small cycle double covers of planar graphs101(1992) 291–306Seyffarth, K.,seeP. Hell 111(1993) 313–322Seyffarth, K., Packings and perfect path double covers of maximal planar graphs117(1993) 183–195Seymour, P.,seeN. Robertson 95 (1991) 303–319Seymour, P. and R. Thomas, An end-faithful spanning tree counterexample95 (1991) 321–330Seymour, P.D., A two-commodity cut theorem23 (1978) 177–181Seymour, P.D., Counterexample to a conjecture of Jeurissen (Note) 24 (1978) 315Seymour, P.D.,seeA. Schrijver 26 (1979) 177–184Seymour, P.D., Disjoint paths in graphs29 (1980) 293–309Seymour, P.D.,seeF.R.K. Chung 75 (1989) 113–119Seymour, P.D.,seeM. de Graaf 110(1992) 279–282Seymour, P.D.,seeR.B. Richter 126(1994) 273–280Sha, J. and D.J. Kleitman, The number of linear extensions of subset ordering63 (1987) 271–278Shader, B.L.,seeR.A. Brualdi 96 (1991) 161–174Shader, B.L., On biclique partitions of the complete graph117(1993) 197–213Shaheen, F.,seeQ. Mushtaq 126(1994) 225–238Shahriari, S., On the structure of maximum 2-part Sperner families162(1-3) (1996) 229–238Shalaby, N.,seeC.J. Colbourn 92 (1991) 49–64Shalaby, N.,seeE. Mendelsohn 97 (1991) 301–317Shalaby, N.,seeA.M. Assaf 103(1992) 121–128Shalaby, N., The existence of near-Skolem and hooked near-Skolem sequences135(1-3) (1994) 303–319Shamir, E. and E. Upfal, One-factor in random graphs based on vertex choice41 (1982) 281–286Shamir, E.,seeJ. Schmidt 45 (1983) 287–295Shamir, E.,seeR. Levy 114(1993) 361–365Shamir, R., A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs

114(1993) 435–444Shamula, M.,seeY. Alavi 72 (1988) 3–13Shank, H.S., The rational case of a matrix problem of Harrison28 (1979) 207–212Shannon, A.G., J.C. Turner and K.T. Atanassov, A generalized tableau associated with colored convolution trees

92 (1991) 329–340Shao, J.,seeQ. Li 123(1993) 75–92Shao, J.-y. and W.-d. Wei, A formula for the number of Latin squares (Note) 110(1992) 293–296Shapiro, B., M. Shapiro and A. Vainshtein, Topology of intersections of Schubert cells and Hecke algebra153

(1-3) (1996) 305–318Shapiro, B., M. Shapiro and A. Vainshtein, Kazhdan–Lusztig polynomials for certain varieties of incomplete flags

180(1-3) (1998) 345–355Shapiro, H.D., Generalized Latin squares on the torus24 (1978) 63–77


Shapiro, L.W., A Catalan triangle14 (1976) 83–90Shapiro, L.W., A combinatorial proof of a Chebyshev polynomial identity (Note) 34 (1981) 203–206Shapiro, L.W., Voting blocks, reluctant functions, and a formula of Hurwitz (Note) 87 (1991) 319–322Shapiro, M.,seeB. Shapiro 153(1-3) (1996) 305–318Shapiro, M.,seeB. Shapiro 180(1-3) (1998) 345–355Sharary, A.H. and N. Zaguia, Minimizing the number of tardy jobs in single machine sequencing117 (1993)

215–223Sharir, M. and S.S. Skiena, Tight bounds on a problem of lines and intersections (Note) 89 (1991) 313–314Sharma, A., A note on stability of graphs (Note) 49 (1984) 201–203Sharma, C.S.,seeG.E. Nicholson 52 (1984) 235–242Sharp Jr., H., Enumeration of vacuously transitive relations4 (1973) 185–196Sharp Jr., H.,seeC. Bang 45 (1983) 123–126Sharry, M.J. and A. Penfold Street, Partitioning sets of quadruples into designs I77 (1989) 299–305Sharry, M.J. and A. Penfold Street, Partitioning sets of quadruples into designs III92 (1991) 341–359Shastri, A., Lower bounds for bi-colored quaternary Ramsey numbers (Note) 84 (1990) 213–216Shastri, A.,seeG.W. Peck 103(1992) 177–187Shaw, R., A property ofA7, and a maximal 3-dimensional linear section of GL(4,2)197-198(1-3) (1999)

733–747Shawe-Taylor, J.,seeT. Pisanski 36 (1981) 113–115Shawe-Taylor, J., Coverings of complete bipartite graphs and associated structures134(1-3) (1994) 151–160Sheard, M.,seeC.J. Knickerbocker 76 (1989) 277–278Sheard, M.,seeC.J. Kinckerbocker 88 (1991) 33–48Sheard, M.,seeG.R.T. Hendry 187(1-3) (1998) 281–290Shearer, J., A property of the colored complete graph25 (1979) 175–178Shearer, J.B., A simple counterexample to a conjecture of Rota (Note) 28 (1979) 327–330Shearer, J.B., A note on circular dimension (Note) 29 (1980) 103Shearer, J.B.,seeD.J. Kleitman 30 (1980) 151–156Shearer, J.B., A note on the independence number of triangle-free graphs46 (1983) 83–87Shearer, J.B.,seeZ. Füredi 63 (1987) 143–152Shearer, J.B.,seeM.E. Watkins 66 (1987) 289–298Shee, S.-C., Some results onλ-valuation of graphs involving complete bipartite graphs87 (1991) 73–80Shee, S.C.,seeS.M. Lee 93 (1991) 195–200Shee, S.C.,seeS.-M. Lee 93 (1991) 201–209Shee, S.-C. and Y.-S. Ho, The cordiality of one-point union ofn copies of a graph 117(1993) 225–243Shee, S.-C. and Y.-S. Ho, The cordiality of the path-union ofn copies of a graph 151(1-3) (1996) 221–229Sheehan, J., Non-bipartite graphs of girth 48 (1974) 383–402Sheehan, J.,seeR.J. Faudree 32 (1980) 105–123Sheehan, J.,seeR.J. Faudree 46 (1983) 151–157Sheehan, J.,seeR.J. Faudree 48 (1984) 197–204Sheehan, J., Graph decomposition with constraints on the minimum degree68 (1988) 299–307Sheehan, J., Balanced graphs with minimum degree constraints102(1992) 307–314Sheehan, J.,seeC.R.J. Clapham 120(1993) 253–259Sheehan, J., Graphical decompositions125(1994) 347–355Sheehan, J.,seeB. Jackson 177(1-3) (1997) 123–144Sheehan, J.,seeR.J. Faudree 183(1-3) (1998) 81–101Shefrin, H.M., On the combinatorial structure of Bayesian learning with imperfect information37 (1981) 245–

254Shelah, S.,seeM. Kaufmann 54 (1985) 285–293Shelton, A.P., R.D. Dutton and R.C. Brigham, Extension of a clique cover result to uniform hypergraphs (Note)

59 (1986) 199–201Shelton, R., K.J. Heuvers, D. Moak and K.P.S. Bhaskara Rao, Multinomial matrices (Communication) 61

(1986) 107–114Shelton, R.,seeM. Gilpin 84 (1990) 15–21Shelton, R.O. and R.P. Soni, Chains and fixing blocks in irreducible binary sequences54 (1985) 93–99Shen, B.-Z.,seeG.-Z. Xiao 87 (1991) 181–186


Shen, H.,seeF.E. Bennett 97 (1991) 47–57Shen, H.,seeS. Milici 145(1-3) (1995) 191–200Shen, J., An improvement of the Dulmage–Mendelsohn theorem158(1-3) (1996) 295–297Shen, R. and F. Tian, Neighborhood unions and hamiltonicity of graphs141(1-3) (1995) 213–225Shen, R. and F. Tian, Long dominating cycles in graphs177(1-3) (1997) 287–294Shen, X., Generalized Latin squares II143(1-3) (1995) 221–242Shen, X.-J.,seeH. Edelsbrunner 81 (1990) 153–164Shende, A.M.,seeD.S. Rajan 161(1-3) (1996) 309–314Shephard, G.C.,seeB. Grünbaum 20 (1977) 235–247Shephard, G.C.,seeF. Hering 40 (1982) 203–217Shephard, G.C.,seeB. Grünbaum 60 (1986) 155–192Shepherd, B.,seeE.J. Cockayne 58 (1986) 221–227Shepherd, F.B.,seeK. Kilakos 181(1-3) (1998) 179–191Shepherd, F.B.,seeA.M.H. Gerards 188(1-3) (1998) 111–125Shepp, L.A.,seeC.L. Mallows 54 (1985) 301–311Shepp, L.A.,seeP.C. Fishburn 91 (1991) 149–159Shepp, L.A.,seeP.C. Fishburn 98 (1991) 105–122Sheppard, D.A., The factorial representation of balanced labelled graphs15 (1976) 379–388Sherman, S.,seeO.J. Heilmann 1 (1971) 19–27Shi, F. and W. Li, The density of a maximum minimal cut in the subset lattice of a finite set is almost one123

(1993) 111–115Shi, M., Y. Li and F. Tian, Tree decompositions for a class of graphs189(1-3) (1998) 221–232Shi, Y., Some theorems of uniquely pancyclic graphs59 (1986) 167–180Shi, Y., On maximum cycle-distributed graphs71 (1988) 57–71Shi, Y., The number of edges in a maximum cycle-distributed graph (Note) 104(1992) 205–209Shi, Y., On simple MCD graphs containing a subgraph homeomorphic toK4 126(1994) 325–338Shi, Y., The number of cycles in a hamilton graph133(1-3) (1994) 249–257Shier, D.R., A decomposition algorithm for optimality problems in tree-structured networks6 (1973) 175–189Shikare, M.M.,seeT.T. Raghunathan 184(1-3) (1998) 267–271Shiloach, Y., U. Vishkin and S. Zaks, Golden ratios in a pairs covering problem41 (1982) 57–65Shimozono, M.,seeJ.B. Remmel 193(1-3) (1998) 257–266Shimshoni, M.,seeA.S. Fraenkel 2 (1972) 335–345Shiraishi, S., A remark on maximum matching of line graphs179(1-3) (1998) 289–291Shirakura, T.,seeS. Tazawa 90 (1991) 63–74Shirakura, T., Fractional factorial designs of two and three levels116(1993) 99–135Shirali, S.,seeR. Chandrasekaran 51 (1984) 137–145Shiu, W.C.,seeP.C.B. Lam 173(1-3) (1997) 285–289Shor, P.W.,seeK.L. Collins 63 (1987) 15–19Shostak, R.,seeB. Baker 2 (1972) 191–193Shpectorov, S., Complementaryl1-graphs 192(1-3) (1998) 323–331Shreve, W.E.,seeG. Chen 170(1-3) (1997) 231–236Shrikhande, M.,seeA. Baartmans 40 (1982) 129–139Shrikhande, M.,seeA. Pott 90 (1991) 215–217Shrikhande, M.S.,seeW.G. Bridges 9 (1974) 1–18Shrikhande, M.S.,seeR.C. Bose 16 (1976) 1–7Shrikhande, M.S.,seeR.C. Bose 21 (1978) 97–101Shrikhande, M.S.,seeA. Baartmans 57 (1985) 301–305Shrikhande, M.S.,seeN.B. Limaye 64 (1987) 199–207Shrikhande, M.S. and N.M. Singhi, An elementary derivation of the annihilator polynomial for extremal(2s+1)-

designs 80 (1990) 93–96Shrikhande, S.S.,seeR.C. Bose 6 (1973) 305–312Shyr, H.J., S.S. Yu and G. Thierrin, Monogenic e-closed languages and dipolar words126(1994) 339–348Shyr, H.J. and Y.S. Tsai, Free submonoids in the monoid of languages181(1-3) (1998) 213–222Sidorenko, A., A partially ordered set of functionals corresponding to graphs131(1-3) (1994) 263–277Sidorenko, A.F., An infinite permutation without arithmetic progressions (Communication) 69 (1988) 211


Sidorenko, A.F., Triangle-free regular graphs (Note) 91 (1991) 215–217Siemes, W., J. Topp and L. Volkmann, On unique independent sets in graphs131(1-3) (1994) 279–285Siemon, H., Infinite families of strictly cyclic Steiner quadruple systems77 (1989) 307–316Siemon, H., On the existence of cyclic Steiner Quadruple Systems SQS(2p) 97 (1991) 377–385Siemons, I.J., Kernels of modular inclusion maps174(1-3) (1997) 309–315Siemons, J., Permutation groups on unordered sets II; On a theorem of Frucht (Note) 118(1993) 285–288Silberger, D.M.,seeA. Ehrenfeucht 26 (1979) 101–109Simeone, B.,seeP. Marchioro 51 (1984) 47–61Simeone, B.,seeP. Marchioro 69 (1988) 253–261Simic, S.,seeD. Cvetkovic 138(1-3) (1995) 213–227Simic, S.K.,seeD.M. Cvetkovic 13 (1975) 315–320Simion, R. and F.W. Schmidt, On(+1,−1)-matrices with vanishing permanent (Note) 46 (1983) 107–108Simion, R., The lattice automorphisms of the dominance ordering49 (1984) 89–93Simion, R., Trees with 1-factors and oriented trees88 (1991) 93–104Simion, R. and D. Ullman, On the structure of the lattice of noncrossing partitions98 (1991) 193–206Simion, R.,seeP.H. Edelman 99 (1992) 63–68Simion, R.,seeP.H. Edelman 126(1994) 107–119Simion, R.,seeA. Denise 137(1-3) (1995) 155–176Simmons, G.J., On a problem of Erdös concerning a 3-coloring of the unit sphere8 (1974) 81–84Simmons, H., Generalized deviations of posets98 (1991) 123–139Simó, E. and J.L.A. Yebra, The vulnerability of the diameter of foldedn-cubes 174(1-3) (1997) 317–322Simões-Pereira, J.M.C., An algorithm and its role in the study of optimal graph realizations of distance matrices

79 (1989/90) 299–312Simões-Pereira, J.M.S., On matroids on edge sets of graphs with connected subgraphs as circuits II12 (1975)

55–78Simões-Pereira, J.M.S., Subgraphs as circuits and bases of matroids12 (1975) 79–88Simões-Pereira, J.M.S., A note of finite topologies and switching functions18 (1977) 299–310Simões-Pereira, J.M.S., A note on distance matrices with unicyclic graph realizations65 (1987) 277–287Simon, I.,seeJ.A. Brzozowski 4 (1973) 243–271Simon, K.,seeD. Crippa 170(1-3) (1997) 81–98Simon, P.,seeB. Balcar 108(1992) 5–12Simonis, J., The [18, 9, 6] code is unique106/107(1992) 439–448Simonovits, M.,seeP. Erdös 5 (1973) 323–334Simonovits, M., Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions

7 (1974) 349–376Simonovits, M.,seeD. Duffus 32 (1980) 1–7Simonovits, M.,seeW.G. Brown 48 (1984) 147–162Simons, W. and G. Trapp, Separating points by spheres10 (1974) 163–166Simonyi, G.,seeR. Ahlswede 128(1-3) (1994) 389–394Simonyi, G.,seeA. Sali 185(1-3) (1998) 279–285Simpson, J.,seeS.G. Boswell 179(1-3) (1998) 235–241Simpson, J.E.,seeM. Behzad 16 (1976) 187–193Simpson, J.E., Langford sequences: Perfect and hooked44 (1983) 97–104Simpson, J.E., A note on perfect systems of difference sets (Note) 63 (1987) 109–110Simpson, R.J., Exact coverings of the integers by arithmetic progressions59 (1986) 181–190Simpson, R.J., Disjoint covering systems of rational Beatty sequences92 (1991) 361–369Simpson, R.J.,seeR.B. Eggleton 111(1993) 165–178Šinajová, E.,seeJ. Reiterman 54 (1985) 193–200Šinajová, E.,seeJ. Reiterman 74 (1989) 291–319Šinajová, E., A note on vector representation of graphs (Note) 89 (1991) 315–317Sinclair, P.A., The construction and reduction of strong snarks167-168(1-3) (1997) 553–570Singh, L.P.S.,seeA.M. Assaf 126(1994) 1–12Singhi, N.M.,seeM.S. Shrikhande 80 (1990) 93–96Sinha, K., Generalized partially balanced incomplete block designs (Note) 67 (1987) 315–318Sinha, K.,seeS. Kageyama 92 (1991) 137–144


Sinha, K., A class ofq-ary codes (Note) 126(1994) 439–440Širán, J., Infinite families of crossing-critical graphs with a given crossing number (Note) 48 (1984) 129–132Širán, J. and P. Horák, A construction of thickness-minimal graphs64 (1987) 263–268Širán, J.,seeP. Horák 84 (1990) 23–29Širán, J., Characterization of signed graphs which are cellularly embeddable in no more than one surface94

(1991) 39–44Širán, J., Duke’s theorem does not extend to signed graph embeddings (Note) 94 (1991) 233–238Širán, J., End-faithful forests and spanning trees in infinite graphs95 (1991) 331–340Širán, J. and M. Škoviera, Groups with sign structure and their antiautomorphisms108(1992) 189–202Širán, J.,seeM. Škoviera 109(1992) 265–276Širán, J. and M. Škoviera, Regular maps from Cayley graphs II. Antibalanced Cayley maps124(1994) 179–191Širán, J.,seeR.B. Richter 126(1994) 273–280Širán, J., M. Škoviera and H.-J. Voss, Sachs triangulations and regular maps134(1-3) (1994) 161–175Siu, M.-K. and P. Tong, Generation of some de Bruijn sequences (Note) 31 (1980) 97–100Siu, M.-K.,seeW.-K. Chan 125(1994) 107–113Skau, I.,seeK. Dale 137(1-3) (1995) 357–360Skiena, S.S.,seeM. Sharir 89 (1991) 313–314Skillicorn, D.B., More generalized packing numbers39 (1982) 75–86Škoviera, M.,seeB. Mohar 56 (1985) 87–89Škoviera, M., A contribution to the theory of voltage graphs61 (1986) 281–292Škoviera, M. and R. Nedela, The maximum genus of vertex-transitive graphs78 (1989) 179–186Škoviera, M., The maximum genus of graphs of diameter two87 (1991) 175–180Škoviera, M.,seeJ. Širán 108(1992) 189–202Škoviera, M. and J. Širán, Regular maps from Cayley graphs, Part 1: Balanced Cayley maps109 (1992) 265–

276Škoviera, M.,seeJ. Širán 124(1994) 179–191Škoviera, M.,seeJ. Širán 134(1-3) (1994) 161–175Skowronska, M. and M.M. Sysło, Dominating cycles in Halin graphs86 (1990) 215–224Škrekovski, R.,seeM. Juvan 187(1-3) (1998) 137–149Škrekovski, R.,seeS. Klavžar 187(1-3) (1998) 255–258Škrekovski, R., Choosability ofK5-minor-free graphs 190(1-3) (1998) 223–226Skrien, D., Interval line graphs (Note) 51 (1984) 317–318Skrien, D. and J. Gimbel, Homogeneously representable interval graphs55 (1985) 213–216Skupien, Z.,seeJ. Jamrozik 39 (1982) 229–234Skupien, Z.,seeR. Kalinowski 82 (1990) 101–104Skupien, Z.,seeA. Marczyk 96 (1991) 213–220Slamin,seeM. Sutton 195(1-3) (1999) 287–293Slater, P.J.,seeS. Maurer 20 (1977) 255–262Slater, P.J.,seeS.B. Maurer 24 (1978) 185–195Slater, P.J., Path coverings of the vertices of a tree25 (1979) 65–74Slater, P.J., Onk-sequential and other numbered graphs34 (1981) 185–193Slater, P.J.,seeD.W. Bange 44 (1983) 235–241Slater, P.J., Onk-graceful, countably infinite graphs61 (1986) 293–303Slater, P.J.,seeD.L. Grinstead 86 (1990) 239–254Slater, P.J.,seeR.A. Gibbs 93 (1991) 155–165Slater, P.J.,seeM.A. Henning 158(1-3) (1996) 87–98Slater, P.J.,seeD.W. Bange 159(1-3) (1996) 1–11Slater, P.J.,seeA.T. Amin 187(1-3) (1998) 1–17Sloane, N.J.A.,seeF.J. MacWilliams 3 (1972) 153–162Sloane, N.J.A., A survey of constructive coding theory, and a table of binary codes of highest known rate3

(1972) 265–294Sloane, N.J.A.,seeC.L. Mallows 9 (1974) 391–400Sloane, N.J.A.,seeP.C. Fishburn 74 (1989) 263–290Sloane, N.J.A.,seeY. Cheng 83 (1990) 205–212Sloane, N.J.A.,seeJ.H. Conway 83 (1990) 213–217


Sloane, N.J.A.,seeR.H. Hardin 106/107(1992) 255–264Sloane, N.J.A.,seeM. Bernstein 170(1-3) (1997) 29–39Smallwood, C.V., Partitions of sets of matrices13 (1975) 261–275Smith, C.A.B.,seeR.L. Brooks 100(1992) 291–301Smith, D.H., On bipartite tetravalent graphs10 (1974) 167–172Smith, D.H., An improved version of Lloyd’s theorem15 (1976) 175–184Smith, D.H. and S. Hurley, Bounds for the frequency assignment problem167-168(1-3) (1997) 571–582Smith, D.H.,seeS.M. Allen 197-198(1-3) (1999) 41–52Smith, J.D.H., Minimal trees of given search number66 (1987) 191–202Smith, J.D.H., Quasigroups and quandles109(1992) 277–282Smith, K.,seeB. Manvel 94 (1991) 209–219Smith, P., A doubly divisible nearly Kirkman system (Note) 18 (1977) 93–96Smith, W.D.,seeA.M. Odlyzko 146(1-3) (1995) 169–177Smith, W.D.,seeM.B. Dillencourt 161(1-3) (1996) 63–77Smithline, L., Bandwidth of the completek-ary tree 142(1-3) (1995) 203–212Smutný, P. and M. Tkác, On cubic polyhedral graphs with prescribed adjacency properties of their faces191

(1-3) (1998) 197–206Smyth, W.F.,seeK.A. Redish 91 (1991) 317–321Smyth, W.F.,seeL. Caccetta 102(1992) 121–141Smyth, W.F.,seeN. Hartsfield 141(1-3) (1995) 163–171Snevily, H.S., The snake-in-the-box problem: A new upper bound133(1-3) (1994) 307–314Snevily, H.S., New families of graphs that haveα-labelings 170(1-3) (1997) 185–194Snir, M., The covering problem of complete uniform hypergraphs (Note) 27 (1979) 103–105Snover, S.L.,seeJ.M. Goethals 3 (1972) 65–88Snover, S.L., C. Waiveris and J.K. Williams, Rep-tiling for triangles91 (1991) 193–200Sobel, M.,seeA.J. Roth 32 (1980) 77–84Soifer, A.,seeI. Hoffman 150(1-3) (1996) 427–429Solé, P., Completely regular codes and completely transitive codes81 (1990) 193–201Solé, P., On the parameters of codes for the Lee and modular distance89 (1991) 185–194Solé, P.,seeC. Garcia 111(1993) 257–261Solé, P. and T. Zaslavsky, Maximality of the cycle code of a graph128(1-3) (1994) 401–405Solé, P., The edge-forwarding index of orbital regular graphs130(1-3) (1994) 171–176Solé, P., Counting lattice points in pyramids139(1-3) (1995) 381–392Solé, P. and J.-P. Tillich, On the dual distance and the gap of a binary code192(1-3) (1998) 333–336Solheid, E.S.,seeR.A. Brualdi 61 (1986) 1–19Solomon, W.,seeP.J. Lorimer 104(1992) 91–97Solow, A.E.,seeD.C. Fisher 82 (1990) 251–258Soltan, P.,seeH. Martini 195(1-3) (1999) 167–180Šoltés, L’., Forbidden induced subgraphs for line graphs132(1-3) (1994) 391–394Šoltés, L’.,seeY. Li 170(1-3) (1997) 269–275Soneoka, T., H. Nakada, M. Imase and C. Peyrat, Sufficient conditions for maximally connected dense graphs

63 (1987) 53–66Song, E., W. Ye and Y. Liu, New lower bounds for Ramsey numberR(p,q;4) 145(1-3) (1995) 343–346Song, Z.M.,seeK.M. Zhang 133(1-3) (1994) 325–328Song, Z.-X.,seeJ.-S. Li 195(1-3) (1999) 255–262Soni, R.P.,seeR.O. Shelton 54 (1985) 93–99Sonnino, A., Linear collineation groups preserving an arc in a Möbius plane197-198(1-3) (1999) 749–757Sopena, E.,seeJ. Nešetril 165-166(1-3) (1997) 519–530Sopena, E.,seeO.V. Borodin 188(1-3) (1998) 73–85Sørensen, A.B., On the number of rational points on codimension-1 algebraic sets inPn(Fq ) 135 (1-3) (1994)

321–334Soria, M.,seeP. Flajolet 114(1993) 159–180Sós, V.T.,seeP. Erdös 2 (1972) 207–228Sós, V.T.,seeB. Andrásfai 8 (1974) 205–218Sós, V.T.,seeP. Erdös 47 (1983) 49–62


Sós, V.T.,seeP. Erdos 136(1-3) (1994) 75–99Soták, R.,seeM. Hornák 146(1-3) (1995) 109–121Soták, R.,seeM. Hornák 176(1-3) (1997) 139–148Soták, R.,seeS. Jendrol 197-198(1-3) (1999) 453–467Sotirakoglou, K.,seeS. Kounias 92 (1991) 177–185Sotteau, D., Decomposition ofK∗n into circuits of odd length 15 (1976) 185–191Sotteau, D.,seeJ.C. Bermond 18 (1977) 235–241Sotteau, D.,seeG. Hahn 44 (1983) 281–284Sotteau, D.,seeM.C. Heydemann 52 (1984) 199–207Sotteau, D. and A.P. Wojda, Digraphs without directed path of length two or three (Note) 58 (1986) 105–108Sotteau, D.,seeM. Kouider 73 (1989) 301–304Sotteau, D.,seeO. Favaron 91 (1991) 311–316Sotteau, D.,seeJ.-C. König 121(1993) 123–134Souad, E.B.,seeP.D. Tao 70 (1988) 85–101Spartalis, S., On the number ofHV -rings withP -hyperoperations 155(1-3) (1996) 225–231Spears, W.T.,seeD.M. Jackson 30 (1980) 133–149Spence, E., Skew-Hadamard matrices of order 2(q + 1) 18 (1977) 79–85Spence, E., Is Taylor’s graph geometric?106/107(1992) 449–454Spence, E. and V.D. Tonchev, Extremal self-dual codes from symmetric designs (Communication) 110(1992)

265–268Spence, E., Classification of Hadamard matrices of order 24 and 28140(1-3) (1995) 185–243Spence, E.,seeE.R. van Dam 189(1-3) (1998) 233–257Spence, E.,seeM.-O. Pavcevic 196(1-3) (1999) 257–266Spencer, J., Turán’s theorem fork-graphs 2 (1972) 183–186Spencer, J.,seeD.J. Kleitman 6 (1973) 255–262Spencer, J., Asymptotic lower bounds for Ramsey functions20 (1977) 69–76Spencer, J.,seeZ. Palka 61 (1986) 253–258Spencer, J., Coloring the projective plane73 (1988/89) 213–220Spencer, J., From Erdos to algorithms 136(1-3) (1994) 295–307Spencer, J.H.,seeJ. Pach 79 (1989/90) 107–108Spera, A.G.,(s, k,λ)-Partitions of a vector space (Note) 89 (1991) 213–217Speranza, M.G.,seeP. Dell’Olmo 164(1-3) (1997) 67–79Spicer, E.R.,seeD.E. Bryant 171(1-3) (1997) 55–75Spirakis, P.G.,seeJ.H. Reif 54 (1985) 181–191Sprague, A.P., Pasch’s axiom and projective spaces33 (1981) 79–87Springer, C.M.,seeI.P. Goulden 158(1-3) (1996) 77–85Sprott, D.A.,seeS.R. Chamberlin 92 (1991) 39–47Sprugnoli, R., Riordan arrays and combinatorial sums132(1-3) (1994) 267–290Sprugnoli, R.,seeE. Barcucci 139(1-3) (1995) 3–18Sprugnoli, R., Riordan arrays and the Abel–Gould identity142(1-3) (1995) 213–233Sprugnoli, R.,seeC. Corsani 180(1-3) (1998) 107–122Squier, C.C.,seeR.V. Book 49 (1984) 237–240Sridharan, M.R., Mixed self-complementary and self-converse digraphs14 (1976) 373–376Sridharan, M.R. and O.T. George, On the strong perfect graph conjecture and critical graphs (Note) 41 (1982)

101–104Sridharan, M.R.,seeM. Hegde 45 (1983) 239–243Sridharan, M.R.,seeN. Hegde 47 (1983) 109–112Sridharan, M.R. and K. Balaji, Characterisation of self-complementary chordal graphs188 (1-3) (1998) 279–

283Sridharan, S., Biregular subgraphs of biregular graphs (Note) 65 (1987) 213–214Sridharan, S., On the Berge’s strong path partition conjecture (Note) 112(1993) 289–293Sridharan, S., On the strong path partition conjecture of Berge (Communication) 117(1993) 265–270Srinivasan, M.K.,seeU.N. Peled 114(1993) 403–424Srinivasan, N.,seeK.R. Parthasarathy 49 (1984) 151–159Srinivasan, R., On some results of Takács in ballot problems28 (1979) 213–218


Srivastava, H.M., Some generalizations of a combinatorial identity of L. Vietoris (Note) 65 (1987) 99–102Srivastava, J. and S. Arora, An infinite series of resolution III.2 designs for the 2m factorial experiment 98

(1991) 35–56Stacey, A., Universal minimal total dominating functions of trees140(1-3) (1995) 287–290Stacho, L., A sufficient condition guaranteeing large cycles in graphs169(1-3) (1997) 273–277Stachowiak, G., On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains

131(1-3) (1994) 375–378Stachowiak, G., Finding parity difference by involutions163(1-3) (1997) 139–151Stadler, P.F., Random walks and orthogonal functions associated with highly symmetric graphs145(1-3) (1995)

229–237Stahl, S. and A.T. White, Genus embeddings for some complete tripartite graphs14 (1976) 279–296Stahl, S., A duality for permutations71 (1988) 257–271Stahl, S., Region distributions of graph embeddings and Stirling numbers82 (1990) 57–78Stahl, S., Region distributions of some small diameter graphs89 (1991) 281–299Stahl, S., Bounds for the average genus of the vertex-amalgamation of graphs142(1-3) (1995) 235–245Stahl, S.,seeC. Mauk 159(1-3) (1996) 285–290Stahl, S., The multichromatic numbers of some Kneser graphs185(1-3) (1998) 287–291Stallmann, M.F.M., On counting planar embeddings (Note) 122(1993) 385–392Stankova, Z.E., Forbidden subsequences132(1-3) (1994) 291–316Stanley, R.P., A Brylawski decomposition for finite ordered sets4 (1973) 77–82Stanley, R.P., Acyclic orientations of graphs5 (1973) 171–178Stanley, R.P., Factorization of permutations inton-cycles 37 (1981) 255–262Stanley, R.P.,seeW.Y.C. Chen 115(1993) 65–75Stanley, R.P., A combinatorial decomposition of acyclic simplicial complexes120(1993) 175–182Stanley, R.P.,Graph coloringsand relatedsymmetric functions:ideas ansapplications 193 (1-3) (1998) 267–

286Stanton, D.,seeJ.T. Joichi 73 (1989) 261–271Stanton, D. and D. White, Combinatorics of thezAB theorem 83 (1990) 105–114Stanton, R.G., Minimal pairwise balanced designs77 (1989) 317–321Statman, R., Reductions of the graph reconstruction conjecture (Note) 36 (1981) 103–107Staton, W., Induced forests in cubic graphs49 (1984) 175–178Staton, W.,seeG. Hopkins 57 (1985) 245–251Staton, W.,seeP. Erdos 92 (1991) 85–88Staton, W.,seeP. Erdos 141(1-3) (1995) 285–290Staton, W.,seeP. Erdos 158(1-3) (1996) 283–286Steele, J.M., Long unimodal subsequences: A problem of F.R.K. Chung (Note) 33 (1981) 223–225Steenbrink, J.H.M.,seeR.H. Jeurissen 132(1-3) (1994) 83–96Stefan, J. and P. Charles, Une caracterisation des produits d’arbres et des grilles163(1-3) (1997) 201–208Stefanescu, G.,seeV.-E. Cazanescu 90 (1991) 233–265Stefanescu, G.,seeV.-E. Cazanescu 126(1994) 47–65Steffen, E., Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Note) 161

(1-3) (1996) 315Steffen, E.,seeG. Brinkmann 169(1-3) (1997) 193–197Steffen, E., Classifications and characterizations of snarks188(1-3) (1998) 183–203Steffens, K.,seeH. Oellrich 15 (1976) 301–304Steffens, K.,seeF. Galvin 24 (1978) 161–166Steger, A. and M.-l. Yu, On induced matchings (Note) 120(1993) 291–295Steger, A.,seeS. Hougardy 136(1-3) (1994) 175–223Steger, A.,seeH.J. Prömel 154(1-3) (1996) 311–315Steiger, W.,seeJ. Gil 108(1992) 37–51Stein, P., On Chvátal’s conjecture related to a hereditary system43 (1983) 97–105Stein, P., Chvátal’s conjecture and point-intersections (Note) 43 (1983) 321–323Stein, P.R.,seeC.J. Everett 1 (1971) 55–72Stein, P.R.,seeJ. Riordan 5 (1973) 381–388Stein, P.R.,seeC.J. Everett 6 (1973) 29–34


Stein, P.R.,seeC.J. Everett 17 (1977) 27–45Stein, P.R. and C.J. Everett, On a class of linked diagrams II. Asymptotics21 (1978) 309–318Stein, P.R. and M.S. Waterman, On some new sequences generalizing the Catalan and Motzkin numbers26

(1979) 261–272Stein, P.R. and C.J. Everett, On the iteration of a bijective transformation of integerk-tuples 63 (1987) 67–79Stein, S., The notched cube tilesRn (Communication) 80 (1990) 335–337Stein, S.K.,seeE.A. Kasimatis 85 (1990) 281–294Steinberg, L.,seeA. Altshuler 8 (1974) 113–137Steinberg, L.,seeA. Altshuler 16 (1976) 91–108Steinberg, L.,seeA. Altshuler 31 (1980) 115–124Steinberg, R.,seeL.S. Mel’nikov 20 (1977) 203–206Steiner, G., Minimizing bumps in ordered sets by substitution decomposition (Note) 76 (1989) 285–289Steiner, G.,seeJ.S. Deogun 170(1-3) (1997) 99–106Steingrímsson, E.,seeC.-W. Ko 163(1-3) (1997) 293–298Steingrímsson, E., A chromatic partition polynomial180(1-3) (1998) 357–368Stembridge, J.R.,seeK.L. Collins 63 (1987) 15–19Stembridge, J.R., Eulerian numbers, tableaux, and the Betti numbers of a toric variety99 (1992) 307–320Sterboul, F., Un probleme extremal pour les graphes et les hypergraphes11 (1975) 71–78Sterboul, F., A problem on triples17 (1977) 191–198Sterboul, F., Sur le nombre transversal des hypergraphes uniformes (Note) 22 (1978) 91–96Sterboul, F., Smallest 3-graphs having a 3-colored edge in everyk-coloring 27 (1979) 205–210Sterboul, F.,seeJ.-C. Bermond 30 (1980) 295–298Sterboul, F., Letter to the editor66 (1987) 319–320Stern, M., Semimodularity in lattices of finite length41 (1982) 287–293Stern, M., Strongness in semimodular lattices82 (1990) 79–88Stern, M., Dually atomistic lattices (Note) 93 (1991) 97–100Stern, M., On the covering graph of balanced lattices156(1-3) (1996) 311–316Stevenson, R.A., Dilworth truncations andk-induced matroids 105(1992) 199–205Stewart, D.,seeM.E.H. Ismail 41 (1982) 155–160Stewart, I.A., Deciding whether a planar graph has a cubic subgraph is NP-complete126(1994) 349–357Stewart, I.A., On locating cubic subgraphs in bounded-degree connected bipartite graphs163(1-3) (1997) 319–

324Stewart, L.K.,seeD.G. Corneil 86 (1990) 145–164Stewart, L.K.,seeC.J. Colbourn 86 (1990) 179–189Stewart, L.K.,seeR.S. Sankaranarayana161(1-3) (1996) 243–263Stiebitz, M.,K5 is the only double-critical 5-chromatic graph (Communication) 64 (1987) 91–93Stiebitz, M.,seeH. Sachs 74 (1989) 201–226Stiebitz, M.,seeH. Fleischner 101(1992) 39–48Stiebitz, M., On Hadwiger’s number—A problem of the Nordhaus–Gaddum type101(1992) 307–317Stiebitz, M., The forest plus stars colouring problem (Communication) 126(1994) 385–389Stiebitz, M.,seeA.V. Kostochka 162(1-3) (1996) 299–303Stiebitz, M.,seeT. Böhme 170(1-3) (1997) 219–222Stiebitz, M.,seeA.V. Kostochka 191(1-3) (1998) 125–137Stiffler, J.J. and I.F. Blake, An infinite class of generalized room squares12 (1975) 159–163Stiffler, J.J.,seeI.F. Blake 21 (1978) 89–93Stinson, D.B., A general construction for group-divisible designs33 (1981) 89–94Stinson, D.R., A skew room square of order 129 (Communication) 31 (1980) 333–335Stinson, D.R.,seeJ.H. Dinitz 44 (1983) 145–154Stinson, D.R.,seeP. Erdös 47 (1983) 49–62Stinson, D.R. and W.D. Wallis, Two-fold triple systems without repeated blocks (Note) 47 (1983) 125–128Stinson, D.R.,seeJ.H. Dinitz 47 (1983) 221–228Stinson, D.R.,seeC.C. Lindner 52 (1984) 67–74Stinson, D.R. and L. Zhu, On sets of three mols with holes54 (1985) 321–328Stinson, D.R. and S.A. Vanstone, A Kirkman square of order 51 and block size 3 (Note) 55 (1985) 107–111Stinson, D.R., Concerning the spectrum of perpendicular arrays of triple systems61 (1986) 305–310


Stinson, D.R., Frames for Kirkman triple systems65 (1987) 289–300Stinson, D.R.,seeE. Seah 70 (1988) 199–202Stinson, D.R.,seeC.C. Lindner 77 (1989) 191–203Stinson, D.R.,seeK. Phelps 77 (1989) 255–258Stinson, D.R.,seeR. Rees 77 (1989) 259–279Stinson, D.R.,seeC.C. Lindner 80 (1990) 273–280Stinson, D.R.,seeR. Rees 83 (1990) 81–93Stinson, D.R.,seeR.C. Mullin 84 (1990) 47–62Stinson, D.R.,seeW.L. Kocay 85 (1985) 45–60Stinson, D.R., A survey of Kirkman triple systems and related designs92 (1991) 371–393Stinson, D.R., Designs constructed from maximal arcs97 (1991) 387–393Stinson, D.R. and Y.J. Wei, Some results on quadrilaterals in Steiner triple systems105(1992) 207–219Stinson, D.R.,seeD. Chen 110(1992) 35–42Stockmeyer, P.,seeB. Manvel 94 (1991) 209–219Stöhr, E., The pagewidth of trivalent planar graphs89 (1991) 43–49Stojakovic, Z. and W.A. Dudek, Single identities for varieties equivalent to quadruple systems183(1-3) (1998)

277–284Stolarsky, K.B.,seeA.M. Odlyzko 57 (1985) 89–97Stolarsky, K.B.,seeA.S. Fraenkel 135(1-3) (1994) 93–101Stone, A.H.,seeR.L. Brooks 100(1992) 291–301Stone, M.G., A note on “Automorphism groups of partial orders” (Note) 22 (1978) 313–314Stone, M.G. and R.H. Weedmark, On representingMn ’s by congruence lattices of finite algebras44 (1983)

299–308Stonesifer, J.R., Modularly complemented geometric lattices32 (1980) 85–88Stong, R., On Hamiltonian cycles in Cayley graphs of wreath products65 (1987) 75–80Stong, R., Hamilton decompositions of cartesian products of graphs90 (1991) 169–190Stong, R., Permutations of the positive integers with specified differences176(1-3) (1997) 223–231Stong, R.E., Group actions on finite spaces49 (1984) 95–100Storme, L. and J.A. Thas, Completek-arcs in PG(n, q), q even 106/107(1992) 455–469Storme, L. and J.A. Thas,k-Arcs and dualk-arcs 125(1994) 357–370Stötzer, F.,seeM. Clausen 45 (1983) 133–135Strahringer, S., Dimensionality of ordinal structures144(1-3) (1995) 97–117Straight, H.J.,seeL. Beineke 31 (1980) 153–159Straight, H.J.,seeJ.F. Fink 33 (1981) 95–98Straubing, H., A combinatorial proof of the Cayley-Hamilton theorem43 (1983) 273–279Straubing, H., Applications of the theory of automata in enumeration64 (1987) 269–279Straus, E.G.,seeP. Erdös 40 (1982) 45–52Street, D.J., Combinatorial problems in repeated measurements designs77 (1989) 323–343Strehl, V., A note of similarity relations (Note) 19 (1977) 99–101Strehl, V., Alternating permutations and modified Ghandi-polynomials28 (1979) 89–100Strehl, V.,seeP. Leroux 57 (1985) 167–187Strehl, V., Combinatorics of Jacobi-configurations III: The Srivastava–Singhal generating function revisited73

(1988/89) 221–232Strehl, V., Identities of Rothe–Abel–Schläfli–Hurwitz-type99 (1992) 321–340Strehl, V., Binomial identities — combinatorial and algorithmic aspects136(1-3) (1994) 309–346Strintzis, M.G.,seeI. Pitas 56 (1985) 245–253Ströhlein, T.,seeG. Schmidt 54 (1985) 83–92Ströhlein, Th. and L. Zagler, Analyzing games by Boolean matrix iteration19 (1977) 183–193Strommer, T.,seeG. Purdy 28 (1979) 331–334Strommer, T.O., The number of lines determined by a polygon25 (1979) 75–84Stroppel, M., Stable planes129(1-3) (1994) 181–189Strube, R.F.E.,seeW. Holsztynski 22 (1978) 263–272Stueckle, S., Chromatic automorphisms and symmetries of some graphs80 (1990) 175–181Stueckle, S.,seeR. Laskar 122(1993) 245–253Stueckle, S.,seeL. Wang 128(1-3) (1994) 361–369


Stueckle, S.K.,seeB.L. Piazza 127(1-3) (1994) 265–276Stumbo, F.,seeM. Salvetti 163(1-3) (1997) 129–138Sturmfels, B., Central and parallel projections of polytopes (Communication) 62 (1986) 315–318Sturtevant, D.G.,seeR.A. Proctor 30 (1980) 173–180Sturtevant, D.G.,seeA.R. Calderbank 50 (1984) 15–28Su, J., On locallyk-critically n-connected graphs120(1993) 183–190Su, X.-Y., A result on decompositions of regular graphs (Note) 105(1992) 323–326Su, X.-Y., On complete subgraphs of color-critical graphs143(1-3) (1995) 243–249Su, X.-Y., Some generalizations of Menger’s theorem concerning arc-connected digraphs175(1-3) (1997) 293–

296Sudakov, B.,seeG. Gutin 191(1-3) (1998) 101–107Suen, W.C.S., On the largest strong components inm-out digraphs 94 (1991) 45–52Suffel, C.,seeL. Petingi 179(1-3) (1998) 155–166Suffel, C.L.,seeD. Bauer 47 (1983) 153–161Sulanke, R.A., A determinant forq-countingn-dimensional lattice paths81 (1990) 91–96Sulanke, R.A.,seeC. Krattenthaler 153(1-3) (1996) 189–198Sulanke, R.A., Catalan path statistics having the Narayana distribution180(1-3) (1998) 369–389Sumner, D.P., Point determination in graphs5 (1973) 179–187Sumner, D.P., Graphs indecomposable with respect to theX-join 6 (1973) 281–298Sumner, D.P., The nucleus of a point determining graph14 (1976) 91–97Sumner, D.P., The connected Ramsey number22 (1978) 49–55Sumner, D.P., Critical concepts in domination86 (1990) 33–46Sun, H.,seeG. Hahn 44 (1983) 281–284Sun, L., On a problem of J. Csima (Note) 87 (1991) 217–218Sun, S.R.,seeC.C. Lindner 32 (1980) 271–280Sun, S.X. and C. Payan, Sur l’immersion gracieuse deKN dansQn (Communication) 102(1992) 79–83Sun, X.-H., On Rota’s problem of the explicit representation for umbral operators (Note) 120(1993) 297–300Sun, Z.,seeH. Li 183(1-3) (1998) 223–236Sun, Z.-H., Congruences for Bernoulli numbers and Bernoulli polynomials163(1-3) (1997) 153–163Sun, Z.-W., On disjoint residue classes (Note) 104(1992) 321–326Sundaram, R.,seeM. Klugerman 186(1-3) (1998) 289–293Sung, T.-Y.,seeM. Padberg 165-166(1-3) (1997) 531–545Surányi, L., On a generalization of linecritical graphs30 (1980) 277–287Sureau, Y., On structure of cogroups155(1-3) (1996) 243–246Suseela, J.S.,seeS. Arumugam 190(1-3) (1998) 67–77Sutinuntopas, S.,seeN. Brand 120(1993) 25–35Sutton, M., M. Miller, J. Ryan and . Slamin, Connected graphs which are not mod sum graphs195(1-3) (1999)

287–293Sved, M., The geometry of the binomial array modulop2 andp3 92 (1991) 395–416Svrtan, D.,seeS. Feretic 157(1-3) (1996) 147–168Swanepoel, C.J. and L.M. Pretorius, Factor-complement partitions of ascendingk-parameter words 167-168

(1-3) (1997) 583–592Swanepoel, C.J.,seeW.L. Fouché 197-198(1-3) (1999) 331–350Swanepoel, K.J., Cardinalities ofk-distance sets in Minkowski spaces197-198(1-3) (1999) 759–767Swart, H.C.,seeM.A. Henning 120(1993) 93–105Swart, H.C.,seeD.P. Day 127(1-3) (1994) 95–104Swart, H.C.,seeW. Goddard 132(1-3) (1994) 65–73Swart, H.C.,seeW. Goddard 161(1-3) (1996) 121–132Swart, H.C.,seeM.A. Henning 161(1-3) (1996) 161–173Swart, H.C.,seeM.A. Henning 161(1-3) (1996) 175–184Swart, H.C.,seeW. Goddard 167-168(1-3) (1997) 329–339Swart, H.C.,seeD.P. Day 197-198(1-3) (1999) 217–223Swarup, K.,seeM.J.L. Kirby 5 (1973) 345–365Swiercz, S.,seeC.W.H. Lam 45 (1983) 319–321Sysło, M.M., Characterizations of outerplanar graphs26 (1979) 47–53


Sysło, M.M., The Helly-type property of non-trivial intervals on a tree (Note) 37 (1981) 297–298Sysło, M.M., Triangulated edge intersection graphs of paths in a tree55 (1985) 217–220Sysło, M.M., Minimizing the jump number for partially-ordered sets: A graph-theoretic approach, II63 (1987)

279–295Sysło, M.M., An algorithm for solving the jump number problem72 (1988) 337–346Sysło, M.M., Sequential coloring versus Welsh–Powell bound74 (1989) 241–243Sysło, M.M.,seeM. Skowronska 86 (1990) 215–224Sysło, M.M., The jump number problem on interval orders: A 3/2 approximation algorithm144 (1-3) (1995)

119–130Sysło, M.M.,seeL.T.Q. Hung 189(1-3) (1998) 163–176Szabó, P.,seeK. Cechlárová 81 (1990) 123–128Szabó, S., On the problem of regularity of a type ofn-dimensional tilings (Note) 45 (1983) 313–317Szabó, S., A type of factorization of finite abelian groups (Note) 54 (1985) 121–124Szabó, S.,seeK. Corrádi 85 (1990) 319–321Szabó, T., On nearly regular co-critical graphs160(1-3) (1996) 279–281Szabó, T.,seeB. Bollobás 186(1-3) (1998) 55–67Szántó, Á.,seeG. Ivanyos 153(1-3) (1996) 177–188Székely, L.A. and N.C. Wormald, Bounds on the measurable chromatic number ofRn 75 (1989) 343–372Székely, L.A., L.H. Clark and R.C. Entringer, An inequality for degree sequences103(1992) 293–300Székely, L.A.,seeC.A. Barefoot 125(1994) 15–30Székely, L.A.,seeC.A. Barefoot 150(1-3) (1996) 31–48Szekeres, E.,seeP. Erdos 200(1-3) (1999) 137–147Szelecka, A.,seeM. Kwasnik 164(1-3) (1997) 213–220Szemerédi, E.,seeB. Bollobás 13 (1975) 97–107Szemeredi, E.,seeA. Gyárfás 30 (1980) 235–244Szemerédi, E.,seeJ. Komlós 43 (1983) 55–63Szendrei, Á.,seeJ.D. Berman 112(1993) 1–20Szentmiklóssy, Z.,seeJ. Gerlits 108(1992) 31–35Szigeti, J.,seeG. Révész 147(1-3) (1995) 313–319Sziklai, P., Nuclei of pointsets in PG(n,q) 174(1-3) (1997) 323–327Szönyi, T., Note on the order of magnitude ofk for completek-arcs in PG(2, q) 66 (1987) 279–282Szönyi, T.,seeJ.W.P. Hirschfeld 97 (1991) 229–242Szönyi, T.,seeA. Blokhuis 106/107(1992) 61–65Szonyi, T.,seeA. Blokhuis 131(1-3) (1994) 339–343Szüsz, P., On a theorem of Fraenkel, Levitt and Shimshoni (Note) 56 (1985) 75–77Szwarcfiter, J.L., On edge transitivity of directed graphs141(1-3) (1995) 227–235Szwarcfiter, J.L.,seeC.L. Lucchesi 183(1-3) (1998) 247–254Szymczak, T.,seeA. Brandstädt 177(1-3) (1997) 9–16Tabourier, Y., All shortest distances in a graph. An improvement to Dantzig’s inductive algorithm4 (1973)

83–87Tachibana, S.-i.,seeC. Nara 45 (1983) 323–326Tachibana, S.-i.,seeB. Bollobás 62 (1986) 271–275Taft, E.J., Hadamard invertibility of linearly recursive sequences in several variables139(1-3) (1995) 393–397Taibleson, M.H.,seeM.A. Picardello 109(1992) 193–202Tainiter, M., Statistical theory of conjectivity I: Basic definitions and properties13 (1975) 391–398Takács, L., On the “problème des ménages”36 (1981) 289–297Takács, L., Counting forests (Note) 84 (1990) 323–326Takahashi, A., S. Ueno and Y. Kajitani, Minimal acyclic forbidden minors for the family of graphs with bounded

path-width 127(1-3) (1994) 293–304Tallini, G., Asymptotic questions in Galois geometries129(1-3) (1994) 191–203Tamari, F., On linear codes which attain the Solomon–Stiffler bound49 (1984) 179–191Tamari, F., A construction of some[n, k, d;q]-codes meeting the Griesmer bound116(1993) 269–287Tamura, S.,seeS. Tazawa 90 (1991) 63–74Tan, B.P.,seeK.M. Koh 147(1-3) (1995) 171–183Tan, B.P.,seeK.M. Koh 149(1-3) (1996) 131–139


Tan, B.P.,seeK.M. Koh 154(1-3) (1996) 281–287Tan, B.P.,seeK.M. Koh 167-168(1-3) (1997) 411–418Tan, B.P.,seeK.M. Koh 173(1-3) (1997) 297–298Tan, E.L., Some notes on cycles graphs105(1992) 221–226Tan, L., Signs in the Laplace expansions and the parity of the distinguished representatives131 (1-3) (1994)

287–299Tan, N.D., On the isomorphism problem for a family of cubic metacirculant graphs151(1-3) (1996) 231–242Tan, N.D., Cubic (m,n)-metacirculant graphs which are not Cayley graphs154(1-3) (1996) 237–244Tan, S.-t.,seeA. Baartmans 30 (1980) 69–81Tan, S.T.,seeL.A. Carmony 34 (1981) 17–24Tan, T.,seeK.M. Koh 25 (1979) 141–148Tan, T.,seeK.M. Koh 31 (1980) 279–292Tandareanu, N., On generalized Boolean functions I34 (1981) 293–299Tandareanu, N., On generalized Boolean functions II40 (1982) 277–284Tandareanu, N., On generalized Boolean functions III. The caseA= 0,1 52 (1984) 269–277Tang, X. and A. Ben-Israel, Two consequences of Minkowski’s 2n theorem 169(1-3) (1997) 279–282Tanny, S.M. and M. Zuker, On a unimodal sequence of binomial coefficients9 (1974) 79–89Tanny, S.M., Generating functions and generalized alternating subsets13 (1975) 55–65Tanny, S.M. and M. Zuker, Analytic methods applied to a sequence of binomial coefficients24 (1978) 299–310Tanny, S.M.,seeJ.W. Reilly 32 (1980) 69–76Tanny, S.M., A well-behaved cousin of the Hofstadter sequence105(1992) 227–239Tao, P.D. and E.B. Souad, Iterative behaviour, fixed point of a class of monotone operators. Application to non-

symmetric threshold function 70 (1988) 85–101Tappe, J.,seeA. Kerber 15 (1976) 151–161Tardif, C., Prefibers and the cartesian product of metric spaces109(1992) 283–288Tardif, C., A fixed box theorem for the cartesian product of graphs and metric spaces171(1-3) (1997) 237–248Tardif, C., Graph products and the chromatic difference sequence of vertex-transitive graphs185 (1-3) (1998)

193–200Tardos, É.,seeC.A.J. Hurkens 73 (1988/89) 99–109Tarjan, R.E.,seeG. Markowsky 16 (1976) 329–337Tarjan, R.E., Decomposition by clique separators55 (1985) 221–232Tarnanen, H., On character sums and codes57 (1985) 285–295Tarsi, M., Decomposition of complete multigraphs into stars26 (1979) 273–278Tarsi, M., On the decomposition of a graph into stars36 (1981) 299–304Tarski, A., An interpolation theorem for irredundant bases of closure structures12 (1975) 185–192Taubenfeld, G.,seeR. Michel 146(1-3) (1995) 313–320Tay, E.G.,seeK.M. Koh 190(1-3) (1998) 115–136Taylor, H., A distinct distance set of 9 nodes in a tree of diameter 3693 (1991) 167–168Taylor, H., Florentine rows or left-right shifted permutation matrices with cross-correlation values6 1 93

(1991) 247–260Taylor, R., Reconstructing degree sequences fromk-vertex-deleted subgraphs79 (1989/90) 207–213Taylor, W., On the coloration of cubes2 (1972) 187–190Taylor, W.,seeG. McNulty 12 (1975) 193–200Tazawa, S., T. Shirakura and S. Tamura, Enumeration of digraphs with given number of vertices of odd out-degree

and vertices of odd in-degree90 (1991) 63–74Tazawa, S., C. Nara and J.W. Moon, The number of 4-cycles in triangle-free oriented graphs143 (1-3) (1995)

287–291Tazawa, S.,seeC. Nara 183(1-3) (1998) 255–264Tchuente, M.,seeD. Naddef 31 (1980) 107–109Tchuente, M., Parallel realization of permutations over trees39 (1982) 211–214Tchuente, M.,seeC. Payan 49 (1984) 267–273Teh, H.H. and M.F. Foo, Large scale network analysis with applications to transportation, communication and

inference networks 72 (1988) 347–353Teirlinck, L., On the maximum number of disjoint Steiner triple systems (Note) 6 (1973) 299–300Teirlinck, L., The existence of reverse Steiner triple systems (Note) 6 (1973) 301–302


Teirlinck, L., A simplification of the proof of the existence of reverse Steiner triple systems of order congruent to1 modulo 24 (Note) 13 (1975) 297–298

Teirlinck, L., Non-trivial t-designs without repeated blocks exist for allt 65 (1987) 301–311Teirlinck, L., Locally trivial t-designs andt-designs without repeated blocks77 (1989) 345–356Telcs, A.,seeD. Miklós 150(1-3) (1996) 437–440Tenenbaum, G.,seeP. Erdos 200(1-3) (1999) 181–203Teng, A. and A. Tucker, An O(qn) algorithm toq-color a proper family of circular arcs55 (1985) 233–243Ten Pas, P.,seeA. Ehrenfeucht 190(1-3) (1998) 259–264Teo, C.P.,seeK.M. Koh 96 (1991) 65–69Teo, C.P. and K.M. Koh, On chromatic uniqueness of uniform subdivisions of graphs128(1-3) (1994) 327–335Teo, C.P.,seeK.M. Koh 154(1-3) (1996) 289–295Teo, K.,seeH. Wang 160(1-3) (1996) 283–289Teo, K.L.,seeK.M. Koh 127(1-3) (1994) 243–258Teo, K.L.,seeC.C. Chen 172(1-3) (1997) 1Teo, K.L.,seeK.M. Koh 172(1-3) (1997) 59–78Teo, K.L.,seeY.-H. Peng 172(1-3) (1997) 103–114Tepavcevic, A., seeB. Šešelja 186(1-3) (1998) 269–275Terai, N. and T. Hibi, Some results on Betti numbers of Stanley–Reisner rings157(1-3) (1996) 311–320Termini, S.,seeA. de Luca 27 (1979) 297–308Terwilliger, P., Eigenvalue multiplicities of highly symmetric graphs41 (1982) 295–302Terwilliger, P., The Johnson graphJ(d, r) is unique if(d, r) 6= (2,8) 58 (1986) 175–189Terwilliger, P., A new feasibility condition for distance-regular graphs61 (1986) 311–315Terwilliger, P., A new inequality for distance-regular graphs137(1-3) (1995) 319–332Terwilliger, P.,seeK. Ding 149(1-3) (1996) 59–68Teschner, U., A counterexample to a conjecture on the bondage number of a graph (Note) 122(1993) 393–395Teschner, U., New results about the bondage number of a graph171(1-3) (1997) 249–259Tewes, M. and L. Volkmann, Vertex deletion and cycles in multipartite tournaments197-198(1-3) (1999) 769–

779Thas, J.A., Partial three-spaces in finite projective spaces32 (1980) 299–322Thas, J.A., I. Debroey and F. De Clerck, The embedding of(0, α)-geometries in PG(n, q): Part II 51 (1984)

283–292Thas, J.A.,seeL. Storme 106/107(1992) 455–469Thas, J.A.,seeL. Storme 125(1994) 357–370Thas, J.A., Symplectic spreads in PG(3,q), inversive planes and projective planes174(1-3) (1997) 329–336Thatte, B.D., Some results and approaches for reconstruction conjectures124(1994) 193–216Thatte, B.D., On a reconstruction problem137(1-3) (1995) 387–388Thatte, B.D., A reconstruction problem related to balance equations176(1-3) (1997) 279–284Thatte, B.D., A reconstruction problem related to balance equations II: The general case194(1-3) (1999) 281–

284Thayse, A., Difference operators and extended truth vectors for discrete functions14 (1976) 171–202Theron, W.F.D. and G. Geldenhuys, Domination by queens on a square beehive178(1-3) (1998) 213–220Thibon, J.Y.,seeG. Duchamp 76 (1989) 123–129Thibon, J.-Y.,seeB. Leclerc 180(1-3) (1998) 1Thiel, L., seeC.W.H. Lam 45 (1983) 319–321Thiel, L., seeC.W.H. Lam 92 (1991) 187–195Thierrin, G.,seeH.J. Shyr 126(1994) 339–348Thimonier, L.,seeP. Dumas 139(1-3) (1995) 143–154Thiong-Ly, J.A.,seeA. Poli 56 (1985) 265–273Thomas, G.P., On a construction of Schützenberger17 (1977) 107–118Thomas, R.,seeI. Kríž 81 (1990) 177–185Thomas, R.,seeI. Kríž 95 (1991) 135–167Thomas, R.,seeN. Robertson 95 (1991) 303–319Thomas, R.,seeP. Seymour 95 (1991) 321–330Thomas, R.,seeJ. Matoušek 108(1992) 343–364Thomason, A.,seeB. Bollobás 25 (1979) 21–26


Thomason, A., Critically partitionable graphs II41 (1982) 67–77Thomason, A.,seeJ. Haviland 75 (1989) 255–278Thomason, A., A simple linear expected time algorithm for finding a hamilton path75 (1989) 373–379Thomason, A., Dense expanders and pseudo-random bipartite graphs75 (1989) 381–386Thomason, A.,seeJ. Haviland 103(1992) 321–327Thomason, A.G.,seeE.J. Cockayne 33 (1981) 249–258Thomassen, C., Hypohamiltonian and hypotraceable graphs9 (1974) 91–96Thomassen, C., On hypohamiltonian graphs10 (1974) 383–390Thomassen, C., Planar and infinite hypohamiltonian and hypotraceable graphs14 (1976) 377–389Thomassen, C., An Ore-type condition implying a digraph to be pancyclic19 (1977) 85–92Thomassen, C.,seeJ.A. Bondy 19 (1977) 195–197Thomassen, C., Counterexamples to the edge reconstruction conjecture for infinite graphs (Note) 19 (1977)

293–295Thomassen, C., On separating cycles in graphs22 (1978) 57–73Thomassen, C., Reconstructibility versus edge reconstructibility of infinite graphs (Note) 24 (1978) 231–233Thomassen, C., On the number of Hamiltonian cycles in tournaments31 (1980) 315–323Thomassen, C.,seeR. Häggkvist 41 (1982) 29–34Thomassen, C., The 2-linkage problem for acyclic digraphs55 (1985) 73–87Thomassen, C.,seeG. Hahn 62 (1986) 29–33Thomassen, C., Arc reversals in tournaments71 (1988) 73–86Thomassen, C.,seeV. Petrovic 98 (1991) 237–238Thomassen, C., Embeddings of graphs124(1994) 217–228Thompson, J.G.,seeF.J. MacWilliams 3 (1972) 153–162Thornton, M.C., Regular elements in sandwich semigroups of binary relations41 (1982) 303–307Thuillier, H., seeJ.-L. Fouquet 80 (1990) 41–57Thuillier, H., seeJ.L. Fouquet 114(1993) 181–198Thuillier, H., seeJ.-L. Fzouquet 146(1-3) (1995) 33–44Thuillier, H., seeJ.-L. Fouquet 165-166(1-3) (1997) 291–302Thuillier, H., seeV. Giakoumakis 165-166(1-3) (1997) 311–332Thumser, W.,seeH.J. Prömel 95 (1991) 341–358Thurber, E.G., Addition chains and solutions ofl(2n)= l(n) andl(2n − 1)= n+ l(n)− 1 16 (1976) 279–289Thurber, E.G., Addition chains — an erratic sequence122(1993) 287–305Tian, F.,seeY.-j. Zhu 87 (1991) 197–214Tian, F. and W. Zang, The maximum number of diagonals of a cycle in a block and its extremal graphs89

(1991) 51–63Tian, F.,seeR. Shen 141(1-3) (1995) 213–225Tian, F.,seeJ. Li 161(1-3) (1996) 185–196Tian, F.,seeH. Lia 165-166(1-3) (1997) 459–469Tian, F.,seeH. Broersma 171(1-3) (1997) 43–54Tian, F.,seeR. Shen 177(1-3) (1997) 287–294Tian, F.,seeM. Shi 189(1-3) (1998) 221–232Tichy, R.F.,seeP.J. Grabner 154(1-3) (1996) 53–62Tiersma, H.J., A note on Hamming spheres (Communication) 54 (1985) 225–228Tietäväinen, A., Nonexistence of nontrivial perfect codes in caseq = pr1ps2, e > 3∗ 17 (1977) 199–205Tietäväinen, A., On the cardinality of sets of sequences with given maximum correlation106/107(1992) 471–

477Tijdeman, R., The chairman assignment problem32 (1980) 323–330Tijdeman, R.,seeA.E. Brouwer 34 (1981) 241–260Tijssen, G.,seeR. van Dal 159(1-3) (1996) 69–81Tillich, J.P.,seeC. Delorme 165-166(1-3) (1997) 161–184Tillich, J.-P.,seeP. Solé 192(1-3) (1998) 333–336Tindell, R.,seeD. Bauer 41 (1982) 1–6Tindell, R.,seeA. Satyanarayana 67 (1987) 57–79Ting, S.-T. and S.-Y. Zhoa, The general Steiner problem in Boolean space and application90 (1991) 75–84Ting, S.-T. and S.-Y. Zhao, The general Steiner problem in rectangular crisscross space123(1993) 117–120


Ting, S.-T. and S.-y. Zhao, The geometry of Boolean space and its elementary figures 1132(1-3) (1994) 317–332

Tipnis, S.K. and L.E. Trotter Jr., A generalization of Robacker’s theorem74 (1989) 245–252Tipnis, S.K.,seeM.J. Plantholt 82 (1990) 197–207Tipnis, S.K.,seeM.J. Plantholt 177(1-3) (1997) 185–193Tiwari, P.,seeB. Reznick 57 (1985) 189–193Tkác, M., seeS. Jendrol 48 (1984) 229–241Tkác, M., seeS. Jendrol 84 (1990) 143–160Tkác, M., Shortness coefficients of simple 3-polytopal graphs with edges of only two types (Note) 103 (1992)

103–110Tkác, M., On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles

128(1-3) (1994) 407–413Tkác, M., seeS. Jendrol 145(1-3) (1995) 301–305Tkác, M., seeJ. Harant 150(1-3) (1996) 143–153Tkác, M., seeS. Jendrol 150(1-3) (1996) 179–186Tkác, M., On the shortness exponent of 1-tough, maximal planar graphs154(1-3) (1996) 321–328Tkác, M., seeP. Smutný 191(1-3) (1998) 197–206Toader, Gh., On Chebyshev’s inequality for sequences161(1-3) (1996) 317–322Todd, M.J., Characterizing binary simplicial matroids16 (1976) 61–70Todorcevic, S., Countable chain condition in partition calculus188(1-3) (1998) 205–223Toft, B., On critical subgraphs of colour-critical graphs7 (1974) 377–392Toft, B., seeJ. Lützen 100(1992) 9–82Toft, B., seeM. Christiansen 100(1992) 83–97Toft, B., seeJ. Bang-Jensen 101(1992) 351–360Togni, O., Irregularity strength of the toroidal grid165-166(1-3) (1997) 599–610Togni, O.,seeD. Amar 190(1-3) (1998) 15–38Tokunaga, S.,seeJ. Akiyama 75 (1989) 7–9Tokunaga, S.-i., On a straight-line embedding problem of graphs150(1-3) (1996) 371–379Tokushige, N.,seeH. Enomoto 104(1992) 159–166Tolhuizen, L.M.G.M. and C.P.M.J. Baggen, On the weight enumerator of product codes106/107(1992) 483–

488Tolle, J.W.,seeF.J. Gould 7 (1974) 225–271Tomasta, P., “Dart calculus” of induced subsets34 (1981) 195–198Tomescu, I., Le nombre maximal de 3-colorations d’un graphe connexe1 (1972) 351–356Tomescu, I., La reduction minimale d’un graphe a une reunion de cliques10 (1974) 173–179Tomescu, I., Le nombre maximal de colorations d’un graphe hamiltonien16 (1976) 353–359Tomescu, I., Le nombre minimal de colorations d’un hypergraphek-chromatique 25 (1979) 179–188Tomescu, I.,seeF. Harary 39 (1982) 123–127Tomescu, I., Graphical Eulerian numbers and chromatic generating functions (Note) 66 (1987) 315–318Tomescu, I., Almost all dugraphs have a kernel84 (1990) 181–192Tomescu, I., Orderedh-hypertrees 105(1992) 241–248Tomescu, I., On the number of irreducible coverings by edges of complete bipartite graphs150 (1-3) (1996)

453–456Tomescu, I., An asymptotic formula for the number of graphs having small diameter156(1-3) (1996) 219–228Tomescu, I., On the number of trees havingk edges in common with a graph of bounded degrees169 (1-3)

(1997) 283–286Tomescu, I., Maximum chromatic polynomial of 3-chromatic blocks172(1-3) (1997) 131–139Tomescu, J., Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques

complets 37 (1981) 263–277Tonchev, V.D., The isomorphism of the Cohen, Haemers–van Lint and De Clerck–Dye–Thas partial geometries

(Communication) 49 (1984) 213–217Tonchev, V.D., Transitive Steiner triple systems of order 25 (Note) 67 (1987) 211–214Tonchev, V.D.,seeF.C. Bussemaker 76 (1989) 45–49Tonchev, V.D.,seeI. Landgev 77 (1989) 177–189Tonchev, V.D.,seeF.C. Bussemaker 82 (1990) 317–321


Tonchev, V.D.,seeS.N. Kapralov 83 (1990) 285–289Tonchev, V.D.,seeZ. Janko 97 (1991) 265–268Tonchev, V.D., Some small non-embeddable designs106/107(1992) 489–492Tonchev, V.D. and S.A. Vanstone, On Kirkman triple systems of order 33106/107(1992) 493–496Tonchev, V.D.,seeE. Spence 110(1992) 265–268Tonchev, V.D., The uniformly packed binary [27,21,3] and [35,29,3] codes149(1-3) (1996) 283–287Tong, P.,seeM.-K. Siu 31 (1980) 97–100Tönges, U.,seeJ. Koolen 192(1-3) (1998) 205–222Topp, J. and L. Volkmann, On graphs with equal domination and independent domination numbers (Note) 96

(1991) 75–80Topp, J. and L. Volkmann, On packing and covering numbers of graphs96 (1991) 229–238Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic

number of a graph (Note) 118(1993) 289–292Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets

of vertices 121(1993) 199–210Topp, J.,seeW. Siemes 131(1-3) (1994) 279–285Topp, J. and P.D. Vestergaard, On numbers of vertices of maximum degree in the spanning trees of a graph155

(1-3) (1996) 247–258Topp, J. and P.D. Vestergaard, Totally equimatchable graphs164(1-3) (1997) 285–290Topp, J. and P. Dahl Vestergaard, Interpolation theorems for domination numbers of a graph191 (1-3) (1998)

207–221Torgašev, A., On graphs with a fixed number of negative eigenvalues (Note) 57 (1985) 311–317Torriani, H.H., Constructive implicit function theorems76 (1989) 247–269Tort, J.R., Un probleme de partition de l’ensemble des parties a trois elements d’un ensemble fini44 (1983)

181–185Tošic, R., Two counterfeit coins 46 (1983) 295–298Tóth, G.,seeM. Bóna 150(1-3) (1996) 61–67Tóth, L.F., Packing of ellipses with continuously distributed area60 (1986) 263–267Totten, J., Basic properties of restricted linear spaces13 (1975) 67–74Totten, J., On the degree of points and lines in a restricted linear space14 (1976) 391–394Totten, J., Parallelism in a restricted linear space14 (1976) 395–398Tozzi, A.,seeA. Fedeli 108(1992) 13–23Traldi, L., seeG. Gordon 85 (1990) 167–176Traldi, L., Generalized activities andK-terminal reliability 96 (1991) 131–149Traldi, L., Generalized activities andK-terminal reliability. II 135(1-3) (1994) 381–385Trapp, G.,seeW. Simons 10 (1974) 163–166Trehel, M., Graphes des complements et classes de branches dans un ensemble ordonne fini resultant d’un produit

contracte 3 (1972) 373–379Treml, M., Some partitions of positive integers199(1-3) (1999) 267–271Trenk, A.,seeC.M. Fiduccia 181(1-3) (1998) 113–138Trenk, A.N.,seeK.P. Bogart 132(1-3) (1994) 11–22Trenk, A.N.,seeK.P. Bogart 145(1-3) (1995) 347Trenk, A.N., Onk-weak orders: Recognition and a tolerance result181(1-3) (1998) 223–237Treybig, B.,seeI. Borosh 58 (1986) 215–220Triesch, E.,seeI. Althöfer 115(1993) 1–9Triesch, E., A probabilistic upper bound for the edge identification complexity of graphs125(1994) 371–376Triesch, E.,seeM. Aigner 136(1-3) (1994) 3–20Triesch, E.,seeM. Aigner 144(1-3) (1995) 3–10Trnková, V., Endomorphisms of undirected modifications of directed graphs108(1992) 203–209Trommel, H.,seeH.J. Broersma 185(1-3) (1998) 231–238Trommel, H., H.J. Veldman and A. Verschut, Pancyclicity of claw-free hamiltonian graphs197-198(1-3) (1999)

781–789Trotter, W.T.,seeH.A. Kierstead 63 (1987) 217–223Trotter, W.T.,seeV. Rödl 67 (1987) 307–309Trotter, W.T.,seeL. Lovász 75 (1989) 319–325


Trotter, W.T.,seeF.R.K. Chung 81 (1990) 129–135Trotter, W.T.,seeH.A. Kierstead 101(1992) 165–169Trotter, W.T.,seeP.C. Fishburn 103(1992) 25–40Trotter, W.T.,seeJ.H. Schmerl 113(1993) 191–205Trotter, W.T.,seeS. Felsner 136(1-3) (1994) 101–117Trotter, W.T.,seeS. Felsner 144(1-3) (1995) 23–31Trotter, W.T.,seeP.C. Fishburn 195(1-3) (1999) 111–126Trotter Jr., L.E., A class of facet producing graphs for vertex packing polyhedra12 (1975) 373–388Trotter Jr., L.E.,seeR.G. Bland 27 (1979) 11–22Trotter Jr., L.E.,seeS.K. Tipnis 74 (1989) 245–252Trotter Jr., L.E.,seeE.C. Sewell 147(1-3) (1995) 247–255Trotter Jr., W.T.,seeK.P. Bogart 5 (1973) 33–43Trotter Jr., W.T., Dimension of the crownSkn 8 (1974) 85–103Trotter Jr., W.T., Embedding finite posets in cubes12 (1975) 165–172Trotter Jr., W.T. and J.I. Moore Jr., Some theorems on graphs and posets15 (1976) 79–84Trotter Jr., W.T. and K.P. Bogart, Maximal dimensional partially ordered sets III: A characterization of Hiraguchi’s

inequality for interval dimension 15 (1976) 389–400Trotter Jr., W.T. and K.P. Bogart, On the complexity of posets16 (1976) 71–82Trotter Jr., W.T. and J.I. Moore Jr., Characterization problems for graphs, partially ordered sets, lattices, and

families of sets 16 (1976) 361–381Trotter Jr., W.T., A characterization of Roberts’ inequality for boxicity28 (1979) 303–313Trotter Jr., W.T.,seeS.B. Maurer 31 (1980) 297–313Trotter Jr., W.T.,seeS.B. Maurer 32 (1980) 167–189Trotter Jr., W.T., Stacks and splits of partially ordered sets35 (1981) 229–256Trotter Jr., W.T. and T.R. Monroe, A combinatorial problem involving graphs and matrices39 (1982) 87–101Trotter Jr., W.T., The dimension of the cartesian product of partial orders53 (1985) 255–263Trotter Jr., W.T. and D.B. West, Poset boxicity of graphs (Note) 64 (1987) 105–107Troyon, M.F.,seeK.W. Hoke 131(1-3) (1994) 105–113Truszczynski, M., Note on the decompositions ofλKm,n(λK∗m,n) 55 (1985) 89–96Truszczynski, M.,seeP.Z. Chinn 87 (1991) 237–248Truszczynski, M. and Z. Tuza, Asymptotic results on saturated graphs87 (1991) 309–314Truszczynski, M.,seeM.S. Jacobson 89 (1991) 17–27Truszczynski, M., Decompositions of graphs into forests with bounded maximum degree98 (1991) 207–222Truszczynski, M. and Z. Tuza, Rado’s Selection Principle: applications to binary relations, graph and hypergraph

colorings and partially ordered sets103(1992) 301–312Truszczynski, M.,seeA. Rucinski 164(1-3) (1997) 251–255Tsai, Y.S.,seeH.J. Shyr 181(1-3) (1998) 213–222Tsaranov, S.,seeA. Pasini 155(1-3) (1996) 183–204Tsay, Y.-J.,seeG.J. Chang 148(1-3) (1996) 9–14Tsay, Y.-J. and G.J. Chang, The exact gossiping problem163(1-3) (1997) 165–172Tseng, S. and M.-C. Horng, Partitions of a finite three-complete poset148(1-3) (1996) 205–216Tsikopoulos, N., Cycles throughk+ 2 vertices ink-connected graphs (Communication) 50 (1984) 113–114Tsuchiya, M., On determination of graphG whose bond latticeL(G) is modular (Note) 56 (1985) 79–81Tsuchiya, M.,seeT. Hibi 72 (1988) 167–174Tsuchiya, M., On antichain intersection numbers, total clique covers and regular graphs127(1-3) (1994) 305–

318Tsuchiya, M.,seeH. Era 179(1-3) (1998) 103–109Tsukui, Y., Transformations of edge-coloured cubic graphs184(1-3) (1998) 183–194Tu, G.-Z., A combinatorial formula relating to Hirota’s bilinear equations123(1993) 121–129Tucker, A., Structure theorems for some circular-arc graphs7 (1974) 167–195Tucker, A., Uniquely colorable perfect graphs44 (1983) 187–194Tucker, A.,seeA. Teng 55 (1985) 233–243Tucker, A., Balanced matrices with row sum 3132(1-3) (1994) 395–398Tucker, T.W.,seeJ.L. Gross 18 (1977) 273–283


Tucker, T.W.,seeT. Pisanski 78 (1989) 157–167Tucker, T.W.,seeJ.L. Gross 143(1-3) (1995) 71–85Tuma, J., Note on binary simplicial matroids (Note) 49 (1984) 105–107Tuma, M.,seeJ. Reiterman 54 (1985) 193–200Turán, G., On the definability of properties of finite graphs49 (1984) 291–302Turán, Gy.,seeU. Faigle 63 (1987) 131–141Turán, P.,seeP. Erdös 2 (1972) 207–228Turgeon, J.,seeA. Kotzig 16 (1976) 263–270Turgeon, J.,seeA. Kotzig 20 (1977) 249–254Turgeon, J.M.,seeP.J. Laufer 47 (1983) 255–266Turksen, I.B., The set of solutions for Boolean equations5 (1973) 261–282Turksen, I.B., Extensions on solutions of Boolean equations via its conjunctions8 (1974) 187–200Turner, B. and K. Warner, The structure and geometry of 4× 4 pandiagonal matrices34 (1981) 301–310Turner, E.C.,seeR.Z. Goldstein 80 (1990) 267–272Turner, J.C.,seeA.G. Shannon 92 (1991) 329–340Turzik, D.,seeS. Poljak 42 (1982) 119–123Turzík, D.,seeS. Poljak 58 (1986) 99–104Turzík, D.,seeS. Poljak 108(1992) 379–392Tusnády, G.,seeM. Bolla 128(1-3) (1994) 1–20Tusserkani, R.,seeH. Hajiabolhassan 199(1-3) (1999) 233–236Tutte, W.T., On the 2-factors of bicubic graphs1 (1971) 203–208Tutte, W.T., Spanning subgraphs with specified valencies9 (1974) 97–108Tutte, W.T., Separation of vertices by a circuit12 (1975) 173–184Tutte, W.T., On the Birkhoff—Lewis equations92 (1991) 417–425Tutte, W.T.,seeR.L. Brooks 100(1992) 291–301Tuza, Z.,seeA. Gyárfás 66 (1987) 309–310Tuza, Z., Isomorphism of two infinite-chromatic triangle-free graphs (Communication) 69 (1988) 95Tuza, Z.,seeF.R.K. Chung 81 (1990) 129–135Tuza, Z., Covering all cliques of a graph86 (1990) 117–126Tuza, Z.,seeM. Truszczynski 87 (1991) 309–314Tuza, Z.,seeT. Andreae 88 (1991) 11–20Tuza, Z.,seeM.S. Jacobson 89 (1991) 17–27Tuza, Z.,seeP. Erdos 98 (1991) 95–104Tuza, Z.,seeM. Truszczynski 103(1992) 301–312Tuza, Z.,seeP. Erdos 108(1992) 279–289Tuza, Z., Asymptotic growth of sparse saturated structures is locally determined108(1992) 397–402Tuza, Z.,seeG. Bacsó 111(1993) 37–40Tuza, Z.,seeY. Caro 111(1993) 87–93Tuza, Z., Multipartite Turán problem for connected graphs and hypergraphs112(1993) 199–206Tuza, Z.,seeZ. Blázsik 115(1993) 51–55Tuza, Z.,seeL. Pyber 120(1993) 161–174Tuza, Z.,seeP. Horák 122(1993) 205–217Tuza, Z.,seeM. Gionfriddo 124(1994) 79–86Tuza, Z., Monochromatic coverings and tree Ramsey numbers125(1994) 377–384Tuza, Z., Largest size and union of Helly families127(1-3) (1994) 319–327Tuza, Z.,seeS. Milici 129(1-3) (1994) 159–166Tuza, Z., Characterization of (m,1)-transitive and (3,2)-transitive semi-complete directed graphs135 (1-3)

(1994) 335–347Tuza, Z.,seeN. Van Ngoc 138(1-3) (1995) 387–392Tuza, Z.,seeM. Aigner 144(1-3) (1995) 3–10Tuza, Z.,seeC.A. Barefoot 150(1-3) (1996) 31–48Tuza, Z.,seeP. Erdos 150(1-3) (1996) 89–101Tuza, Z.,seeS. Jendrol 150(1-3) (1996) 179–186Tuza, Z.,seeR. van Dal 159(1-3) (1996) 69–81Tuza, Z.,seeM. Gionfriddo 174(1-3) (1997) 125–130


Tuza, Z.,seeL. Milazzo 174(1-3) (1997) 247–259Tuza, Z.,seeS. Bylka 194(1-3) (1999) 39–58Tuza, Z.,seeS. Jendrol’ 197-198(1-3) (1999) 453–467Tuza, Zs.,seeA. Gyárfás 30 (1980) 235–244Tuza, Zs.,seeJ. Lehel 30 (1980) 245–248Tuza, Zs.,seeJ. Lehel 39 (1982) 59–65Tuza, Zs.,seeA. Gyárfás 52 (1984) 177–198Tuza, Zs.,seeZ. Füredi 55 (1985) 317–321Tuza, Zs.,seeJ. Lehel 61 (1986) 93–101Tuza, Zs.,seeA. Gyárfás 71 (1988) 33–46Tuza, Zs.,seeR.J. Faudree 78 (1989) 83–87Tuza, Zs.,seeM. Biró 100(1992) 267–279Tuza, Zs.,seeP. Dell’Olmo 164(1-3) (1997) 67–79Tuza, Zs.,seeN. Alon 165-166(1-3) (1997) 31–38Tuza, Zs.,seeL. Milazzo 182(1-3) (1998) 233–243Tuza, Zs.,seeJ. Kratochvíl 191(1-3) (1998) 139–148Tverberg, H., On a coin tossing problem by G. Bennett (Note) 115(1993) 293–294Tyshkevich, R.I., Once more on matrogenic graphs51 (1984) 91–100Tyshkevich, R.I.,seeA.A. Chernyak 64 (1987) 111–128Tyshkevich, R.I. and V.E. Zverovich, Line hypergraphs161(1-3) (1996) 265–283Tzeng, K.K. and G.L. Feng, Further results about the cyclicity of generalized Goppa codes56 (1985) 281–290Ueberberg, J., Symbolic incidence geometry and finite linear spaces129(1-3) (1994) 205–217Ueberberg, J., Projective planes and dihedral groups174(1-3) (1997) 337–345Ueda, T., The fixing groups for the 2-asummable Boolean functions20 (1977) 77–82Ueda, T., On the fixing group for a totally pre-ordered Boolean function (Note) 26 (1979) 293–295Ueda, T., Circular nonsingular threshold transformations105(1992) 249–258Ueda, T., Graphs of nonsingular threshold transformations128(1-3) (1994) 349–359Ueno, S.,seeY. Kajitani 72 (1988) 187–194Ueno, S., Y. Kajitani and S. Gotoh, On the nonseparating independent set problem and feedback set problem for

graphs with no vertex degree exceeding three72 (1988) 355–360Ueno, S.,seeA. Takahashi 127(1-3) (1994) 293–304Ughi, E.,seeL. Guerra 42 (1982) 197–208Uhrin, B., The set of neighbours of a set in a point-lattice133(1-3) (1994) 259–266Uhry, J.-P.,seeM. Boulala 27 (1979) 225–243Uhry, J.P.,seeN. Sbihi 51 (1984) 191–205Uhry, J.P.,seeJ. Fonlupt 105(1992) 73–91Ulatowski, W., Cycle interpolation properties of graphs143(1-3) (1995) 251–257Ullman, D.,seeR. Simion 98 (1991) 193–206Ullman, D.,seeM.V. Ramana 132(1-3) (1994) 247–265Umar, A., Enumeration of certain finite semigroups of transformations189(1-3) (1998) 291–297Umeo, H. and I. Nakatsuka, A pipeline-interval-optimum systolic queue (Communication) 62 (1986) 319–323Underground, P., On graphs with hamiltonian squares (Note) 21 (1978) 323Ungerer, E.,seeJ.H. Hattingh 171(1-3) (1997) 141–151Ungerer, E.,seeJ.H. Hattingh 183(1-3) (1998) 141–152Upfal, E.,seeE. Shamir 41 (1982) 281–286Uppuluri, V.R.R.,seeW.H. Olson 5 (1973) 159–169Urabe, M.,seeY. Egawa 58 (1986) 93–95Urabe, M.,seeJ. Akiyama 116(1993) 291–298Urabe, M.,seeJ. Akiyama 151(1-3) (1996) 15–18Urabe, M.,seeK. Hosono 151(1-3) (1996) 99–104Urbanek, F.J.,seeH. Prodinger 28 (1979) 277–289Urrutia, J.,seeM.C. Golumbic 43 (1983) 37–46Urrutia, J.,seeV. Neumann-Lara 49 (1984) 83–87Urrutia, J.,seeV. Neumann-Lara 62 (1986) 65–70Urrutia, J.,seeV. Neumann-Lara 69 (1988) 173–178


Urrutia, J.,seeJ. Akiyama 83 (1990) 123–126Urrutia, J.,seeJ. Akiyama 84 (1990) 101–103Urrutia, J.,seeS. Foldes 102(1992) 13–23Urrutia, J.,seeI. Rival 109(1992) 255–263Urrutia, J.,seeJ. Czyzowicz 137(1-3) (1995) 147–153Urrutia, J.,seeJ. Akiyama 151(1-3) (1996) 15–18Urrutia, J.,seeF. Hurtado 162(1-3) (1996) 187–197Urrutia, J.,seeV. Neumann-Lara 197-198(1-3) (1999) 633–636Usami, Y., Minimum number of edges in graphs that are bothP2- andPi -connected 44 (1983) 195–199Usami, Y.,seeK. Ando 66 (1987) 15–20Ushio, K., On balanced claw designs of complete multi-partite graphs (Note) 38 (1982) 117–119Ushio, K.,P3-factorization of complete bipartite graphs72 (1988) 361–366Ushio, K.,G-designs and related designs116(1993) 299–311Ushio, K., Star-factorization of symmetric complete bipartite digraphs167-168(1-3) (1997) 593–596Ushio, K.,Sk -factorization of symmetric complete tripartite digraphs197-198(1-3) (1999) 791–797Ushio, K., Cycle-factorization of symmetric complete multipartite digraphs199(1-3) (1999) 273–278Ustimenko, V.A.,seeF. Lazebnik 157(1-3) (1996) 271–283Ustimenko, V.A.,seeF. Lazebnik 197-198(1-3) (1999) 503–513Vacirca, V.,seeM. Gionfriddo 97 (1991) 191–198Vaderlind, P.,seeA.P. Wojda 164(1-3) (1997) 303–311Vaessens, R.J.M.,seeJ.M. van den Akker 81 (1990) 103–109Vainshtein, A.,seeB. Shapiro 153(1-3) (1996) 305–318Vainshtein, A.,seeA. Kreinin 161(1-3) (1996) 301–308Vainshtein, A.,seeB. Shapiro 180(1-3) (1998) 345–355Vakil, R., seeT. Kubo 152(1-3) (1996) 225–252Valdés, L., On the divisibility of the cycle number by 7 (Note) 120(1993) 301–305Valette, A., An application of Ramanujan graphs toC*-algebra tensor products167-168(1-3) (1997) 597–603Valette, G., A better packing of ten equal circles in a square (Communication) 76 (1989) 57–59Valiev, M.K., Universal group with twenty-one defining relations17 (1977) 207–213Vallejo, E., Reductions of additive sets, sets of uniqueness and pyramids173(1-3) (1997) 257–267Valtr, P., Sets inRd with no large empty convex subsets108(1992) 115–124Valtr, P.,seeR. Adamec 108(1992) 219–229Van Bang Le, Gallai graphs and anti-Gallai graphs159(1-3) (1996) 179–189Van Bang Le,seeA. Brandstädt 177(1-3) (1997) 9–16Van Blanken, E., J. van den Heuvel and H.J. Veldman, Pancyclicity of hamiltonian line graphs138(1-3) (1995)

379–385Van Buggenhaut, J., On the existence of 2-designsS2(2,3, v) without repeated blocks8 (1974) 105–109Van Dal, R., G. Tijssen, Z. Tuza, J.A.A. van der Veen, C. Zamfirescu and T. Zamfirescu, Hamiltonian properties

of Toeplitz graphs 159(1-3) (1996) 69–81Van Dam, E.R. and W.H. Haemers, Graphs with constantµ andµ 182(1-3) (1998) 293–307Van Dam, E.R. and E. Spence, Small regular graphs with four eigenvalues189(1-3) (1998) 233–257Van den Akker, J.M., J.H. Koolen and R.J.M. Vaessens, Perfect codes with distinct protective radii (Communica-

tion) 81 (1990) 103–109Vanden Cruyce, P., A characterization of then-cube by convex subgraphs (Communication) 41 (1982) 109–110Vanden Cruyce, P., A convex characterization of the graphs of the dodecahedron and icosahedron50 (1984)

99–105Vanden Cruyce, P., A finite graph which is locally a dodecahedron (Communication) 54 (1985) 343–346Vanden Eynden, C., On a paper of Lake about infinite graphs (Note) 18 (1977) 97Vanden Eynden, C., Countable sequenceable groups (Note) 23 (1978) 317–318Van den Heuvel, J.,seeH.J. Broersma 121(1993) 25–35Van den Heuvel, J.,seeH.J. Broersma 122(1993) 37–49Van den Heuvel, J., Long cycles in graphs containing a 2-factor with many odd components137 (1-3) (1995)

389–393Van den Heuvel, J.,seeE. van Blanken 138(1-3) (1995) 379–385Van den Heuvel, J.,seeD. Bauer 141(1-3) (1995) 1–10


Van der Geer, G. and M. van der Vlugt, Weight distributions for a certain class of codes and maximal curves106/107(1992) 209–218

Vanderjagt, D.W., Graphs with prescribed local connectivities10 (1974) 391–395Vanderkam, J.M., Path-sequential labellings of cycles162(1-3) (1996) 239–249Van der Veen, J.A.A.,seeR. van Dal 159(1-3) (1996) 69–81Van der Vlugt, M.,seeG. van der Geer 106/107(1992) 209–218Van de Vel, M.,seeH.-J. Bandelt 67 (1987) 129–137Van Diest, V.,seeJ. Doyen 13 (1975) 225–236Van Laarhoven, P.J.M.,seeE.H.L. Aarts 106/107(1992) 11–18Van Leeuwen, J.,seeG.T. Herman 6 (1973) 235–247Van Leeuwen, J., Effective constructions in well-partially-ordered free monoids21 (1978) 237–252Van Leeuwen, J.,seeJ.A. La Poutré 114(1993) 329–359Van Leeuwen, M.A.A., Tableau algorithms defined naturally for pictures157(1-3) (1996) 321–362Van Lint, J.H. and H.J. Ryser, Block designs with repeated blocks3 (1972) 381–396Van Lint, J.H., A theorem on equidistant codes6 (1973) 353–358Van Lint, J.H.,seeJ.I. Hall 17 (1977) 71–83Van Ngoc, N. and Z. Tuza, 4-chromatic graphs with large odd girth138(1-3) (1995) 387–392Van Nuffelen, C. and M. van Wouwe, A bound for the Dilworth number81 (1990) 203–210Van Os, C.H.,seeR.H. Jeurissen 132(1-3) (1994) 83–96Van Rees, G.H.J.,seeA.E. Brouwer 39 (1982) 263–281Van Rees, G.H.J., A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs77 (1989) 357–365Van Rees, G.H.J.,seeW. Kocay 92 (1991) 159–172Van Rees, G.H.J.,seeD.A. Drake 194(1-3) (1999) 87–94Van Stone, D.,seeC.M. Grinstead 86 (1990) 21–26Vanstone, S.,seeD. Jungnickel 92 (1991) 131–135Vanstone, S.,seeE. Lamken 92 (1991) 197–209Vanstone, S.A.,seeD. McCarthy 19 (1977) 67–76Vanstone, S.A., Extremal(r, λ)-designs 23 (1978) 57–66Vanstone, S.A.,seeD. McCarthy 25 (1979) 237–244Vanstone, S.A., Doubly resolvable designs29 (1980) 77–86Vanstone, S.A.,seeR. Mathon 30 (1980) 157–172Vanstone, S.A.,seeR.C. Mullin 37 (1981) 79–104Vanstone, S.A.,seeR. Fuji-Hara 41 (1982) 17–28Vanstone, S.A.,seeD.R. Stinson 55 (1985) 107–111Vanstone, S.A.,seeE.R. Lamken 62 (1986) 197–210Vanstone, S.A.,seeD.J. Curran 73 (1988/89) 49–63Vanstone, S.A.,seeE.R. Lamken 77 (1989) 159–176Vanstone, S.A.,seeK. Phelps 77 (1989) 255–258Vanstone, S.A.,seeE.R. Lamken 83 (1990) 37–47Vanstone, S.A.,seeP.C.V. Oorschot 84 (1990) 71–85Vanstone, S.A.,seeW.L. Kocay 85 (1985) 45–60Vanstone, S.A.,seeD. Jungnickel 97 (1991) 269–277Vanstone, S.A.,seeV.D. Tonchev 106/107(1992) 493–496Vanstone, S.A.,seeE.R. Lamken 120(1993) 135–148Van Tilborg, H., A lower bound forv in a t − (v, k,λ) design 14 (1976) 399–402Van Tilborg, H., On the existence of a cyclic code with rateR (Note) 22 (1978) 97–98Van Tilborg, H.,seeP. Heijnen 184(1-3) (1998) 111–120Van Tilborg, H.C.A., The smallest length of binary 7-dimensional linear codes with prescribed minimum distance

33 (1981) 197–207Van Tilborg, H.C.A., Fire codes revisited106/107(1992) 479–482Van Trung, T.,seeZ. Janko 55 (1985) 327–328Van Trung, T.,seeE.S. Kramer 96 (1991) 101–110Van Trung, T., Some existence theorems fort-designs 128(1-3) (1994) 337–348Van Wee, G.J.M., On the non-existence of certain perfect mixed codes (Note) 87 (1991) 323–326Van Wouwe, M.,seeC. van Nuffelen 81 (1990) 203–210


Van Zanten, A.J.,seeC. Roos 51 (1984) 179–190Van Zanten, A.J.,seeC. Roos 51 (1984) 277–282Van Zanten, A.J.,seeC. Roos 58 (1986) 275–283Van Zanten, A.J.,seeC. Roos 62 (1986) 139–144Van Zanten, A.J., The degree of the eigenvalues of generalized moore geometries67 (1987) 89–96Van Zanten, A.J.,seeR.M. Damerell 76 (1989) 183–189Van Zanten, A.J., A short proof of a theorem of Bannai and Ito (Note) 78 (1989) 321–325Varadarajan, K.,seeJ.W. Breckenridge 120(1993) 37–50Varadarajan, K.,seeP. Sankaran 126(1994) 313–323Varecza, Á., Are two given elements neighbouring?42 (1982) 107–117Varga, L.E., Geometric matrices and an inequality for(0,1)-matrices 82 (1990) 303–315Varlet, J., Relative de Morgan lattices (Note) 46 (1983) 207–209Varlet, J., Fixed points in finite de Morgan algebras53 (1985) 265–280Varlet, J.,seeT. Blyth 81 (1990) 323–329Varone, S.C., Trees related to realizations of distance matrices192(1-3) (1998) 337–346Varricchio, S.,seeG. Pirillo 153(1-3) (1996) 239–251Vaughan, T.,seeL. Carlitz 8 (1974) 147–167Vaughan, T.,seeL. Carlitz 14 (1976) 215–239Vaxès, Y.,seeJ.-F. Maurras 165-166(1-3) (1997) 481–486Vazirani, U.V.,seeM. Santha 114(1993) 425–433Veinott Jr., A.F.,seeY. Balcer 4 (1973) 295–303Veldman, H.J.,seeC. Hoede 34 (1981) 61–67Veldman, H.J., Existence of dominating cycles and paths43 (1983) 281–296Veldman, H.J., Non-κ-critical vertices in graphs 44 (1983) 105–110Veldman, H.J., Existence ofDλ-cycles andDλ-paths 44 (1983) 309–316Veldman, H.J.,seeH.J. Krol 52 (1984) 225–234Veldman, H.J.,seeD. Bauer 79 (1989/90) 59–70Veldman, H.J.,seeF. Göbel 87 (1991) 29–40Veldman, H.J.,seeD. Bauer 96 (1991) 33–49Veldman, H.J., Cycles containing many vertices of large degree101(1992) 319–325Veldman, H.J.,seeH.J. Broersma 121(1993) 25–35Veldman, H.J.,seeH.J. Broersma 122(1993) 37–49Veldman, H.J., On dominating and spanning circuits in graphs124(1994) 229–239Veldman, H.J.,seeE. van Blanken 138(1-3) (1995) 379–385Veldman, H.J.,seeD. Bauer 141(1-3) (1995) 1–10Veldman, H.J.,seeD. Bauer 155(1-3) (1996) 13–18Veldman, H.J.,seeH. Broersma 171(1-3) (1997) 43–54Veldman, H.J.,seeH. Trommel 197-198(1-3) (1999) 781–789Venezia, A.,seeD. Senato 173(1-3) (1997) 229–256Venkatachalam, C.V.,seeE. Sampathkumar 74 (1989) 227–239Venkatesan, S.M., On cleaving a planar graph81 (1990) 97–102Ventou, M. and C. Rigoni, Self-dual doubly circulant codes56 (1985) 291–298Vergnas, M.L., Acyclic and totally cyclic orientations of combinatorial geometries20 (1977) 51–61Vergnas, M.L., An extension of Tutte’s 1-Factor Theorem23 (1978) 241–255Vergnas, M.L.,seeR. Cordovil 160(1-3) (1996) 105–113Vergnas, M.L.,seeY.O. Hamidoune 165-166(1-3) (1997) 385–392Vergnas, M.L.,seeG. Etienne 179(1-3) (1998) 111–119Verrall, H., Hamilton decompositions of complete 3-uniform hypergraphs132(1-3) (1994) 333–348Verri, M.C.,seeE. Barcucci 102(1992) 229–237Verschut, A.,seeH. Trommel 197-198(1-3) (1999) 781–789Versmissen, K., Monohedral periodic tilings of the plane with any number of aspects (Note) 93 (1991) 101–108Vesel, A. and J. Žerovnik, The independence number of the strong product of odd cycles182 (1-3) (1998)

333–336Vestergaard, P.D., Graphs with one isomorphism class of spanning unicyclic graphs70 (1988) 103–108Vestergaard, P.D.,seeY. Egawa 110(1992) 269–274


Vestergaard, P.D., Two-cacti with minimum number of spanning trees124(1994) 241–250Vestergaard, P.D.,seeL.D. Andersen 155(1-3) (1996) 3–12Vestergaard, P.D.,seeJ. Topp 155(1-3) (1996) 247–258Vestergaard, P.D.,seeJ. Topp 164(1-3) (1997) 285–290Vesztergombi, K., On the distribution of distances in finite sets in the plane57 (1985) 129–145Vesztergombi, K., On large distances in planar sets67 (1987) 191–198Vesztergombi, K., The two largest distances in finite planar sets150(1-3) (1996) 381–386Vidyasankar, K., Covering the edge set of a directed graph with trees24 (1978) 79–85Viennot, G., Permutations ayant une forme donnee26 (1979) 279–284Viennot, G.,seeJ. Françon 28 (1979) 21–35Viennot, G.X.,seeP. Leroux 72 (1988) 237–250Viennot, X.G.,seeE. Roblet 153(1-3) (1996) 271–288Vijayakumar, A.,seeB.R. Nair 131(1-3) (1994) 205–210Vijayakumar, A.,seeB.R. Nair 158(1-3) (1996) 201–209Vijayan, K.,seeL. Caccetta 97 (1991) 69–81Vijayan, K.,seeL. Caccetta 98 (1991) 1–7Vilarem, M.-C.,seeP. Jégou 111(1993) 333–344Villeneuve, D.,seeO. du Merle 194(1-3) (1999) 229–237Vinárek, J.,seeA. Pultr 20 (1977) 159–176Vinárek, J., Simultaneous representations of groups108(1992) 211–216Vince, A., An algebraic theory of graph factorization (Note) 46 (1983) 211–213Vince, A.,n-graphs 72 (1988) 367–380Vince, A.,seeH. Pulapaka 182(1-3) (1998) 267–277Vincent, M., Quelques proprietes des ensembles de fermetures sur un ensemble ordonne13 (1975) 75–84Vincke, P., Quasi-kernels of minimum weakness in a graph20 (1977) 187–192Virden, L.I.,seeT.J. Reid 163(1-3) (1997) 119–127Virlouvet, C.,seeB. Peroche 125(1994) 289–299Virlouvet, C.,seeJ. Gimbel 165-166(1-3) (1997) 333–341Vishkin, U.,seeY. Shiloach 41 (1982) 57–65Vitányi, P.M.B., On a problem in the collective behavior of automata (Note) 14 (1976) 99–101Vitányi, P.M.B., How well can a graph ben-colored? 34 (1981) 69–80Vithal Rao, G.,seeM.L. Narayana Rao 66 (1987) 175–190Vito, P.D. and P.M.L. Re, On some classes of linear spaces embedded in a Pappian plane129 (1-3) (1994)

43–52Vitray, R.P.,seeB. Mohar 149(1-3) (1996) 141–157Voigt, B., seeH.J. Prömel 35 (1981) 185–198Voigt, B., seeH.J. Prömel 36 (1981) 83–96Voigt, B., Combinatorial properties of regressive mappings47 (1983) 97–108Voigt, B., seeH. Lefmann 52 (1984) 285–286Voigt, B., seeH.J. Prömel 54 (1985) 49–59Voigt, B., seeA. Benzait 73 (1988/89) 27–35Voigt, B., seeH.J. Prömel 95 (1991) 341–358Voigt, B., seeH.J. Prömel 108(1992) 83–106Voigt, M. and H. Walther, On the chromatic number of special distance graphs97 (1991) 395–397Voigt, M., List colourings of planar graphs (Communication) 120(1993) 215–219Voigt, M., A not 3-choosable planar graph without 3-cycles146(1-3) (1995) 325–328Voigt, M., Choosability of planar graphs150(1-3) (1996) 457–460Voigt, M., seeN. Alon 165-166(1-3) (1997) 31–38Voigt, M., seeJ. Kratochvíl 191(1-3) (1998) 139–148Voigt, M., seeP. Mihók 191(1-3) (1998) 149–158Vojtáš, P., Cardinalities of noncentered systems of subsets ofω 108(1992) 125–129Volkmann, L.,seeP. Flach 80 (1990) 145–151Volkmann, L.,seeJ. Topp 96 (1991) 75–80Volkmann, L.,seeJ. Topp 96 (1991) 229–238Volkmann, L.,seeJ. Topp 118(1993) 289–292


Volkmann, L.,seeW. Siemes 131(1-3) (1994) 279–285Volkmann, L.,seeY. Guo 135(1-3) (1994) 121–127Volkmann, L.,seeP. Maschlanka 154(1-3) (1996) 167–178Volkmann, L.,seeY. Guo 164(1-3) (1997) 165–170Volkmann, L.,seeJ. Bang-Jensen 167-168(1-3) (1997) 101–114Volkmann, L., The ratio of the irredundance and domination number of a graph178(1-3) (1998) 221–228Volkmann, L.,seeD. Rautenbach 187(1-3) (1998) 185–193Volkmann, L.,seeB. Randerath 191(1-3) (1998) 159–169Volkmann, L.,seeM. Tewes 197-198(1-3) (1999) 769–779Volkmann, L., Longest paths in semicomplete multipartite digraphs199(1-3) (1999) 279–284Von Below, J., On a theorem of L. Mirsky on even doubly-stochastic matrices (Note) 55 (1985) 311–312Von Rimscha, M., Reconstructibility and perfect graphs47 (1983) 283–291Voss, H.-J.,seeJ. Širán 134(1-3) (1994) 161–175Voss, H.-J., Sachs triangulations and infinite sequences of regular maps on given type191(1-3) (1998) 223–240Vougiouklis, T.,Hv-groups defined on the same set155(1-3) (1996) 259–265Vougiouklis, T., Convolutions on WASS hyperstructures174(1-3) (1997) 347–355Vowden, B., Infinite series of double Youden rectangles125(1994) 385–391Vowden, B.J.,seeD.A. Preece 138(1-3) (1995) 353–363Vowden, B.J.,seeD.A. Preece 197-198(1-3) (1999) 671–682Voxman, B.,seeA. Bialostocki 91 (1991) 231–238Vuškovic, K., seeM. Conforti 199(1-3) (1999) 27–33Wachs, M.L., Minimum cost partitions of a rectangle36 (1981) 305–324Wachs, M.L., The major index polynomial for conjugacy classes of permutations91 (1991) 283–293Wachs, M.L., An involution for signed Eulerian numbers99 (1992) 59–62Wachs, M.L.,seeK. Liang 99 (1992) 181–197Wachs, M.L., On the (co)homology of the partition lattice and the free Lie algebra193(1-3) (1998) 287–319Wagner, B.,seeM. Klemm 28 (1979) 173–177Wagner, C.,seeT. Hearne 5 (1973) 247–251Wagner, C.,seeR. Davis 128(1-3) (1994) 95–111Wagner, C.G., Minimal multiplicative covers of an integer24 (1978) 87–94Wagner, C.G., Generalized Stirling and Lah numbers160(1-3) (1996) 199–218Wagner, C.G.,seeS.B. Mulay 190(1-3) (1998) 177–189Wagner, D., Decomposition ofk-ary relations 81 (1990) 303–322Wagner, D.G., On the perfect one-factorization conjecture (Note) 104(1992) 211–215Wagner, D.G., Zeros of rank-generating functions of Cohen–Macaulay complexes139(1-3) (1995) 399–411Wagner, D.K., On theorems of Whitney and Tutte57 (1985) 147–154Wagneur, E., Moduloïds and pseudomodules 1. Dimension theory98 (1991) 57–73Wagon, S., Infinite triangulated graphs22 (1978) 183–189Wagowski, M., Coordinatization of B-matroids111(1993) 465–479Waiveris, C.,seeS.L. Snover 91 (1991) 193–200Wajnryb, B.,seeR. Aharoni 79 (1989/90) 221–228Wakabayashi, Y.,seeM. Grötschel 34 (1981) 43–59Wakabayashi, Y.,seeM.A.C.M. Gurgel 175(1-3) (1997) 163–172Wales, D.B.,seeR. Calderbank 51 (1984) 125–136Walker, E.,seeM. Gehrke 148(1-3) (1996) 49–63Walker, J.W., Isotone relations and the fixed point property for posets48 (1984) 275–288Walker, W.J., Algebraic and combinatorial results for ranking competitors in a sequence of races14 (1976)

297–304Walker, W.J., Ranking functions and axioms for linear orders67 (1987) 299–306Walkup, D.W., How many ways can a permutation be factored into twon-cycles? 28 (1979) 315–319Walkup, D.W., Matchings in random regular bipartite digraphs31 (1980) 59–64Waller, A.O., Some results on listT -colourings 174(1-3) (1997) 357–363Wallis, W.,seeD.A. Gregory 59 (1986) 267–273Wallis, W.,seeA. Baartmans 102(1992) 177–186Wallis, W.D., A doubling construction for Room squares3 (1972) 397–399


Wallis, W.D.,seeR.C. Mullin 37 (1981) 79–104Wallis, W.D.,seeD.R. Stinson 47 (1983) 125–128Wallis, W.D.,seeJ.H. Dinitz 47 (1983) 221–228Wallis, W.D.,seeA.H. Baartmans 78 (1989) 37–43Wallis, W.D. and J. Wu, On clique partitions of split graphs92 (1991) 427–429Wallis, W.D.,seeR. Rees 97 (1991) 357–369Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques120(1993) 191–203Wallis, W.D.,seeD.L. Kreher 156(1-3) (1996) 269–275Wallis, W.D.,seeA. Cerný 167-168(1-3) (1997) 189–196Wallis, W.D.,seeD.A. Drake 194(1-3) (1999) 87–94Walter, M., Construction of matroidal families by partly closed sets41 (1982) 309–315Walther, G.,seeR. Bodendiek 134(1-3) (1994) 9–16Walther, H., Remark on a paper of J. Zaks (Communication) 26 (1979) 297–301Walther, H., Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes (Communication) 33 (1981)

107–109Walther, H.,seeM. Voigt 97 (1991) 395–397Walther, H.,seeJ. Harant 150(1-3) (1996) 143–153Walther, H., A nonhamiltonian five-regular multitriangular polyhedral graph150(1-3) (1996) 387–392Walton, P.N. and D.J.A. Welsh, Tangential 1-blocks over GF(3) (Note) 40 (1982) 319–320Wan, H., On nearly self-conjugate partitions of a finite set175(1-3) (1997) 239–247Wan, P.-J. and D.-Z. Du, A (log2 3+ 1

2)-competitive algorithm for the counterfeit coin problem163(1-3) (1997)173–200

Wan, P.-J., D.-Z. Du and R.L. Graham, The Steiner ratio for the dual normed plane171(1-3) (1997) 261–275Wan, Z.,seeZ. Dai 123(1993) 17–34Wan, Z. and X. Wu, The weight hierarchies and generalized weight spectra of the projective codes from

degenerate quadrics177(1-3) (1997) 223–243Wan, Z.-x., R.-h. Xiong and M.-a. Yu, On the number of cycles of short length in the de Bruijn–Good graphGn

62 (1986) 85–98Wan, Z.-x. and R.-h. Xiong, Existence of self-reverse-dualM-sequences 66 (1987) 283–288Wan, Z.-x., Anzahl theorems in finite singular symplectic, unitary and orthogonal geometries123(1993) 131–

150Wan, Z.-x., Geometry of classical groups over finite fields and its applications174(1-3) (1997) 365–381Wang, B.-Y. and F. Zhang, On the precise number of (0,1)-matrices inA(R,S) 187(1-3) (1998) 211–220Wang, C., On the sum of two parameters concerning independence and irredundance in a graph (Note) 69(1988)

199–202Wang, C.,seeD. Sakai 119(1993) 175–189Wang, C., On theR-sequenceability of dicyclic groups125(1994) 393–398Wang, C., Boolean minors141(1-3) (1995) 237–258Wang, C.,seeA.E. Kézdy 194(1-3) (1999) 261–265Wang, C.C.,seeR. Alter 18 (1977) 217–226Wang, C.-D., On the harmoniousness of dicyclic groups (Communication) 120(1993) 221–225Wang, C.-D., A short proof of the existence of 2-sequencings in dihedral groups145(1-3) (1995) 287–289Wang, D.L.,seeD.J. Kleitman 6 (1973) 79–88Wang, D.-L. and P. Wang, Some results about the Chvátal conjecture24 (1978) 95–101Wang, D.-W.,seeX. Lu 184(1-3) (1998) 259–265Wang, H., Partition of a bipartite graph into cycles (Note) 117(1993) 287–291Wang, H.,P2p-factorization of a complete bipartite graph (Note) 120(1993) 307–308Wang, H., OnK1,k -factorizations of a complete bipartite graph126(1994) 359–364Wang, H., C. Little and K. Teo, Partition of a directed bipartite graph into two directed cycles160(1-3) (1996)

283–289Wang, H.,seeY.-H. Peng 172(1-3) (1997) 103–114Wang, H.,seeD.M. Berman 175(1-3) (1997) 35–40Wang, H., Vertex-disjoint hexagons with chords in a bipartite graph187(1-3) (1998) 221–231Wang, H., Triangles in claw-free graphs187(1-3) (1998) 233–244Wang, J., On point-linear arboricity of planar graphs72 (1988) 381–384


Wang, J.,seeY. Alavi 100(1992) 229–233Wang, J.,seeY. Alavi 111(1993) 3–10Wang, J.,seeC. Chen 112(1993) 29–40Wang, J., Long cycles in bipartite tournaments148(1-3) (1996) 217–225Wang, J., T.E. Lindquester, B. Yao and D.B. West, Maximum bandwidth of a graph and its complement179

(1-3) (1998) 293–298Wang, L. and S. Stueckle, Symmetries of drawings of sets of cycles and chromatic automorphisms128 (1-3)

(1994) 361–369Wang, P.,seeD.-L. Wang 24 (1978) 95–101Wang, P.,seeD. Hanson 101(1992) 109–114Wang, P.C.C., Characterizations of the Poisson distribution based on random splitting and random expanding

13 (1975) 85–93Wang, S.-Z. and B.-Y. Li, On the minimal cofinal subsets of a directed quasi-ordered set48 (1984) 289–306Wang, T. and H. Sachs, A contribution to the theory of Tutte’sV - andW -function 104(1992) 281–292Wang, T., Factors of trees131(1-3) (1994) 301–310Wang, W., On the colorings of outerplanar graphs147(1-3) (1995) 257–269Wang, Y.-L., On the bondage number of a graph159(1-3) (1996) 291–294Wang, Z.,seeM. Guan 48 (1984) 77–81Wanka, A.,seeA. Bachem 70 (1988) 303–310Waphare, B.N.,seeT.T. Raghunathan 184(1-3) (1998) 267–271Ward, H.N., Combinatorial polarization26 (1979) 185–197Ward, H.N., Weight polarization and divisibility 83 (1990) 315–326Ward, H.N., Divisors of codes of Reed–Muller type131(1-3) (1994) 311–323Wargo, L.,seeD.M. Berman 175(1-3) (1997) 35–40Warner, K.,seeB. Turner 34 (1981) 301–310Warner, M.W. and A. Muir, Homology theories and tolerance automata33 (1981) 209–221Warnke, I.,seeR. Labahn 126(1994) 421–424Warnke, I.,seeG. Burosch 152(1-3) (1996) 69–91Wassermann, A.,seeA. Betten 197-198(1-3) (1999) 83–109Wassermann, A.,seeA. Betten 197-198(1-3) (1999) 111–121Watanabe, K.-i.,seeT. Hibi 72 (1988) 167–174Watanabe, M., Arrow relations on families of finite sets94 (1991) 53–64Watanabe, M.,seeK. Hosono 151(1-3) (1996) 99–104Watanabe, T. and S.G. Mohanty, On an inclusion–exclusion formula based on the reflection principle64 (1987)

281–288Watanabe, T., On the Littlewood–Richardson rule in terms of lattice path combinatorics72 (1988) 385–390Waterhouse, W.C., How often do determinants over finite fields vanish? (Note) 65 (1987) 103–104Waterman, M.S.,seeP.R. Stein 26 (1979) 261–272Watkins, J.J.,seeF. Loupekine 72 (1988) 251–256Watkins, M.E.,seeH.A. Jung 18 (1977) 45–53Watkins, M.E. and J.B. Shearer, Counterexamples to two conjectures about distance sequences66 (1987) 289–

298Watkins, M.E., Edge-transitive strips95 (1991) 359–372Watkins, M.E., Some conditions for 1-transitivity109(1992) 289–296Watkins, M.E., Sur les graphes infinis possedant un groupe d’automorphismes primitif130 (1-3) (1994) 177–

182Watkins, M.E.,seeC.P. Bonnington 145(1-3) (1995) 61–72Watson, S.,seeJ.I. Brown 113(1993) 27–39Watson, S.,seeJ.I. Brown 154(1-3) (1996) 27–39Weakley, W.D.,seeL.W. Beineke 160(1-3) (1996) 41–47Weaver, M.L.,seeL.T.Q. Hung 189(1-3) (1998) 163–176Webb, B.S.,seeR.J. Chapman 138(1-3) (1995) 187–191Webb, B.S., Orbits of infinite block designs169(1-3) (1997) 287–292Weber, R.E.,seeG.L. Mullen 32 (1980) 291–297Weedmark, R.H.,seeM.G. Stone 44 (1983) 299–308


Wegener, I., On separating systems whose elements are sets of at mostk elements 28 (1979) 219–222Wegener, I., Efficient data structures for Boolean functions136(1-3) (1994) 347–372Wegner, G.,seeM. Quest 81 (1990) 187–192Wehrhahn, K.H.,seeJ.W. Breckenridge 120(1993) 37–50Wei, B., Hamiltonian paths and hamiltonian connectivity in graphs121(1993) 223–228Wei, B.,seeH. Lia 165-166(1-3) (1997) 459–469Wei, B.,seeX. Liu 169(1-3) (1997) 249–255Wei, B., Longest cycles in 3-connected graphs170(1-3) (1997) 195–201Wei, R.,seeF.E. Bennett 170(1-3) (1997) 15–28Wei, R.,seeA.M. Assaf 195(1-3) (1999) 15–25Wei, V.K., seeF.K. Hwang 46 (1983) 323–326Wei, V.K., seeJ. Körner 51 (1984) 147–165Wei, V.K., seeJ. Körner 62 (1986) 105–106Wei, W.,seeS. Gao 112(1993) 93–102Wei, W.-D., The classU(R,S) of (0,1)-matrices 39 (1982) 301–305Wei, W.-d.,seeJ.-y. Shao 110(1992) 293–296Wei, W.-D., S. Gao and B. Yang, Cyclic near difference sets of type 1123(1993) 151–177Wei, W.-D. and J.-Y. Xu, Cycle index of direct product of permutation groups and number of equivalence classes

of subsets ofZv 123(1993) 179–188Wei, Y.J.,seeD.R. Stinson 105(1992) 207–219Weichsel, P.M., Distance regular subgraphs of a cube109(1992) 297–306Weidner, H.G.,seeJ. Rosenmüller 10 (1974) 343–382Weinberg, L.,seeT. Inukai 22 (1978) 311–312Weiss, A.I.,seeC.J. Colbourn 50 (1984) 29–36Weiss, A.I.,seeE. Schulte 131(1-3) (1994) 221–261Wells, J.G.,seeC.-Y. Chao 46 (1983) 311–315Welsh, D.J.A.,seeF. Harary 2 (1972) 163–171Welsh, D.J.A.,seeP.N. Walton 40 (1982) 319–320Welsh, D.J.A.,seeA.D. Petford 74 (1989) 253–261Welsh, D.J.A.,seeJ.G. Oxley 109(1992) 185–192Welsh, D.J.A., The computational complexity of knot and matroid polynomials124(1994) 251–269Welsh, D.J.A., The random cluster process136(1-3) (1994) 373–390Wendell, R.E., A preview of a tolerance approach to sensitivity analysis in linear programming (Communication)

38 (1982) 121–124Wene, G.,seeV. Jha 155(1-3) (1996) 127–134Weng, G.,seeH.-J. Lai 143(1-3) (1995) 141–151Weng, J.F.,seeF.K. Hwang 45 (1983) 107–112Weng, J.F.,seeF.K. Hwang 62 (1986) 49–57Weng, J.F., Variational approach and Steiner minimal trees on four points132(1-3) (1994) 349–362Weng, J.F. and R.S. Booth, Steiner minimal trees on regular polygons with centre141(1-3) (1995) 259–274Wenger, E.,seeH. Fleischner 109(1992) 103–116Wenocur, R.S. and R.M. Dudley, Some special Vapnik–Chervonenkis classes33 (1981) 313–318Wensley, C.B.,seeI. Morris 50 (1984) 253–270Wensley, C.D.,seeI. Morris 118(1993) 173–195Wenzel, W., Pfaffian forms and1-matroids 115(1993) 253–266Wenzel, W., Pfaffian forms and1-matroids with coefficients 148(1-3) (1996) 227–252Werman, M. and D. Zeilberger, A bijective proof of Cassini’s Fibonacci identity (Note) 58 (1986) 109Wessel, W., A short solution of Heawood’s empire problem in the plane191(1-3) (1998) 241–245West, D.B. and D.J. Kleitman, Skew chain orders and sets of rectangles27 (1979) 99–102West, D.B., A class of solutions to the gossip problem, Part I39 (1982) 307–326West, D.B., A class of solutions to the gossip problem, Part II40 (1982) 87–113West, D.B., A class of solutions to the gossip problem, Part III40 (1982) 285–310West, D.B.,seeP. Erdös 55 (1985) 129–133West, D.B.,seeB. Reznick 57 (1985) 189–193West, D.B., Unichain coverings in partial orders with the nested saturation property63 (1987) 297–303


West, D.B.,seeW.T. Trotter Jr. 64 (1987) 105–107West, D.B.,seeD. Miklós 68 (1988) 265–272West, D.B., A short proof of the degree bound for interval number (Note) 73 (1989) 309–310West, D.B.,seeT. Madej 88 (1991) 259–277West, D.B.,seeT.M. Kratzke 118(1993) 145–156West, D.B., Acyclic orientations of complete bipartite graphs138(1-3) (1995) 393–396West, D.B.,seeT. Madej 144(1-3) (1995) 67–74West, D.B.,seeM.K. Sen 147(1-3) (1995) 235–245West, D.B.,seeM.S. Chung 150(1-3) (1996) 69–79West, D.B., Short proofs for interval digraphs178(1-3) (1998) 287–292West, D.B.,seeJ. Wang 179(1-3) (1998) 293–298West, D.B.,seeX. Liu 188(1-3) (1998) 269–277West, D.B.,seeL.T.Q. Hung 189(1-3) (1998) 163–176West, J., Generating trees and the Catalan and Schröder numbers146(1-3) (1995) 247–262West, J.,seeS. Dulucq 153(1-3) (1996) 85–103West, J., Generating trees and forbidden subsequences157(1-3) (1996) 363–374Wetzel, J.E.,seeG.B. Purdy 31 (1980) 53–58Wetzel, J.E.,seeG.L. Alexanderson 34 (1981) 219–240Wetzel, J.E.,seeG.L. Alexanderson 60 (1986) 67–73Wetzel, J.E.,seeG.L. Alexanderson 62 (1986) 325–328Wetzel, J.E., Regular dissections of an infinite strip146(1-3) (1995) 263–269Wevrick, D.,seeR.C. Mullin 92 (1991) 221–225Whaley, T.,seeW.M. Dymàcek 141(1-3) (1995) 95–107Whaley, T.,seeG.J. Chang 199(1-3) (1999) 11–25Whinston, A.,seeA. Majthay 9 (1974) 35–59Whitaker, R.M.,seeD. Bedford 197-198(1-3) (1999) 77–81White, A.,seeB. Mohar 56 (1985) 87–89White, A.T.,seeS. Stahl 14 (1976) 279–296White, A.T.,seeD.L. Goldsmith 23 (1978) 31–36White, A.T., Treble dodging minor methods: ringing the cosets, on six bells122(1993) 307–323White, A.T.,seeS. Lawrencenko 135(1-3) (1994) 367–369White, D.,seeD. Stanton 83 (1990) 105–114White, D.,seeP.H. Edelman 99 (1992) 63–68White, D.,seeJ. Galovich 157(1-3) (1996) 169–191White, D.E., Classifying patterns by automorphism group: An operator theoretic approach13 (1975) 277–295White, D.E., Construction of vector lists and isomorph rejection15 (1976) 85–105White, D.E.,seeJ.T. Joichi 31 (1980) 29–41White, D.E., Hybrid tableaux and the Littlewood–Richardson rule80 (1990) 183–206White, N.,seeA.V. Borovik 179(1-3) (1998) 59–72Whitehead, C.,seeA. Finbow 125(1994) 153–167Whitehead Jr., E.G., Algebraic structure of chromatic graphs associated with the ramsey numberN(3,3,3;2)

(Note) 1 (1971) 113–114Whitehead Jr., E.G., The Ramsey numberN(3,3,3,3;2) 4 (1973) 389–396Whitehead Jr., E.G., Difference sets and sum-free sets in groups of order 1613 (1975) 399–407Whitehead Jr., E.G.,seeC.-Y. Chao 27 (1979) 171–177Whitehead Jr., E.G., Chromatic polynomials of generalized trees72 (1988) 391–393Whitehead Jr., E.G.,seeN.-Z. Li 104(1992) 197–199Whitehead Jr., E.G.,seeN.-Z. Li 122(1993) 365–372Whitehead Jr., E.G.,seeZ.-Y. Guo 172(1-3) (1997) 53–58Whitehead, T.,seeD.A. Beck 153(1-3) (1996) 3–27Whiteman, A.L., Skew Hadamard matrices of Goethals-Seidel type2 (1972) 397–405Whitesides, S.,seeS. Bellantoni 114(1993) 41–49Whitesides, S.H.,seeV. Chvátal 26 (1979) 83–92Whitesides, S.H., A classification of certain graphs with minimal imperfection properties38 (1982) 303–310Whitesides, S.H., Edge-colored complete graphs with alternating cycles46 (1983) 299–304


Whittle, G.,seeJ. Oxley 105(1992) 173–184Whittle, G., Inequivalent representations of ternary matroids149(1-3) (1996) 233–238Whittle, G.P., An elementary proof that every matroid is an intersection of principal transversal matroids (Note)

54 (1985) 239Whittlesey, M.A.,seeJ.P. Georges 135(1-3) (1994) 103–111Wiedemann, D.,seeM. Buck 48 (1984) 163–171Wierman, J.C.,seeK. Nowicki 72 (1988) 299–310Wigderson, A.,seeJ. Gil 108(1992) 37–51Wigderson, A.,seeM. Karchmer 114(1993) 275–282Wilbrink, H., seeA. Blokhuis 97 (1991) 63–68Wilbrink, H.A., seeA. Blokhuis 74 (1989) 335–339Wilbrink, H.A., seeA.E. Brouwer 106/107(1992) 83–92Wild, M., Cover preserving embedding of modular lattices into partition lattices112(1993) 207–244Wild, M., Base exchange properties of graphic matroids148(1-3) (1996) 253–264Wild, P., Incidence graphs and subdesigns of semisymmetric designs44 (1983) 201–216Wild, P., Difference basis systems63 (1987) 81–90Wild, P.,seeW.-A. Jackson 98 (1991) 23–28Wild, P.,seeF. Piper 106/107(1992) 383–389Wild, P.,seeJ. Jedwab 125(1994) 241–254Wild, P., Some families of semibiplanes138(1-3) (1995) 397–403Wilde, D.J. and J.M. Sanchez-Anton, Multivariable monotonic optimization over multivalued logics and

rectangular design lattices1 (1971) 277–294Wilf, H.S., seeJ.M. Nolan 179(1-3) (1998) 277–283Wilkeit, E., seeH.-J. Bandelt 67 (1987) 1–14Wilkeit, E., The retracts of Hamming graphs102(1992) 197–218Willard, R., Essential arities of term operations in finite algebras149(1-3) (1996) 239–259Wille, D., On the enumeration of self-complementarym-placed relations (Note) 10 (1974) 189–192Wille, R., seeI. Rival 35 (1981) 203–212Wille, R., Subdirect product construction of concept lattices63 (1987) 305–313Wille, R., seeB. Monjardet 73 (1988/89) 163–164Wille, R., The skeletons of free distributive lattices88 (1991) 309–320Willems, M.L.H., Semi Laguerrei-structures 48 (1984) 307–314Willems, M.L.H., Semi Minkowskii-structures 54 (1985) 101–106Williams, G.D.,seeB. Corbas 185(1-3) (1998) 51–61Williams, H.C., Some formulas concerning the fundamental unit of a real quadratic field92 (1991) 431–440Williams, J.K.,seeS.L. Snover 91 (1991) 193–200Williams, K., seeJ. Liu 143(1-3) (1995) 159–166Williamson, S.G., The combinatorial analysis of patterns and the principle of inclusion–exclusion1 (1972)

357–388Wills, J.M., Finite platonic graphs 49 (1984) 303–308Wills, J.M.,seeE. Schulte 60 (1986) 253–262Wills, J.M., A combinatorially regular dodecahedron of genus 367 (1987) 199–204Willson, S.J., On convergence of configurations23 (1978) 279–300Wilson, B.J., Minimax arcs 92 (1991) 441–450Wilson, B.J.,seeB.E. Brunton 155(1-3) (1996) 19–26Wilson, B.J.,seeT.S. Griggs 174(1-3) (1997) 131–135Wilson, D.C.,seeR.A. Proctor 137(1-3) (1995) 297–302Wilson, R.J.,seeL.W. Beineke 5 (1973) 15–20Wilson, R.J.,seeG. Chartrand 100(1992) 303–311Wilson, R.M.,seeH. Hanani 3 (1972) 343–357Wilson, R.M.,seeJ. Doyen 5 (1973) 229–239Wilson, R.M., Concerning the number of mutually orthogonal Latin squares9 (1974) 181–198Wingate, W.J.G.,seeF.C. Holroyd 55 (1985) 267–282Winkler, P., Average height in a partially ordered set (Communication) 39 (1982) 337–341Winkler, P.,seeR. Nowakowski 43 (1983) 235–239


Winkler, P.,seeC. Bang 45 (1983) 123–126Winkler, P.M., On connectivity of triangulations of manifolds (Note) 32 (1980) 93–94Winston, K.J.,seeD.J. Kleitman 41 (1982) 167–172Winters, S.J., Connected graphs with prescribed median and periphery159(1-3) (1996) 223–236Wirsching, G.,seeH. Kellerer 85 (1990) 191–206Wirsching, G., On the combinatorial structure of 3N+1 predecessor sets148(1-3) (1996) 265–286Wirth, B., seeA.V. Kostochka 162(1-3) (1996) 299–303Wiseman, J.A., On the intersection rank of a graph104(1992) 293–305Witsenhausen, H.S., On intersections of interval graphs31 (1980) 211–216Witte, D., G. Letzter and J.A. Gallian, On hamiltonian circuits in cartesian products of Cayley digraphs43

(1983) 297–307Witte, D. and J.A. Gallian, A survey: Hamiltonian cycles in Cayley graphs51 (1984) 293–304Witte, D.,seeS.C. Locke 78 (1989) 105–114Witte, D.,seeM. Reid 82 (1990) 53–56Witte, D.,seeB. Alspach 82 (1990) 113–126Witte, D., Hamilton-decomposable graphs and digraphs of infinite valence84 (1990) 87–100Witte, D.,seeD. Dunham 143(1-3) (1995) 1–30Witte, D.,seeE. Dobson 189(1-3) (1998) 69–78Witte, D.S., On hamiltonian circuits in Cayley diagrams38 (1982) 99–108Włoch, A. and I. Włoch, On (k,l)-kernels in generalized products164(1-3) (1997) 295–301Włoch, I.,seeA. Włoch 164(1-3) (1997) 295–301Woeginger, G.,seeF. Rendl 119(1993) 167–174Woeginger, G.J.,seeQ.F. Yang 176(1-3) (1997) 233–254Woeginger, G.J., The toughness of split graphs190(1-3) (1998) 295–297Woess, W., Context-free languages and random walks on groups67 (1987) 81–87Woess, W., Topological groups and infinite graphs95 (1991) 373–384Woess, W.,seeM.A. Picardello 109(1992) 193–202Wohlgemuth, A.,seeG. Haggard 14 (1976) 139–156Wohlgemuth, A., Labeled reaction matrices, a histocompatibility model26 (1979) 285–292Woirgard, F.,seeI. Charon 165-166(1-3) (1997) 139–153Wojciechowski, J.,seeY. Kohayakawa 104(1992) 245–261Wojciechowski, J., On constructing snakes in powers of complete graphs181(1-3) (1998) 239–254Wojciechowski, J.,seeS.Y. Alsardary 188(1-3) (1998) 13–25Wójcik, P., Density of union-closed families105(1992) 259–267Wójcik, P., Union-closed families of sets199(1-3) (1999) 173–182Wojda, A.P.,seeD. Sotteau 58 (1986) 105–108Wojda, A.P.,seeA. Benhocine 118(1993) 11–21Wojda, A.P.,seeJ.-L. Fouquet 121(1993) 85–92Wojda, A.P. and P. Vaderlind, Packing bipartite graphs164(1-3) (1997) 303–311Wojda, A.P.,seeG. Schaar 164(1-3) (1997) 313–316Wojda, A.P. and I.A. Zioło, Embedding digraphs of small size165-166(1-3) (1997) 621–638Wojtas, M., On seven mutually orthogonal Latin squares20 (1977) 193–201Wojtas, M., New Wilson-type constructions of mutually orthogonal Latin squares32 (1980) 191–199Wojtas, M., Some new matrices-minus-diagonal and MOLS (Note) 76 (1989) 291–292Wojtas, M., Five mutually orthogonal Latin squares of orders 24 and 40140(1-3) (1995) 291–294Woldar, A.,seeG. Ebert 93 (1991) 131–142Woldar, A.J.,seeF. Lazebnik 157(1-3) (1996) 271–283Woldar, A.J.,seeF. Lazebnik 197-198(1-3) (1999) 503–513Wolf, J.K., Efficient circuits for multiplying in GF(2m) for certain values ofm 106/107(1992) 497–502Wolff, K.E., seeD. Schäfer 43 (1983) 263–271Wolfmann, J., Codes projectifs a deux ou trois poids associes aux hyperquadriques d’une geometrie finie13

(1975) 185–211Wolfmann, J., A new construction of the binary Golay code (24, 12, 8) using a group algebra over a finite field

(Communication) 31 (1980) 337–338Wolfmann, J.,seeB. Courteau 50 (1984) 179–191


Wolfmann, J., A class of doubly even self dual binary codes56 (1985) 299–303Wolfmann, J., A group algebra construction of binary even self dual codes65 (1987) 81–89Wolfmann, J., The weights of the dual code of the MELAS code over GF(3) (Communication) 74 (1989) 327–

329Wolfskill, J., seeJ.P. Brennan 67 (1987) 311–313Wolsey, L.A., A number theoretic reformulation and decomposition method for integer programming7 (1974)

393–403Wong, C.K. and P.C. Yue, A majorization theorem for the number of distinct outcomes inN independent trials

6 (1973) 391–398Wong, C.K.,seeF. Luccio 64 (1987) 209–219Wong, C.K.,seeX. Lu 184(1-3) (1998) 259–265Wong, C.S. and J.C. Masaro, A-optimal design matrices50 (1984) 295–318Wong, C.S.,seeG.-Z. Xiao 87 (1991) 181–186Wong, P.K., On the smallest graphs of girth 10 and valency 3 (Note) 43 (1983) 119–124Wong, S.A., Extending fixed vertex-colourings to total colourings177(1-3) (1997) 295–297Wongseelashote, A., Semirings and path spaces26 (1979) 55–78Wood, J.H., Is every compact code Huffman? (Note) 110(1992) 297–299Woodall, D., Preface 167-168(1-3) (1997) 1–2Woodall, D.R., A note on rank functions and integer programming17 (1977) 215–218Woodall, D.R., An impossibility theorem for electoral systems (Note) 66 (1987) 209–211Woodall, D.R., Forbidden graphs for degree and neighbourhood conditions75 (1989) 387–404Woodall, D.R., A proof of McKee’s Eulerian-bipartite characterization (Note) 84 (1990) 217–220Woodall, D.R., An inequality for chromatic polynomials101(1992) 327–331Woodall, D.R., A zero-free interval for chromatic polynomials101(1992) 333–341Woodall, D.R., Local and global proportionality102(1992) 315–328Woodall, D.R., Cycle lengths and circuit matroids of graphs105(1992) 269–273Woodall, D.R., An identity involving 3-regular graphs152(1-3) (1996) 287–293Woodall, D.R., The largest real zero of the chromatic polynomial172(1-3) (1997) 141–153Woodall, D.R.,seeO.V. Borodin 191(1-3) (1998) 45–49Woodburn, R.L., A 4-color theorem for the Klein bottle76 (1989) 271–276Woodrow, R.E.,seeJ.I. Brown 80 (1990) 123–143Wormald, N. and E.M. Wright, The exponential generating function of labelled blocks (Note) 25 (1979) 93–96Wormald, N.C., Counting unrooted planar maps36 (1981) 205–225Wormald, N.C.,seeE.A. Bender 54 (1985) 235–237Wormald, N.C.,seeE.R. Canfield 63 (1987) 117–129Wormald, N.C.,seeL.A. Székely 75 (1989) 343–372Wormald, N.C.,seeB. Jackson 162(1-3) (1996) 293–297Wormald, N.C.,seeT. Lindquester 186(1-3) (1998) 217–226Wozniak, M., A note on minimal order of a bipartite graph with exactlyq quadrilaterals 121(1993) 229–233Wozniak, M., Packing three trees150(1-3) (1996) 393–402Wozniak, M.,seeJ.-F. Saclé 164(1-3) (1997) 265–274Wozniak, M.,seeJ.-F. Saclé 165-166(1-3) (1997) 589–595Wrathall, C., The lattices of prefixes and overlaps of traces158(1-3) (1996) 231–248Wright, C.,seeN. Ray 103(1992) 67–74Wright, E.M., Two problems in the enumeration of unlabelled graphs9 (1974) 289–292Wright, E.M.,seeN. Wormald 25 (1979) 93–96Wright, P.E.,seeM. Bernstein 170(1-3) (1997) 29–39Wu, C.-K.,seeG.-Z. Xiao 87 (1991) 181–186Wu, H.,seeJ. Oxley 146(1-3) (1995) 321–324Wu, H., On contractible and vertically contractible elements in 3-connected matroids and graphs179 (1-3)

(1998) 185–203Wu, J.,seeW.D. Wallis 92 (1991) 427–429Wu, J.,seeL. Zhang 160(1-3) (1996) 291–297Wu, L., seeF.E. Bennett 84 (1990) 1–14Wu, L., seeK. Heinrich 87 (1991) 281–290


Wu, M., seeJ.R. Griggs 104(1992) 167–183Wu, P.-L.,seeK.-W. Lih 151(1-3) (1996) 155–160Wu, Q.-R.,seeE.S. Kramer 96 (1991) 101–110Wu, S.,seeJ. Yin 113(1993) 281–284Wu, W.,seeF. Cao 183(1-3) (1998) 27–38Wu, X., seeZ. Wan 177(1-3) (1997) 223–243Wynn, H.P.,seeD.Q. Naiman 120(1993) 287–289Wynn, H.P.,seeD.Q. Naiman 154(1-3) (1996) 203–216Wyss, W., Quasi-multiplication and polynomial sequences27 (1979) 317–330Xiao, G.-Z., B.-Z. Shen, C.-K. Wu and C.S. Wong, Some spectral techniques in coding theory87 (1991) 181–

186Xie, L., G. Liu and B. Xu, On endo-homology of complexes of graphs188(1-3) (1998) 285–291Xing, K. and B. Hu, On Kotzig’s conjecture for graphs with a regular path-connectedness135 (1-3) (1994)

387–393Xiong, L., Edge degree conditions for subpancyclicity in line graphs188(1-3) (1998) 225–232Xiong, R.-h.,seeZ.-x. Wan 62 (1986) 85–98Xiong, R.-h.,seeZ.-x. Wan 66 (1987) 283–288Xu, B. and H. Fan, On the fixed edge of planar graphs with minimum degree five152(1-3) (1996) 325–328Xu, B., seeL. Xie 188(1-3) (1998) 285–291Xu, B., On integral sum graphs194(1-3) (1999) 285–294Xu, B., seeZ. Zhang 195(1-3) (1999) 295–298Xu, C., A necessary and sufficient condition for a graphG with diameter 5 to be 2-diameter-stable (Note) 89

(1991) 319–324Xu, G.-H.,seeS. Negami 58 (1986) 263–268Xu, J.-M., A sufficient condition for equality of arc-connectivity and minimum degree of a digraph133 (1-3)

(1994) 315–318Xu, J.-Y.,seeW.-D. Wei 123(1993) 179–188Xu, M., seeJ. Meng 187(1-3) (1998) 161–169Xu, M.-Y., Vertex-primitive digraphs of prime-power order are hamiltonian128(1-3) (1994) 415–417Xu, M.-Y., Automorphism groups and isomorphisms of Cayley digraphs182(1-3) (1998) 309–319Xu, R., Some Ore-type conditions for the existence of connected [2,k]-factors in graphs 194(1-3) (1999) 295–

298Xu, S., Relations between parameters of a graph89 (1991) 65–88Xu, S., The chromatic uniqueness of complete bipartite graphs (Note) 94 (1991) 153–159Xu, S., Chromaticity of a family ofK4-homeomorphs (Note) 117(1993) 293–297Xu, S., Classes of chromatically equivalent graphs and polygon trees133(1-3) (1994) 267–278Xu, S., J. Liu and Y. Peng, The chromaticity ofs-bridge graphs and related graphs135(1-3) (1994) 349–358Xu, S.-J. and N.-Z. Li, The chromaticity of wheels51 (1984) 207–212Xu, S.-j., Some parameters of graph and its complement65 (1987) 197–207Xu, S.-J., Onσ -polynomials 69 (1988) 189–194Xu, Y.H., seeF.K. Hwang 66 (1987) 109–118Xuong, N.H.,seeC. Payan 27 (1979) 71–80Xuong, N.H.,seeC. Payan 49 (1984) 267–273Yamada, M., Hadamard matrices of generalized quaternion type87 (1991) 187–196Yamada, M., Supplementary difference sets and Jacobi sums103(1992) 75–90Yamasaki, Y., Shannon-like games are difficult111(1993) 481–483Yamasaki, Y., The arithmetic of reversed positional games165-166(1-3) (1997) 639–641Yan, C.H., Distributive laws for commuting equivalence relations181(1-3) (1998) 295–298Yan, C.H., Commuting quasi-order relations183(1-3) (1998) 285–292Yan, L., A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation

property 143(1-3) (1995) 293–297Yan, M.,seeB. Chen 183(1-3) (1998) 39–46Yang, B.,seeW.-D. Wei 123(1993) 151–177Yang, J.,seeD. Senato 173(1-3) (1997) 229–256Yang, J.S., The plethystic inverse of a formal power series139(1-3) (1995) 413–442


Yang, K.,seeT. Helleseth 195(1-3) (1999) 139–156Yang, K.-W., Matrixq-hypergeometric series146(1-3) (1995) 271–284Yang, M., An algorithm for computing plethysm coefficients180(1-3) (1998) 391–402Yang, Q.F., R.E. Burkard, E. Çela and G.J. Woeginger, Hamiltonian cycles in circulant digraphs with two stripes

176(1-3) (1997) 233–254Yang, S., The isomorphic factorization of complete tripartite graphsK(m, n, s) — A proof of F. Harary, R.W.

Robinson and N.C. Wormald’s conjecture145(1-3) (1995) 239–257Yang, T.Y.,seeH.H. Glover 160(1-3) (1996) 149–163Yang, W., Bell numbers andk-trees 156(1-3) (1996) 247–252Yang, X. and J.L. Massey, The condition for a cyclic code to have a complementary dual (Communication) 126

(1994) 391–393Yang, Y., On a conjecture about monochromatic flats (Note) 80 (1990) 213–216Yang, Y. and P. Rowlinson, The third Ramsey numbers for graphs with at most four edges125(1994) 399–406Yang, Y.,seeX. Lin 175(1-3) (1997) 277–282Yang, Z., OnF -Hamiltonian graphs 196(1-3) (1999) 281–286Yao, A.C.-C., On a problem of Katona on minimal separating systems15 (1976) 193–199Yao, A.C.-C.,seeR.L. Graham 23 (1978) 115–119Yao, B.,seeJ. Wang 179(1-3) (1998) 293–298Yao, F.-F.,seeR.L. Graham 23 (1978) 115–119Yao, Y.-C.,seeF.K. Hwang 160(1-3) (1996) 1–23Yap, H.P., Some remarks onE-minimal graphs 18 (1977) 87–92Yap, H.P., On graphs whose maximal subgraphs have at most two orbits37 (1981) 279–287Yap, H.P., On graphs critical with respect to edge-colourings37 (1981) 289–296Yap, H.P.,seeA.G. Chetwynd 47 (1983) 23–33Yap, H.P., Packing of graphs—A survey72 (1988) 395–404Yap, H.P., Generalization of two results of Hilton on total-colourings of a graph140(1-3) (1995) 245–252Ycart, B.,seeF. Forbes 186(1-3) (1998) 105–116Ye, C. and X. Bao, New families of adjointly unique graphs172(1-3) (1997) 155–162Ye, W.,seeE. Song 145(1-3) (1995) 343–346Yebra, J.L.A.,seeM.A. Fiol 167-168(1-3) (1997) 297–307Yebra, J.L.A.,seeE. Simó 174(1-3) (1997) 317–322Yebra, J.L.A.,seeM.A. Fiol 182(1-3) (1998) 101–111Yebra, J.L.A.,seeJ.A. Rodríguez 196(1-3) (1999) 267–275Yegnanarayanan, V.,seeR. Balakrishnan 186(1-3) (1998) 15–24Yeh, Y.N.,seeJ. Labelle 79 (1989/90) 77–93Yeh, Y.-N.,seeJ. Labelle 82 (1990) 1–6Yeh, Y.-N.,seeA.V. Ivashchenko 126(1994) 171–178Yeh, Y.-N.,seeB.E. Sagan 126(1994) 293–311Yeh, Y.-N., The generating polynomial and Euler characteristic of intersection graphs131(1-3) (1994) 325–333Yeh, Y.-N. and I. Gutman, On the sum of all distances in composite graphs135(1-3) (1994) 359–365Yehudai, Z.,seeA. Hartman 104(1992) 227–244Yeo, A.,seeJ. Bang-Jensen 162(1-3) (1996) 1–11Yeo, A.,seeG. Gutin 191(1-3) (1998) 101–107Yie, I., seeS.S. Abhyankar 133(1-3) (1994) 1–23Yin, J.,seeF.E. Bennett 103(1992) 129–137Yin, J.,seeF.E. Bennett 113(1993) 7–25Yin, J. and S. Wu, Four new BIBDs with block size seven (Note) 113(1993) 281–284Yin, J.,seeF.E. Bennett 162(1-3) (1996) 23–29Yin, J., Some combinatorial constructions for optical orthogonal codes185(1-3) (1998) 201–219Yokomura, K., A degree sum condition on hamiltonian cycles in balanced 3-partite graphs178 (1-3) (1998)

293–297Yong, X.,seeA. Kelmans 199(1-3) (1999) 251–258Yong, X.-r. and T. Acenjian, The numbers of spanning trees of the cubic cycleC3

Nand the quadruple cycleC4

N169(1-3) (1997) 293–298

Yorgov, V., The extremal codes of length 42 with automorphism of order 7190(1-3) (1998) 201–213


Yoshimura, I.,seeT. Hamada 14 (1976) 247–255Yoshizawa, M., Remarks on distance-regular graphs (Communication) 34 (1981) 93–94Younger, D.H.,seeG.B. Faulkner 7 (1974) 67–74Youngs, D.,seeO. Pretzel 88 (1991) 279–287Youngs, D.A., Gallai’s problem on Dirac’s construction101(1992) 343–350Ytrehus, Ø.,seeN. Hamada 115(1993) 175–185Yu, M.-a.,seeZ.-x. Wan 62 (1986) 85–98Yu, M.-l., seeA. Steger 120(1993) 291–295Yu, M.-l., On path factorizations of complete multipartite graphs122(1993) 325–333Yu, Q., Classifying 2-extendable generalized Petersen graphs103(1992) 209–220Yu, Q.,seeO. Chan 146(1-3) (1995) 19–32Yu, S.S.,seeH.J. Shyr 126(1994) 339–348Yu, S.S., A characterization of local regular languages184(1-3) (1998) 195–203Yu, X., On neighbourhood line graphs91 (1991) 295–309Yu, X., seeR.L. Hemminger 101(1992) 115–133Yu, X., On several symmetry conditions for graphs102(1992) 51–59Yu, X., seeM.R. Hart 102(1992) 107–108Yu, X., Ends in spanning trees (Note) 104(1992) 327–328Yu, X., Cyclomatic numbers of connected induced subgraphs105(1992) 275–284Yu, X., seeP. Hell 127(1-3) (1994) 213–220Yu, X., seeZ. Gao 182(1-3) (1998) 113–124Yu, Z., seeX. Lin 175(1-3) (1997) 277–282Yuan, J., A local reductive elimination for the fill-in of graphs147(1-3) (1995) 321–327Yuan, J.,seeS. Zhou 181(1-3) (1998) 255–266Yucas, J.,seeA. Baartmans 102(1992) 177–186Yue, B.Q.,seeG. Chartrand 197-198(1-3) (1999) 179–183Yue, P.C.,seeC.K. Wong 6 (1973) 391–398Yung-ching, C., Some results on Hu’s conjecture concerning binary trees29 (1980) 251–255Yuster, R., On packing trees into complete bipartite graphs163(1-3) (1997) 325–327Yuster, R., Independent transversals inr-partite graphs 176(1-3) (1997) 255–261Yuster, R., Linear coloring of graphs185(1-3) (1998) 293–297Zádori, L.,seeB. Larose 163(1-3) (1997) 89–99Zagler, L.,seeTh. Ströhlein 19 (1977) 183–193Zaguia, N.,seeM. Pouzet 53 (1985) 173–192Zaguia, N.,seeI. Rival 63 (1987) 249–260Zaguia, N.,seeA.H. Sharary 117(1993) 215–223Zaguia, N.,seeI. Rival 137(1-3) (1995) 303–313Zaguia, N.,seeW.-P. Liu 144(1-3) (1995) 59–66Zaker, M.,seeE.S. Mahmoodian 167-168(1-3) (1997) 451–460Zaker, M.,seeH. Hajiabolhassan 199(1-3) (1999) 233–236Zaks, J.,seeB. Grünbaum 10 (1974) 93–115Zaks, J., Non-Hamiltonian non-Grinbergian graphs17 (1977) 317–321Zaks, J., Non-Hamiltonian simple 3-polytopes having just two types of faces29 (1980) 87–101Zaks, J., Extending two theorems of A. Kotzig43 (1983) 309–315Zaks, J.,seeM. Katchalski 54 (1985) 271–284Zaks, J., Parsons graphs of matrices78 (1989) 187–193Zaks, J., Uniform distances in rational unit-distance graphs109(1992) 307–311Zaks, J.,seeJ. Czyzowicz 137(1-3) (1995) 147–153Zaks, J., Monohedrally knotted tilings of the 3-space174(1-3) (1997) 383–386Zaks, S.,seeN. Dershowitz 31 (1980) 9–28Zaks, S.,seeY. Perl 34 (1981) 153–164Zaks, S.,seeY. Shiloach 41 (1982) 57–65Zaks, S.,seeN. Dershowitz 62 (1986) 215–218Zamfirescu, C.,seeR. van Dal 159(1-3) (1996) 69–81Zamfirescu, C., Cyclic and cliquewise connectedness of line graphs170(1-3) (1997) 293–297


Zamfirescu, C.M.,seeL.W. Beineke 39 (1982) 237–254Zamfirescu, T.,seeR. van Dal 159(1-3) (1996) 69–81Zanella, C.,seeJ. Misfeld 174(1-3) (1997) 261–269Zang, W.,seeF. Tian 89 (1991) 51–63Zang, W., Generalizations of Grillet’s theorem on maximal stable sets and maximal cliques in graphs143(1-3)

(1995) 259–268Zang, W., Coloring graphs with no odd-K4 184(1-3) (1998) 205–212Zang, W., Acyclic digraphs with the Gallai–Milgram–Linial property for clique-covers199 (1-3) (1999) 183–

192Zaremba, S.K., Computing the isotropic discrepancy of point sets in two dimensions11 (1975) 79–92Zaslavsky, T., Signed graph coloring39 (1982) 215–228Zaslavsky, T., Chromatic invariants of signed graphs42 (1982) 287–312Zaslavsky, T., How colorful the signed graph?52 (1984) 279–284Zaslavsky, T., The projective-planar signed graphs113(1993) 223–247Zaslavsky, T.,seeP. Solé 128(1-3) (1994) 401–405Zaslavsky, T., Signed analogs of bipartite graphs179(1-3) (1998) 205–216Zassenhaus, H.J.,seeM.H. Dauenhauer 64 (1987) 129–146Zehavi, A.,seeA. Itai 51 (1984) 25–34Zeilberger, D., Partial difference equations inm1 >m2 > · · · >mn > 0 and their applications to combinatorics

31 (1980) 65–77Zeilberger, D., Enumeration of words by their number of mistakes (Note) 34 (1981) 89–91Zeilberger, D.,seeD.M. Bressoud 38 (1982) 313–315Zeilberger, D., A combinatorial proof of Dyson’s conjecture41 (1982) 317–321Zeilberger, D., Andre’s reflection proof generalized to the many-candidate ballot problem (Note) 44 (1983)

325–326Zeilberger, D., A combinatorial proof of Newton’s identities (Note) 49 (1984) 319Zeilberger, D., A Short hook-lengths bijection inspired by the Greene–Nijenhuis–Wilf proof51(1984) 101–108Zeilberger, D., Garsia and Milne’s bijective proof of the inclusion—exclusion principle (Note) 51 (1984) 109–

110Zeilberger, D. and D.M. Bressoud, A proof of Andrews’q-Dyson conjecture 54 (1985) 201–224Zeilberger, D., A combinatorial approach to matrix algebra56 (1985) 61–72Zeilberger, D.,seeM. Werman 58 (1986) 109Zeilberger, D., Enumerating totally clean words (Note) 64 (1987) 313–315Zeilberger, D., A Stembridge–Stanton style elementary proof of the Habsieger–Kadellq-Morris identity 79

(1989/90) 313–322Zeilberger, D., A fast algorithm for proving terminating hypergeometric identities (Communication) 80 (1990)

207–211Zeilberger, D., A bijection from ordered trees to binary trees that sends the Pruning order to the Strahler number

(Communication) 82 (1990) 89–92Zeilberger, D., A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of lengthn is 2(3n)!/((n+ 1)!(2n+ 1)!) (Communication) 102(1992) 85–93

Zeitler, H., Modifications of the “central-method” to construct Steiner Triple Systems77 (1989) 367–384Zeitler, H., About special classes of Steiner systemsS(2,4, v) 97 (1991) 399–407Zelina, M.,seeM. Plošcica 159(1-3) (1996) 191–198Zelinka, B., Regular totally domatically full graphs86 (1990) 71–79Zelinka, B., Some remarks on domination in cubic graphs158(1-3) (1996) 249–255Zemanian, A.H., Connectedness in transfinite graphs and the existence and uniqueness of node voltages142

(1-3) (1995) 247–269Zemirline, A.,seeJ. Fonlupt 45 (1983) 217–228Zemor, G.,seeG.D. Cohen 114(1993) 105–113Zemor, G., A generalisation to noncommutative groups of a theorem of Mann126(1994) 365–372Zeng, J., Un modèle symétrique pour l’identité de Al-Salam–Fields85 (1990) 207–213Zeng, J., Sur quelques propriétés de symétrie des nombres de Genocchi153(1-3) (1996) 319–333Zeng, J., Multinomial convolution polynomials160(1-3) (1996) 219–228Zeng, M.S. and Z.K. Min, Neighborhood unions and Hamiltonian properties133(1-3) (1994) 319–324


Žerovnik, J., A randomized algorithm fork-colorability 131(1-3) (1994) 379–393Žerovnik, J.,seeW. Imrich 150(1-3) (1996) 167–178Žerovnik, J.,seeW. Imrich 167-168(1-3) (1997) 393–403Žerovnik, J.,seeA. Vesel 182(1-3) (1998) 333–336Zgrablic, B., On adjacency-transitive graphs182(1-3) (1998) 321–332Zha, X., The closed 2-cell embeddings of 2-connected doubly toroidal graphs145(1-3) (1995) 259–271Zha, X., On minimum-genus embeddings149(1-3) (1996) 261–278Zha, X., Closed 2-cell embeddings of 4 cross-cap embeddable graphs162(1-3) (1996) 251–266Zhan, S., On hamiltonian line graphs and connectivity89 (1991) 89–95Zhang, C.,seeX. Lin 175(1-3) (1997) 277–282Zhang, C.-Q., Arc-disjoint circuits in digraphs41 (1982) 79–96Zhang, C.-Q., Bridges of longest cycles78 (1989) 195–211Zhang, C.-Q., Cycles of given length in someK1,3-free graphs 78 (1989) 307–313Zhang, C.-Q. and Y.-J. Zhu, Long path connectivity of regular graphs96 (1991) 151–160Zhang, C.-Q.,seeH.-J. Lai 110(1992) 179–183Zhang, C.-Q.,seeB. Alspach 111(1993) 11–17Zhang, C.-Q., Nowhere-zero 4-flows and cycle double covers154(1-3) (1996) 245–253Zhang, C.-Q.,seeM. Darrah 173(1-3) (1997) 23–33Zhang, C.-Q.,seeC.D. Savage 184(1-3) (1998) 281–287Zhang, F.,seeX. Li 94 (1991) 189–197Zhang, F. and X. Guo, Reducible chains in several types of 2-connected graphs105(1992) 285–291Zhang, F.,seeX. Li 132(1-3) (1994) 127–135Zhang, F.,seeX. Guo 135(1-3) (1994) 113–120Zhang, F. and X. Li, Hexagonal systems with forcing edges140(1-3) (1995) 253–263Zhang, F.,seeP. Hansen 176(1-3) (1997) 131–138Zhang, F. and G. Lin, When a digraph and its line digraph are connected and cospectral184(1-3) (1998) 289–

295Zhang, F.,seeB.-Y. Wang 187(1-3) (1998) 211–220Zhang, F.-j. and X.-f. Guo, Hamilton cycles in directed Euler tour graphs64 (1987) 289–298Zhang, F.-j.,seeZ.-b. Chen 68 (1988) 9–13Zhang, F.-j., X.-f. Guo and R.-s. Chen,Z-transformation graphs of perfect matchings of hexagonal systems72

(1988) 405–415Zhang, G.-H.,seeW.D. Wallis 120(1993) 191–203Zhang, G.-H., Pseudo-one-factorizations of regular graphs of odd order – II. Products of graphs128(1-3) (1994)

371–384Zhang, H.,seeX. Li 154(1-3) (1996) 297–300Zhang, H., The connectivity ofZ-transformation graphs of perfect matchings of polyominoes158(1-3) (1996)

257–272Zhang, H., Characterization of self-complementary symmetric digraphs161(1-3) (1996) 323–327Zhang, H., The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials

172(1-3) (1997) 163–173Zhang, H.,seeR.J.R. Abel 181(1-3) (1998) 1–17Zhang, K.M., Y. Manoussakis and Z.M. Song, Complementary cycles containing a fixed arc in diregular bipartite

tournaments 133(1-3) (1994) 325–328Zhang, L., L. Li and J. Wu, On the descriptive power of special Thue systems160(1-3) (1996) 291–297Zhang, P., The characteristic polynomials of subarrangements of Coxeter arrangements177(1-3) (1997) 245–

248Zhang, X.,seeL. Zhu 97 (1991) 409–417Zhang, X., Construction for indecomposable simple (v,k,λ)-BIBDs 156(1-3) (1996) 317–322Zhang, X.-D., On the spiral property of theq-derangement numbers159(1-3) (1996) 295–298Zhang, Z.,seeR. Ahlswede 85 (1990) 225–245Zhang, Z.,seeY. Alavi 100(1992) 229–233Zhang, Z.,seeC. Lin 141(1-3) (1995) 291–297Zhang, Z., Parsons graphs of matrices onZpn (Note) 148(1-3) (1996) 325–327Zhang, Z.,seeR. Ahlswede 188(1-3) (1998) 1–11


Zhang, Z., B. Xu, Y. Li and L. Liu, A note on the lower bounds of signed domination number of a graph195(1-3) (1999) 295–298

Zhang, Z., A kind of binomial identity 196(1-3) (1999) 291–298Zhao, C.,seeJ. Liu 148(1-3) (1996) 119–131Zhao, L., The kissing number of the regular polygon188(1-3) (1998) 293–296Zhao, L.-C.,seeC.-Y. Chao 45 (1983) 127–128Zhao, L.-C.,seeR.-Y. Liu 171(1-3) (1997) 169–177Zhao, S.-Y.,seeS.-T. Ting 123(1993) 117–120Zhao, S.-y.,seeS.-T. Ting 132(1-3) (1994) 317–332Zhao, Y., On the edge-reconstruction of 3-connected planar graphs with minimum valency 4137 (1-3) (1995)

333–344Zhao, Y.,seeH. Hind 190(1-3) (1998) 107–114Zheng, M. and X. Lu, On the maximum induced forests of a connected cubic graph without triangles85 (1990)

89–96Zheng, M.,seeP. Hansen 122(1993) 179–196Zheng, M.,seeP. Hansen 176(1-3) (1997) 131–138Zhizheng, Z., A binomial identity related to Calkin’s196(1-3) (1999) 287–289Zhoa, S.-Y.,seeS.-T. Ting 90 (1991) 75–84Zhongfu, Z.,seeX. Baogen 199(1-3) (1999) 285–289Zhou, B., The maximum number of cycles in the complement of a tree69 (1988) 85–94Zhou, B.,seeH.L. Abbott 100(1992) 223–228Zhou, B.,seeH.L. Abbott 132(1-3) (1994) 367–371Zhou, B.,seeH.L. Abbott 182(1-3) (1998) 3–11Zhou, H., The chromatic difference sequence of the Cartesian product of graphs90 (1991) 297–311Zhou, H., Inequalities with respect to graph homomorphism (Note) 112(1993) 295–298Zhou, H., Chromatic difference sequences and homomorphisms (Note) 113(1993) 285–292Zhou, H.,seeP. Hell 127(1-3) (1994) 213–220Zhou, H.,seeJ. Liu 132(1-3) (1994) 387–390Zhou, H.,seeJ. Liu 135(1-3) (1994) 163–168Zhou, H.,seeL. Haddad 146(1-3) (1995) 45–58Zhou, H., On the ultimate normalized chromatic difference sequence of a graph148(1-3) (1996) 287–297Zhou, H.,seeJ. Liua 170(1-3) (1997) 277–281Zhou, H., Multiplicativity of acyclic digraphs 176(1-3) (1997) 263–271Zhou, S., Matroid tree graphs and interpolation theorems137(1-3) (1995) 395–397Zhou, S. and J. Yuan, Harper-type lower bounds and the bandwidths of the compositions of graphs181 (1-3)

(1998) 255–266Zhou, S., Interpolation theorems for graphs, hypergraphs and matroids185(1-3) (1998) 221–229Zhou, S.,seeB. Chen 185(1-3) (1998) 239–243Zhou, S.,seeB. Chen 195(1-3) (1999) 81–91Zhou, S., A sequential coloring algorithm for finite sets199(1-3) (1999) 291–297Zhu, C., Some results on intersecting families of subsets184(1-3) (1998) 213–224Zhu, L., A pair of orthogonal Steiner systemsS(3, 5, 17) (Communication) 31 (1980) 111–113Zhu, L., Affinely totally variant subsets ofV3(GF(3)) (Communication) 34 (1981) 95–99Zhu, L., Orthogonal latin squares with subsquares48 (1984) 315–321Zhu, L.,seeD.R. Stinson 54 (1985) 321–328Zhu, L.,seeK. Heinrich 59 (1986) 69–78Zhu, L.,seeF.E. Bennett 65 (1987) 5–21Zhu, L.,seeF.E. Bennett 84 (1990) 1–14Zhu, L.,seeF.E. Bennett 84 (1990) 221–239Zhu, L.,seeK. Heinrich 87 (1991) 281–290Zhu, L., B. Du and X. Zhang, A few more RBIBDs withk = 5 andλ= 1 97 (1991) 409–417Zhu, L.,seeF.E. Bennett 103(1992) 129–137Zhu, L.,seeF.E. Bennett 103(1992) 139–151Zhu, L.,seeF.E. Bennett 113(1993) 7–25Zhu, L., Some recent developments on BIBDs and related designs123(1993) 189–214


Zhu, L.,seeY. Miao 143(1-3) (1995) 189–207Zhu, L.,seeF.E. Bennett 158(1-3) (1996) 11–25Zhu, L.,seeF.E. Bennett 160(1-3) (1996) 49–65Zhu, M.,seeX. Lin 175(1-3) (1997) 277–282Zhu, Q., The largest transversal numbers of uniform hypergraphs147(1-3) (1995) 271–282Zhu, Q.,seeD. Lou 148(1-3) (1996) 133–140Zhu, T.,seeD.K. Ray-Chaudhuri 106/107(1992) 399–406Zhu, X.,seeK. Böröczky 115(1993) 57–63Zhu, X.,seeP. Hell 132(1-3) (1994) 107–113Zhu, X.,seeG. Gao 152(1-3) (1996) 147–156Zhu, X., On the bounds for the ultimate independence ratio of a graph156(1-3) (1996) 229–236Zhu, X.,seeW.A. Deuber 165-166(1-3) (1997) 191–200Zhu, X., Chromatic Ramsey numbers190(1-3) (1998) 215–222Zhu, X.,seeT. Dinski 196(1-3) (1999) 109–115Zhu, Y. and C. Chen, An extreme problem concerningk-arc-cyclic property for a class of tournaments85(1990)

301–311Zhu, Y.,seeB. Jackson 102(1992) 163–176Zhu, Y. and H. Li, Hamilton cycles in regular 3-connected graphs110(1992) 229–249Zhu, Y.-j., F. Tian and X.-t. Deng, More powerful closure operations on graphs87 (1991) 197–214Zhu, Y.-J.,seeC.-Q. Zhang 96 (1991) 151–160Ziegler, G.M., The face lattice of hyperplane arrangements73 (1988/89) 233–238Ziegler, G.M.,seeB.E. Sagan 126(1994) 293–311Zijlstra, R.,seeR. Gardner 171(1-3) (1997) 121–139Zijlstra, R.,seeR. Gardner 175(1-3) (1997) 143–161Zimmermann, P., Function composition and automatic average case analysis139(1-3) (1995) 443–453Zimmermann, U.T.,seeP.J. Grabner 154(1-3) (1996) 53–62Zimmermann, Y.,seeN. Darcel 38 (1982) 53–64Zinoviev, V.,seeT. Ericson 106/107(1992) 199–207Zinoviev, V.A., Letter to the editor 28 (1979) 107Zioło, I.A., seeA.P. Wojda 165-166(1-3) (1997) 621–638Zito, J.,seeN. Dean 126(1994) 67–80Zito, J.S.,seeC.M. Fiduccia 181(1-3) (1998) 113–138Ziv, R., seeI.B.-A. Hartman 87 (1991) 41–52Zizioli, E., Embedding of incidence structures in projective spaces174(1-3) (1997) 387–395Zmazek, B.,seeS. Klavžar 156(1-3) (1996) 243–246Znám, Š., A simple characterization of disjoint covering systems12 (1975) 89–91Znám, Š., On existence and regularity of graphs with certain properties16 (1976) 83–90Znám, Š.,seeA. Rosa 128(1-3) (1994) 305–316Zolnowsky, J., A direct combinatorial proof of the Jacobi identity9 (1974) 293–298Zörnig, P., On the line graphs of the completer-partite graphs 171(1-3) (1997) 277–282Zucchello, R.,seeL. Oubiña 51 (1984) 243–249Zuker, M.,seeS.M. Tanny 9 (1974) 79–89Zuker, M.,seeS.M. Tanny 24 (1978) 299–310Žunic, J., Limit shape of convex lattice polygons having the minimalL∞ diameter w.r.t. the number of their

vertices 187(1-3) (1998) 245–254Žunic, J.D.,seeS. Matic-Kekic 150(1-3) (1996) 303–313Zurawiecki, J., Universal circuit matrix for adjacency graphs of feedback functions (Note) 126(1994) 441–445Zuther, J., Ends in digraphs184(1-3) (1998) 225–244Zverovich, I.E. and V.E. Zverovich, Contributions to the theory of graphic sequences105(1992) 293–303Zverovich, I.E., Proof of a conjecture in domination theory184(1-3) (1998) 297–298Zverovich, V.E.,seeI.E. Zverovich 105(1992) 293–303Zverovich, V.E.,seeR.I. Tyshkevich 161(1-3) (1996) 265–283Zverovich, V.E.,seeG. Gutin 190(1-3) (1998) 95–105Zvonkin, A.,seeJ. Bétréma 153(1-3) (1996) 47–58Zvonkin, A., How to draw a group? 180(1-3) (1998) 403–413

author index volumes 1–200 - connecting repositories · 2017-02-25 · author index volumes...

Documents