Volume 47,
Number 1,
August 1989
- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and hamiltonian properties in graphs.
1-9
- Achim Bachem, Alfred Wanka:
Euclidean intersection properties.
10-19
- Charles J. Colbourn, William R. Pulleyblank:
Matroid Steiner problems, the Tutte polynomial and network reliability.
20-31
- Thomas Zaslavsky:
Biased graphs. I. Bias, balance, and gains.
32-52
- Allen J. Schwenk:
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs.
53-59
- Marston Conder, Peter Lorimer:
Automorphism groups of symmetric graphs of valency 3.
60-72
- Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree.
73-79
- Geoff Whittle:
Dowling group geometries and the critical problem.
80-92
- Jean-Pierre Roudneff, Marc Wagowski:
Characterizations of ternary matroids in terms of circuit signatures.
93-106
- Komei Fukuda, Akihisa Tamura:
Characterizations of *-families.
107-110
- Christophe Champetier:
Kernels in some orientations of comparability graphs.
111-113
- Noga Alon, Nathan Linial:
Cycles of length 0 modulo k in directed graphs.
114-119
- Kazumasa Nomura:
On local structure of a distance-regular graph of Hamming type.
120-123
Volume 47,
Number 2,
October 1989
- Andrew D. Barbour, Michal Karonski, Andrzej Rucinski:
A central limit theorem for decomposable random variables with applications to random graphs.
125-145
- Yahya Ould Hamidoune, Isabelle Salaün:
On the independence numbers of a matroid.
146-152
- Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems.
153-161
- Mohamed M. El-Zahar, Norbert Sauer:
The indivisibility of the homogeneous Kn-free graphs.
162-170
- Min Aung:
Longest cycles in triangle-free graphs.
171-186
- Stephan Olariu:
The Strong Perfect Graph Conjecture for pan-free graphs.
187-191
- Robert M. Freund:
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron.
192-219
- Akira Saito:
Long cycles through specified vertices in a graph.
220-230
- John A. Hertz:
Slender graphs.
231-236
- Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao:
A generalization of a result of Häggkvist and Nicoghossian.
237-243
- Henry Meyniel, Stephan Olariu:
A new conjecture about minimal imperfect graphs.
244-247
Volume 47,
Number 3,
December 1989
Copyright © Sat Nov 14 06:05:21 2009
by Michael Ley (ley@uni-trier.de)