Journal: Graphs and Combinatorics

Volume 2, Issue 1

1 -- 8Brian Alspach, Moshe Rosenfeld. On Hamilton decompositions of prisms over simple 3-polytopes
9 -- 13Tetsuo Asano. Generating and counting valid patterns in routes between two points
15 -- 20Bhagwandas, Sanpei Kageyama, Rahul Mukerjee. Symmetry and classification of certain regular group divisible designs
21 -- 29A. E. Brouwer. 22
31 -- 36Fan R. K. Chung, Peter C. Fishburn, Victor K. Wei. Monotone subsequences in (0, 1)-matrices
37 -- 42Hikoe Enomoto. k-factors. II
43 -- 53P. D. Johnson, D. G. Rogers. Compatible additive permutations of finite integral bases
55 -- 60Péter Komjáth, Vojtech Rödl. Coloring of universal graphs
61 -- 66Pierre Fraisse, Pavol Hell, David G. Kirkpatrick. f-factors in directed and undirected multigraphs
67 -- 80Zoltán Füredi. t-wise intersecting hypergraphs
81 -- 87Jennifer Seberry. A new construction for Williamson-type matrices
89 -- 92Zoltán Füredi. The chromatic index of simple hypergraphs
95 -- 100Noga Alon. r-graphs
101 -- 112Laura M. Chihara, Dennis Stanton. Association schemes and quadratic transformations for orthogonal polynomials
113 -- 121Paul Erdös, Peter Frankl, Vojtech Rödl. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
123 -- 134Péter L. Erdös, Gyula O. H. Katona. Convex hulls of more-part Sperner families
135 -- 144Peter Frankl, Vojtech Rödl. 4
145 -- 164Yiming Hong. q ≥ 3
165 -- 172Zbigniew Palka. Rulers and slaves in a random social group
173 -- 177László Pyber. How to find many counterfeit coins?
179 -- 187Mieko Yamada. Hadamard matrices generated by an adaptation of generalized quaternion type array
189 -- 190P. Erdös. Two problems in extremal graph theory
191 -- 200Francis T. Boesch, Helmut Prodinger. Spanning tree formulas and chebyshev polynomials
201 -- 208Izak Broere, Marieta Burger. Uniquely cocolourable graphs
209 -- 221Amanda G. Chetwynd, Anthony J. W. Hilton. Critical star multigraphs
223 -- 225Yoshimi Egawa, Hikoe Enomoto, Akira Saito. On component factors
227 -- 231Wenceslas Fernandez de la Vega. Induced trees in sparse random graphs
233 -- 246Yoji Kajitani, Akio Ishizuka, Shuichi Ueno. Characterization of partial 3-trees in terms of three structures
247 -- 257Hiroshi Kimura, Hiroyuki Ohmori. Construction of hadamard matrices of order 28
259 -- 267Akihiro Munemasa. t-Designs in the association schemes of alternating bilinear forms
269 -- 275Jaroslav Nesetril, Vojtech Rödl. On sets of integers with the Schur property
277 -- 282Ryuzaburo Noda. On orthogonal arrays of strength 3 and 5 achieving Rao's bound
283 -- 286Dennis Stanton. t-designs in classical association schemes
287 -- 308Eiichi Bannai, Tatsuro Ito. Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I
309 -- 316A. E. Brouwer, A. Robert Calderbank. An Erdös-Ko-Rado theorem for regular intersecting families of octads
317 -- 337Charles J. Colbourn, Alexander Rosa. Quadratic leaves of maximal partial triple systems
339 -- 346J. Csima, Zoltán Füredi. Colouring finite incidence structures
347 -- 350Peter Horák, Jozef Sirán. On a construction of Thomassen
351 -- 356Bruce M. Landman. Generalized van der Waerden numbers
357 -- 361Jaroslav Nesetril, Vojtech Rödl. Finite union theorem with restrictions
363 -- 381Ákos Seress. Quick gossiping without duplicate transmissions