Volume 146,
Numbers 1-3,
November 1995
- Charles A. Akemann, Joel Anderson:
The continuous Beck-Fiala theorem is optimal.
1-9
- Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz:
Dominating cycles in bipartite biclaw-free graphs.
11-18
- Onn Chan, C. C. Chen, Qinglin Yu:
On 2-extendable abelian Cayley graphs.
19-32
- Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier:
On graphs without P5 and P5_.
33-44
- L. Haddad, H. Zhou:
Star chromatic numbers of hypergraphs and partial Steiner triple systems.
45-58
- Noboru Hamada, Tor 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, 1 <= µ < k-1) meeting the Griesmer bound.
59-67
- Olof Heden:
On Bruen chains.
69-96
- D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin:
Near subgroups of groups.
97-108
- Mirko Hornák, Rudolf Lauff, Roman Sotak:
On existence of hypergraphs with prescribed edge degree profile.
109-121
- Rosa Huang:
Muir's identity - A supersymmetric approach.
123-131
- Hong-Jian Lai:
Supereulerian graphs and excluded induced minors.
133-143
- Hao Li:
Circumferences in 1-tough graphs.
145-151
- Petr Lisonek:
Local and global majorities revisited.
153-158
- Scott P. Nudelman:
The modular n-queens problem in higher dimensions.
159-167
- Andrew M. Odlyzko, W. D. Smith:
Nonabelian sets with distinct k-sums.
169-177
- B. S. Panda, S. P. Mohanty:
Intersection graphs of vertex disjoint paths in a tree.
179-209
- Pascal Préa:
Distance sequences in infinite regular tessellations.
211-233
- Michel Serfati:
Boolean differential equations.
235-246
- Julian West:
Generating trees and the Catalan and Schröder numbers.
247-262
- John E. Wetzel:
Regular dissections of an infinite strip.
263-269
- Kung-Wei Yang:
Matrix q-hypergeometric series.
271-284
- Paul Boisen:
Polynomials and packings: A new proof of de Bruijn's theorem.
285-287
- J. A. Bondy:
A short proof of the Chen-Manalastas theorem.
289-292
- Richard A. Brualdi, Amélia Fonseca:
On the quasi-transversals of a matroid.
293-297
- Wendy Chan:
An exchange property of matroid.
299-302
- Ciping Chen:
Binding number and toughness for matching extension.
303-306
- J. D. Fanning:
A family of symmetric designs.
307-312
- Ruben Michel, Gadi Taubenfeld, Andrew Berman:
A connection between random variables and latin k-cubes.
313-320
- James G. Oxley, Haidong Wu:
On matroid connectivity.
321-324
- Margit Voigt:
A not 3-choosable planar graph without 3-cycles.
325-328
Copyright © Fri Mar 19 20:08:48 2010
by Michael Ley (ley@uni-trier.de)