Journal: Journal of Combinatorial Theory, Series A

Volume 27, Issue 3

223 -- 253Alan P. Sprague. A Characterization of 3-nets
231 -- 236Maurice Pouzet. Note sur le problème de Ulam
237 -- 253Guy Giraud. Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
254 -- 259A. G. Thomason. Critically partitionable graphs, I
260 -- 273Laurence R. Matthews. Infinite subgraphs as matroid circuits
263 -- 268Ernst Snapper. Quadratic Spaces over Finite Fields and Codes
269 -- 281W. G. Bridges, R. A. Mena. Multiplicative Designs II. Uniform Normal and Related Structures
274 -- 293Eiichi Bannai, Tatsuro Ito. On the spectra of certain distance-regular graphs
282 -- 288Andrzej Ehrenfeucht, Jan Mycielski. On k-Stable Functions
289 -- 306Jeffrey S. Leon. An Algorithm for Computing the Automorphism Group of a Hadamard Matrix
294 -- 319Stephen B. Maurer. Vertex colorings without isolates
307 -- 324E. F. Assmus Jr., Jack H. van Lint. Ovals in Projective Designs
320 -- 331Frank Bernhart, Paul C. Kainen. The book thickness of a graph
325 -- 332Daniel I. A. Cohen. Some Sieves for Partition Theory
332 -- 370Henry H. Glover, John Philip Huneke, Chin San Wang. 103 Graphs that are irreducible for the projective plane
333 -- 341R. Razen, Jennifer Seberry, K. Wehrhahn. Ordered Partitions and Codes Generated by Circulant Matrices
342 -- 355Albert L. Wells Jr.. On the Separation Power and the Completion of Partial Latin Squares
356 -- 359Albert Nijenhuis, Herbert S. Wilf. The Enumeration of Connected Graphs and Linked Diagrams
360 -- 364Robert Donaghey. Two Transformations of Series That Commute with Compositional Inversion
365 -- 366David Brent Anderson. Update on the No-Three-in-Line Problem
367 -- 370J. Glaz. The Number of Dense Arrangements
371 -- 375Frank K. Hwang. Crisscross Latin Squares
376 -- 377Harold Fredricksen. Schur Numbers and the Ramsey Numbers N(3, 3, ..., 3; 2)
378 -- 381Mieko Yamada. On the Williamson Type j Matrices of Orders 4.29, 4.41, and 4.37
382 -- 384Diana Schmidt. A Partition Theorem for Ordinals
385 -- 387Joseph A. Thas. A Restriction on the Parameters of a Suboctagon
388 -- 391Tsuyoshi Atsumi. An Extension of Cameron s Result on Block Schematic Steiner Systems
392 -- 393Dana S. Richards. On a Theorem of Chorneyko and Mohanty
394 -- 396C. L. Mallows. Baxter Permutations Rise Again
397 -- 400G. W. Peck. Maximum Antichains of Rectangular Arrays
401 -- 403Joel Spencer. All Finite Configurations are Almost Ramsey
404 -- 406E. T. Parker, R. B. Killgrove. A Planar Latin Square Lacking Automorphism
407 -- 408Donald Quiring. A Construction of Disjoint Steiner Triple Systems

Volume 27, Issue 2

109 -- 121Edgar M. Palmer, Allen J. Schwenk. On the number of trees in a random forest
121 -- 151Francis Buekenhout. Diagrams for Geometries and Groups
122 -- 129M. J. Rigby, Roger B. Mallion. On the eigenvalues and eigenvectors of certain finite, vertex-weighted, bipartite graphs
130 -- 150Kenneth Appel, Wolfgang Haken, Jean Mayer. Triangulation a v5 séparés dans le problème des quatre couleurs
151 -- 159Jack E. Graver. The imbedding index of a graph
152 -- 160Rozália Juhász. Ramsey Type Theorems in the Plane
160 -- 167C. C. Chen, H. H. Teh. Constructions of point-colour-symmetric graphs
161 -- 180Michael Holz, Klaus-Peter Podewski, Karsten Steffens. Hall Families and the Marriage Problem
168 -- 179Robert E. Woodrow. There are four countable ultrahomogeneous graphs without triangles
180 -- 189László Babai. Spectra of Cayley graphs
181 -- 185F. M. Dekking. Strongly Non-Repetitive Sequences and Progression-Free Sets
186 -- 197Ethan M. Coven, G. A. Hedlund. Periods of Some Nonlinear Shift Registers
190 -- 197Eva Nosal. Partition relations for denumerable ordinals
198 -- 201Edward F. Schmeichel, Gary S. Bloom. Connectivity, genus, and the number of components in vertex-deleted subgraphs
198 -- 212Eric Verheiden. Integral and Rational Completions of Combinatorial Matrices II
202 -- 215Thomas Andreae. Über eine eigenschaft lokalfiniter, unendlicher bäume
213 -- 217Gil Kalai. A Note on an Evaluation of Abel Sums
216 -- 224Hien Q. Nguyen. Constructing the free erection of a geometry
218 -- 221Uri Leron, Gadi Moran. The Full Cycles in a Young Coset
225 -- 227Jaroslav Nesetril, Vojtech Rödl. A short proof of the existence of highly chromatic hypergraphs without short cycles
228 -- 229F. Stersoul. A characterization of the graphs in which the transversal number equals the matching number

Volume 27, Issue 1

1 -- 9Raymond Balbes. On Counting Sperner Families
1 -- 12Sami Beraha, Joseph Kahane. Is the four-color conjecture almost false?
10 -- 18Bruce E. Sagan. An Analog of Schensted s Algorithm for Shifted Young Tableaux
13 -- 41Siddani Bhaskara Rao. Solution of the Hamiltonian problem for self-complementary graphs
19 -- 32Neil Hindman. Partitions and Sums of Integers with Repetition
33 -- 37Michael D. Hirschhorn. Some Partition Theorems of the Rogers-Ramanujan Type
38 -- 49Jim Totten. A Classification of Linear Spaces Based on Quadrangles, II
42 -- 48Paul A. Catlin. Brooks graph-coloring theorem and the independence number
49 -- 59Claude A. Christen, Stanley M. Selkow. Some perfect coloring properties of graphs
50 -- 63D. R. Breach. The 2-(9, 4, 3) and 3-(10, 5, 3) Designs
60 -- 66T. A. McKee. A self-dual language for graph theory
64 -- 68David M. Bressoud. A Generalization of the Rogers-Ramanujan Identities for all Moduli
67 -- 74Edward Howorka. On metric properties of certain clique graphs
69 -- 84W. G. Bridges, R. A. Mena. Multiplicative Designs I: The Normal and Reducible Cases
75 -- 86E. J. Farrell. An introduction to matching polynomials
85 -- 99Noboru Ito. On a Conjecture of C. W. Norman, I
87 -- 91Daniel I. A. Cohen. On the combinatorial antipodal-point lemmas
92 -- 107Saul Stahl. Self-dual embeddings of Cayley graphs
100 -- 118Judith Q. Longyear. Order 24 Hadamard Matrices of Character at Least 3
119 -- 0Masao Kiyota. An Inequality for Finite Permutation Groups