Journal: Journal of Combinatorial Theory, Series A

Volume 36, Issue 3

221 -- 239András Frank. Finding feasible vectors of Edmonds-Giles polyhedra
240 -- 243Peter M. Gibson. A bound for the number of tournaments with specified scores
244 -- 268Thomas W. Tucker. A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs
253 -- 278Neal Brand, W. Cary Huffman. Topological Invariants of 2-Designs Arising from Difference Families
269 -- 275Thomas W. Tucker. There is one group of genus two
276 -- 283Edward A. Bender, L. Bruce Richmond. The asymptotic enumeration of rooted convex polyhedra
279 -- 306John G. Kemeny. Matrix Representation for Combinatorics
284 -- 297Ján Plesník. A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
298 -- 309Michael O. Albertson, Karen L. Collins. Duality and perfection for edges in cliques
307 -- 314Giorgio Faina. The B-Ovals of Order q <= 8
315 -- 331Andrea Brini. Higher Dimensional Recursive Matrices and Diagonal Delta Sets of Series
332 -- 341Eiichi Bannai, Aart Blokhuis, J. J. Seidel, Philippe Delsarte. An Addition Formula for Hyperbolic Space
342 -- 354Fan R. K. Chung. The Number of Different Distances Determined by n Points in the Plane
355 -- 363Douglas A. Leonard. Parameters of Association Schemes That Are Both P- and Q-Polynomial
364 -- 372Michael Klemm. Über die Wurzelschranke für das Minimalgewicht von Codes
373 -- 376Douglas R. Stinson. A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six

Volume 36, Issue 2

125 -- 134Anthony J. W. Hilton. Hamiltonian decompositions of complete graphs
129 -- 162Robert Roth, Dwijendra K. Ray-Chaudhuri. Hall Triple Systems and Commutative Moufang Exponent 3 Loops: The Case of Nilpotence Class 2
135 -- 155Václav Koubek, Vojtech Rödl. On the minimum order of graphs with given semigroup
156 -- 160Henry A. Kierstead. On the chromatic index of multigraphs without large triangles
161 -- 188William H. Cunningham. Testing membership in matroid polyhedra
163 -- 173A. Hedayat, H. L. Hwang. Construction of BIB Designs with Various Support Sizes--with Special Emphasis for v = 8 and k = 4
174 -- 182Arthur M. Hobbs. Packing Sequences
183 -- 203Marshall Hall Jr., John Wilkinson. Ternary and Binary Codes for a Plane of Order 12
189 -- 193Seiya Negami. Uniquely and faithfully embeddable projective-planar triangulations
194 -- 212Albert L. Wells Jr.. Even signings, signed switching classes, and (-1, 1)-matrices
204 -- 213Michio Ozeki. A Matrix Partition Problem
213 -- 217Luis Montejano, Victor Neumann-Lara. A variation of Menger s theorem for long paths
214 -- 220Tom C. Brown, J. P. Buhler. Lines Imply Spaces in Density Ramsey Theory
218 -- 219Han-Kun Ma. A counterexample to the conjecture of Aksionov and Mel nikov on non-3-colorable planar graphs
221 -- 229R. J. M. Dawson. On Filling Space with Different Integer Cubes
230 -- 236Peter Frankl, Zoltán Füredi. On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices
237 -- 239Saul Stahl. Permutations and Riemann Surfaces
240 -- 244Aart Blokhuis, Clement W. H. Lam. More Coverings by Rook Domains
245 -- 248Ronald D. Baker. Orthogonal Line Packings of PG::2m-1::(2)
249 -- 252Frank W. Schmidt, Rodica Simion. On a Partition Identity

Volume 36, Issue 1

1 -- 15Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu. On optimal embeddings of metrics in graphs
1 -- 14Don Rawlings. Enumeration of Permutations by Descents, Idescents, Imajor Index, and Basic Components
15 -- 22Rodica Simion. A Multiindexed Sturm Sequence of Polynomials and Unimodality of Certain Combinatorial Sequences
16 -- 25Nathan Linial. Graph decompositions without isolates
23 -- 55B. A. Anderson, Paul J. Schellenberg, Douglas R. Stinson. The Existence of Howell Designs of Even Side
26 -- 31Paul H. Edelman. The acyclic sets of an oriented matroid
32 -- 48Jean-Claude Bermond, Charles Delorme, G. Farhi. Large graphs with given degree and diameter. II
49 -- 64Neil Robertson, Paul D. Seymour. Graph minors. III. Planar tree-width
56 -- 65Mike J. Grannell, Terry S. Griggs. Product Constructions for Cyclic Block Designs. I. Steiner Quadruple Systems
65 -- 84Peter Hoffman, Bruce Richter. Embedding graphs in surfaces
66 -- 72Frank K. Hwang, Qin De Kang, Jia En Yu. Complete Balanced Howell Rotations for 16k + 12 Partnerships
73 -- 91A. Hedayat, H. L. Hwang. BIB(8, 56, 21, 3, 6) and BIB(10, 30, 9, 3, 2) Designs with Repeated Blocks
85 -- 94Tomio Hirata, Kiyohito Kubota, Osami Saito. A sufficient condition for a graph to be weakly ::::k::::-linked
92 -- 100R. B. McFeat, Arnold Neumaier. Some Tuple System Constructions with Applications to Resolvable Designs
95 -- 112Tiong Seng Tay. Rigidity of multi-graphs. I. Linking rigid bodies in ::::n::::-space
101 -- 104Jacob E. Goodman, Richard Pollack. On the Number of k-Subsets of a Set of n Points in the Plane
105 -- 110J. D. Key, Ernest E. Shult. Steiner Triple Systems with Doubly Transitive Automorphism Groups: A Corollary to the Classification Theorem for Finite Simple Groups
111 -- 115Richard J. Turyn. A Special Class of Williamson Matrices and Difference Sets
113 -- 117Ron Aharoni. Matchings in graphs of size ::::N::::::1::
116 -- 123R. T. Curtis. Eight Octads Suffice
118 -- 123Yanpei Liu. On the number of rooted ::::c::::-nets
124 -- 127Jerrold R. Griggs, Jürgen Stahl, William T. Trotter. A Sperner Theorem on Unrelated Chains of Subsets