Volume 95,
Number 1-3,
July 1999
- Rudolf Ahlswede, Zhen Zhang:
On Maximal Shadows of Members in Left-compressed Sets.
3-9
Electronic Edition (link) BibTeX
- Luitpold Babel, Stephan Olariu:
On the p-connectedness of Graphs - A Survey.
11-33
Electronic Edition (link) BibTeX
- Gunter Bär:
On the Complexity of Linear Programming in the BSS-model.
35-40
Electronic Edition (link) BibTeX
- Jørgen Bang-Jensen, Gregory Gutin:
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
41-60
Electronic Edition (link) BibTeX
- Jørgen Bang-Jensen, Yubao Guo, Anders Yeo:
A New Sufficient Condition for a Digraph to Be Hamiltonian.
61-72
Electronic Edition (link) BibTeX
- Frank E. Bennett:
A Brief Survey of Perfect Mendelsohn Packing and Covering Designs.
73-81
Electronic Edition (link) BibTeX
- Anton Betten, Dieter Betten:
The Proper Linear Spaces on 17 Points.
83-108
Electronic Edition (link) BibTeX
- Anton Betten, Reinhard Laue, Alfred Wassermann:
Simple 8-(40, 11, 1440) Designs.
109-114
Electronic Edition (link) BibTeX
- Christian Bey:
The Erdos-Ko-Rado Bound for the Function Lattice.
115-125
Electronic Edition (link) BibTeX
- Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs.
127-140
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Van Bang Le:
Tree- and Forest-perfect Graphs.
141-162
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Peter L. Hammer:
On the Stability Number of Claw-free P5-free and More General Graphs.
163-167
Electronic Edition (link) BibTeX
- E. Rodney Canfield, Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.
169-180
Electronic Edition (link) BibTeX
- Serafino Cicerone, Gabriele Di Stefano:
On the Extension of Bipartite to Parity Graphs.
181-195
Electronic Edition (link) BibTeX
- Serafino Cicerone, Gabriele Di Stefano:
Graph Classes Between Parity and Distance-hereditary Graphs.
197-216
Electronic Edition (link) BibTeX
- Dietmar Cieslik:
The Steiner Ratio of lamdad2k.
217-221
Electronic Edition (link) BibTeX
- Feodor F. Dragan:
Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS.
223-239
Electronic Edition (link) BibTeX
- Fedor V. Fomin:
Note on a Helicopter Search Problem on Graphs.
241-249
Electronic Edition (link) BibTeX
- Martin Grüttmüller:
On the PBD-closure of Sets Containing 3.
251-272
Electronic Edition (link) BibTeX
- Yubao Guo:
Outpaths in Semicomplete Multipartite Digraphs.
273-277
Electronic Edition (link) BibTeX
- Heiko Harborth, Meinhard Möller:
Weakened Ramsey Numbers.
279-284
Electronic Edition (link) BibTeX
- L. H. Harper:
On an Isoperimetric Problem for Hamming Graphs.
285-309
Electronic Edition (link) BibTeX
- Sven Hartmann:
Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs.
311-320
Electronic Edition (link) BibTeX
- Wilfried Imrich, Sandi Klavzar:
Recognizing Graphs of Acyclic Cubical Complexes.
321-330
Electronic Edition (link) BibTeX
- Dieter Jungnickel, Alexander Pott:
Perfect and Almost Perfect Sequences.
331-359
Electronic Edition (link) BibTeX
- Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi:
On Trades: An Update.
361-376
Electronic Edition (link) BibTeX
- Uwe Leck, Volker Leck:
Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter.
377-388
Electronic Edition (link) BibTeX
- Ali Ridha Mahjoub, Charles Nocq:
On the Linear Relaxation of the 2-node Connected Subgraph Polytope.
389-416
Electronic Edition (link) BibTeX
- Ingrid Mengersen, Jörg Oeckermann:
Matching-star Ramsey Sets.
417-424
Electronic Edition (link) BibTeX
- Kari J. Nurmela, Patric R. J. Östergård:
Covering t-sets with (t+2)-sets.
425-437
Electronic Edition (link) BibTeX
- Ulrike Schumacher:
Suborthogonal Double Covers of the Complete Graph by Stars.
439-444
Electronic Edition (link) BibTeX
- Peter Tittmann:
Partitions and Network Reliability.
445-453
Electronic Edition (link) BibTeX
- Annegret Wagler:
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.
455-466
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:13 2009
by Michael Ley (ley@uni-trier.de)