Volume 71,
Number 1,
September 1997
- Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Covering Regular Graphs.
1-16
- Morris Dworkin:
Factorization of the Cover Polynomial, .
17-53
- Marc Chastand:
Retracts of Infinite Hamming Graphs.
54-66
- Norbert Seifter, Vladimir Ivanovich Trofimov:
Automorphism Groups of Covering Graphs.
67-72
- David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley, Douglas B. West:
The Number of Dependent Arcs in an Acyclic Orientation.
73-78
- Robert E. L. Aldred, Carsten Thomassen:
On the Number of Cycles in 3-Connected Cubic Graphs.
79-84
- Stephen C. Locke, Feng Lou:
Finding Independent Sets inK4-Free 4-Regular Connected Graphs.
85-110
- Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota:
On the Pagenumber of Complete Bipartite Graphs.
111-120
Volume 71,
Number 2,
November 1997
- Nancy Eaton:
Intersection Representation of Complete Unbalanced Bipartite Graphs.
123-129
- Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness:
Removable Circuits in Multigraphs.
130-143
- Noga Alon, Yair Caro, Raphael Yuster:
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
144-161
- Miguel Angel Fiol, E. Carriga:
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.
162-183
- Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs.
184-204
- Norbert Seifter, Vladimir Ivanovich Trofimov:
Automorphism Groups of Graphs with Quadratic Growth.
205-210
- Carsten Thomassen:
Chords of Longest Cycles in Cubic Graphs.
211-214
- Dirk L. Vertigan, Geoffrey P. Whittle:
A 2-Isomorphism Theorem for Hypergraphs.
215-230
- Yuh-jeng Liang, Chih-Wen Weng:
Parallelogram-Free Distance-Regular Graphs.
231-243
- Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan:
Unavoidable Minors of Large 3-Connected Matroids.
244-293
- Tibor Jordán:
A Note on the Vertex-Connectivity Augmentation Problem.
294-301
Copyright © Fri Dec 4 20:33:01 2009
by Michael Ley (ley@uni-trier.de)
