Journals in DBLP

Discrete Mathematics
2001, volume: 229, number: 1-3

1. 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). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:1-2 [Journal]
   
2. Jochen Alber, Jens Gramm, Rolf Niedermeier
   Faster exact algorithms for hard problems: A parameterized point of view. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:3-27 [Journal]
   
3. József Beck
   Randomness in lattice point problems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:29-55 [Journal]
   
4. Hubert de Fraysseix, Patrice Ossona de Mendez
   On topological aspects of orientations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:57-72 [Journal]
   
5. Ralph J. Faudree
   Survey of results on k-ordered graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:73-87 [Journal]
   
6. Jerrold R. Griggs
   Spanning subset sums for finite Abelian groups. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:89-99 [Journal]
   
7. Petr Hlinený, Jan Kratochvíl
   Representing graphs by disks and balls (a survey of recognition-complexity results). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:101-124 [Journal]
   
8. Andreas Huck
   On cycle-double covers of graphs of small oddness. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:125-165 [Journal]
   
9. Tommy R. Jensen, Bjarne Toft
   25 Pretty graph colouring problems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:229, n:1-3, pp:167-169 [Journal]
   
10. Louis H. Kauffman
    On the map theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:171-184 [Journal]
    
11. Jaroslav Nesetril, Moshe Rosenfeld
    I. Schur, C.E. Shannon and Ramsey Numbers, a short story. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:185-195 [Journal]
    
12. Norbert Polat
    Convexity and fixed-point properties in Helly graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:197-211 [Journal]
    
13. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
    Asymptotic enumeration, global structure, and constrained evolution. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:213-233 [Journal]
    
14. Vlastimil Pták
    Combinatorial methods in analysis. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:235-259 [Journal]
    
15. Norbert Sauer
    Hedetniemi's conjecture -- a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:261-292 [Journal]
    
16. Miklós Simonovits, Vera T. Sós
    Ramsey-Turán theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:293-340 [Journal]
    
17. Jozef Sirán
    Triangle group representations and their applications to graphs and maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:341-358 [Journal]
    
18. Eric Sopena
    Oriented graph coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:359-369 [Journal]
    
19. Xuding Zhu
    Circular chromatic number: a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:371-410 [Journal]