Volume 95,
Number 1,
September 2005
- Raphael Yuster:
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions.
1-11
- József Balogh, Peter Keevash, Benny Sudakov:
Disjoint representability of sets and their complements.
12-28
- József Balogh, Béla Bollobás, David Weinreich:
A jump to the bell number for hereditary graph properties.
29-48
- Giacomo Zambelli:
A polynomial recognition algorithm for balanced matrices.
49-67
- V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft:
Deeply asymmetric planar graphs.
68-78
- Sang-il Oum:
Rank-width and vertex-minors.
79-100
- János Körner, Concetta Pilotto, Gábor Simonyi:
Local chromatic number and Sperner capacity.
101-117
- Bill Jackson, Tibor Jordán:
The d-dimensional rigidity matroid of sparse graphs.
118-133
- Karen Meagher, Brett Stevens:
Covering arrays on graphs.
134-151
- Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft:
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.
152-167
- Matthias Kriesell:
Disjoint A-paths in digraphs.
168-172
Volume 95,
Number 2,
November 2005
Notes
Copyright © Tue Dec 1 16:34:09 2009
by Michael Ley (ley@uni-trier.de)