Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 8

1. 
   Preface. [Citation Graph (, )][DBLP]
   
   
2. 
   On the minimum number of completely 3-scrambling permutations. [Citation Graph (, )][DBLP]
   
   
3. 
   Distance graphs with maximum chromatic number. [Citation Graph (, )][DBLP]
   
   
4. 
   Series-parallel graphs are windy postman perfect. [Citation Graph (, )][DBLP]
   
   
5. 
   Breaking the rhythm on graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   Representing edge intersection graphs of paths on degree 4 trees. [Citation Graph (, )][DBLP]
   
   
7. 
   The game of arboricity. [Citation Graph (, )][DBLP]
   
   
8. 
   Matroid matching with Dilworth truncation. [Citation Graph (, )][DBLP]
   
   
9. 
   On the L(p, 1)-labelling of graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Extremal k-edge-hamiltonian hypergraphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Pebble game algorithms and sparse graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Improper colouring of (random) unit disk graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Packing triangles in low degree graphs and indifference graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Packing non-returning A-paths algorithmically. [Citation Graph (, )][DBLP]