Volume 229, Number 1-3, February 2001
- Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril:
DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998).
1-2
- Jochen Alber, Jens Gramm, Rolf Niedermeier:
Faster exact algorithms for hard problems: A parameterized point of view.
3-27
- József Beck:
Randomness in lattice point problems.
29-55
- Hubert de Fraysseix, Patrice Ossona de Mendez:
On topological aspects of orientations.
57-72
- Ralph J. Faudree:
Survey of results on k-ordered graphs.
73-87
- Jerrold R. Griggs:
Spanning subset sums for finite Abelian groups.
89-99
- Petr Hlinený, Jan Kratochvíl:
Representing graphs by disks and balls (a survey of recognition-complexity results).
101-124
- Andreas Huck:
On cycle-double covers of graphs of small oddness.
125-165
- Tommy R. Jensen, Bjarne Toft:
25 Pretty graph colouring problems.
167-169
- Louis H. Kauffman:
On the map theorem.
171-184
- Jaroslav Nesetril, Moshe Rosenfeld:
I. Schur, C.E. Shannon and Ramsey Numbers, a short story.
185-195
- Norbert Polat:
Convexity and fixed-point properties in Helly graphs.
197-211
- Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution.
213-233
- Vlastimil Pták:
Combinatorial methods in analysis.
235-259
- Norbert Sauer:
Hedetniemi's conjecture -- a survey.
261-292
- Miklós Simonovits, Vera T. Sós:
Ramsey-Turán theory.
293-340
- Jozef Sirán:
Triangle group representations and their applications to graphs and maps.
341-358
- Eric Sopena:
Oriented graph coloring.
359-369
- Xuding Zhu:
Circular chromatic number: a survey.
371-410
Last update Wed May 22 17:28:24 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
