Volume 280,
Number 1-3,
April 2004
Article
- Guoli Ding, Peter P. Chen:
Unavoidable doubly connected large graphs.
1-12
Electronic Edition (link) BibTeX
- Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2.
13-27
Electronic Edition (link) BibTeX
- Adilson Gonçalves, Emerson L. Monte Carmelo:
Some geometric structures and bounds for Ramsey numbers.
29-38
Electronic Edition (link) BibTeX
- David J. Grynkiewicz:
On some Rado numbers for generalized arithmetic progressions.
39-50
Electronic Edition (link) BibTeX
- Patrick Healy, Ago Kuusik, Sebastian Leipert:
A characterization of level planar graphs.
51-63
Electronic Edition (link) BibTeX
- Petteri Kaski, Patric R. J. Östergård:
Miscellaneous classification results for 2-designs.
65-75
Electronic Edition (link) BibTeX
- Manoel Lemos, James G. Oxley:
On the minor-minimal 2-connected graphs having a fixed minor.
77-118
Electronic Edition (link) BibTeX
- Nicolas Lichiardopol:
Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph.
119-131
Electronic Edition (link) BibTeX
- Aleksander Malnic, Dragan Marusic, Primoz Potocnik, Changqun Wang:
An infinite family of cubic edge- but not vertex-transitive graphs.
133-148
Electronic Edition (link) BibTeX
- Bernd S. W. Schröder:
More examples on ordered set reconstruction.
149-163
Electronic Edition (link) BibTeX
- Zvezdelina Stankova, Julian West:
Explicit enumeration of 321, hexagon-avoiding permutations.
165-189
Electronic Edition (link) BibTeX
- Eckhard Steffen:
Measurements of edge-uncolorability.
191-214
Electronic Edition (link) BibTeX
Short Communication
Copyright © Tue May 27 18:24:32 2008
by Michael Ley (ley@uni-trier.de)
