Volume 212,
Numbers 1-2,
February 2000
- Jens-P. Bode, Heiko Harborth:
Hexagonal polyomino achievement.
5-18
- Mieczyslaw Borowiecki, Izak Broere, Peter Mihók:
Minimal reducible bounds for planar graphs.
19-27
- Gilles Caporossi, Pierre Hansen:
Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system.
29-44
- Dragos Cvetkovic:
On the reconstruction of the characteristic polynomial of a graph.
45-52
- Walter A. Deuber, Alexandr V. Kostochka:
On degrees of vertices in paradoxical trees.
53-59
- Igor Fabrici, Erhard Hexel, Stanislav Jendrol, Hansjoachim Walther:
On vertex-degree restricted paths in polyhedral graphs.
61-73
- Patrick W. Fowler, Arnout Ceulemans, Liviu F. Chibotaru:
Eigenvalues of Hückel systems of equivalent points.
75-90
- Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo:
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
91-100
- Mirko Hornák, Stanislav Jendrol:
On vertex types and cyclic colourings of 3-connected plane graphs.
101-109
- Stanislav Jendrol, Heinz-Jürgen Voss:
A local property of polyhedral maps on compact two-dimensional manifolds.
111-120
- Antoni Marczyk, Günter Schaar:
On traceable powers of digraphs.
121-128
- Mariusz Meszka, Zdzislaw Skupien:
On some third parts of nearly complete digraphs.
129-139
- Ingo Schiermeyer, Zsolt Tuza, Margit Voigt:
On-line rankings of graphs.
141-147
- Jerzy Topp, Preben D. Vestergaard:
alphak- and gammak-stable graphs.
149-160
- Walter Wessel:
A short solution of Heawood's empire problem on the torus and implications for higher genus.
161-165
Volume 212,
Number 3,
February 2000
Copyright © Sun Dec 20 22:59:19 2009
by Michael Ley (ley@uni-trier.de)
