Journal: Journal of Combinatorial Theory, Series A

Volume 80, Issue 2

175 -- 195William Y. C. Chen, Zhi-Guo Liu. Parameter Augmentation for Basic Hypergeometric Series, II
179 -- 201John Maharry. A Characterization of Graphs with No Cube Minor
196 -- 217Dudley Stark, Nicholas C. Wormald. Asymptotic Enumeration of Convex Polygons
202 -- 217Alexander A. Ageev, Alexandr V. Kostochka. Vertex Set Partitions Preserving Conservativeness
218 -- 231Anie Chaderjian. New Classes of Residue Supplementary Difference Systems
218 -- 224Carsten Thomassen. Chromatic Roots and Hamiltonian Paths
225 -- 246János Pach, Géza Tóth. Which Crossing Number Is It Anyway?
232 -- 246Xiang-dong Hou, Philippe Langevin. Results on Bent Functions
247 -- 257Hirobumi Mizuno, Iwao Sato. Zeta Functions of Graph Coverings
247 -- 256Eli Bar-Yahalom, Tuvi Etzion. Intersection of Isomorphic Linear Codes
257 -- 272Miklós Bóna. Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
258 -- 276Gregory L. Cherlin, Brenda J. Latka. Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments
273 -- 282Yutaka Hiramine. On Three-Dimensional Schur Rings Obtained from Partial Spreads
277 -- 319J. D. Skinner II, C. A. B. Smith, W. T. Tutte. On the Dissection of Rectangles into Right-Angled Isosceles Triangles
283 -- 289John C. Cock, Patric R. J. Östergård. Ternary Covering Codes Derived from BCH Codes
290 -- 294Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige. Every Graph Is an Integral Distance Graph in the Plane
295 -- 340Ian P. Goulden, D. M. Kulkarni. Multivariable Lagrange Inversion, Gessel-Viennot Cancellation, and the Matrix Tree Theorem
309 -- 319G. F. Clements. Characterizing Profiles ofk-Families in Additive Macaulay Posets
320 -- 345Béla Bollobás, Luke Pebody, Oliver Riordan. Contraction-Deletion Invariants for Graphs
320 -- 333Charles J. Colbourn, Jeffrey H. Dinitz. Complete Arcs in Steiner Triple Systems
334 -- 338Zvonimir Janko. The Existence of Symmetric Designs with Parameters (189, 48, 12)
346 -- 355Alexander Schrijver. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
347 -- 352Siu Lun Ma, Bernhard Schmidt. A Sharp Exponent Bound for McFarland Difference Sets withp=2
353 -- 355Jack H. van Lint. On the Number of Blocks in a Generalized Steiner System
356 -- 363Heiko Harborth, Silke Maasberg. Rado Numbers fora(x+y)=bz
356 -- 370Yuanqiu Huang, Yanpei Liu. Face Size and the Maximum Genus of a Graph 1. Simple Graphs
364 -- 366Eurípides Alves Da Silva. A New Monohedral Hexamorphic Prototile
367 -- 373Yair Caro. Binomial Coefficients and Zero-Sum Ramsey Numbers
374 -- 379Jörg Rambau. A Suspension Lemma for Bounded Posets
380 -- 384Dominique Foata, Doron Zeilberger. A Classic Proof of a Recurrence for a Very Classical Sequence
385 -- 544Andrzej Dabrowski. On Some Combinatorial Result in the Theory of Automorphic Pseudo-differential Operators
388 -- 393Henk D. L. Hollmann, János Körner, Simon Litsyn. Tiling Hamming Space with Few Spheres

Volume 80, Issue 1

1 -- 31Frédéric Havet. Oriented Hamiltonian Cycles in Tournaments
1 -- 12Michael G. Neubauer, William Watkins, Joel Zeitlin. Maximalj-Simplices in the Reald-Dimensional Unit Cube
13 -- 78James A. Davis, Jonathan Jedwab. A Unifying Construction for Difference Sets
32 -- 48Matthias Kriesell. Contractible Subgraphs in 3-Connected Graphs
49 -- 56Jeong Han Kim, Boris Pittel. On Tail Distribution of Interpost Distance
57 -- 68James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle. On the Excluded Minors for Quaternary Matroids
69 -- 79Ya-Chen Chen. Kneser Graphs Are Hamiltonian For ::::n::::ge::::3k::::
79 -- 105Louis J. Billera, Richard Ehrenborg, Margaret Readdy. Thec-2d-Index of Oriented Matroids
80 -- 97Jaroslav Nesetril, Claude Tardif. Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)
98 -- 103Nancy Eaton. A Near Packing of Two Graphs
106 -- 123Michael Reid. Tiling Rectangles and Half Strips with Congruent Polyominoes
122 -- 129Andrew M. Robertshaw, Douglas R. Woodall. Triangles and Neighbourhoods of Independent Sets in Graphs
124 -- 150Edward A. Bender, E. Rodney Canfield, Brendan D. McKay. The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices
130 -- 146David D. Gebhard, Bruce E. Sagan. Sinks in Acyclic Orientations of Graphs
147 -- 155Jaroslav Nesetril, André Raspaud. Colored Homomorphisms of Colored Mixed Graphs
151 -- 157Paul-Hermann Zieschang. On Maximal Closed Subsets in Association Schemes
156 -- 171Atsushi Kaneko, Katsuhiro Ota. On Minimally (n, )-Connected Graphs
158 -- 162Christos A. Athanasiadis. A Class of Labeled Posets and the Shi Arrangement of Hyperplanes
163 -- 165Anders Björner, Lynne M. Butler, Andrey O. Matveev. Note on a Combinatorial Application of Alexander Duality
166 -- 173Vojtech Rödl, Lubos Thoma. On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems