Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 5-6

1. 
   Preface. [Citation Graph (, )][DBLP]
   
   
2. 
   A general approach to constructing power-sequence terraces for Z_n. [Citation Graph (, )][DBLP]
   
   
3. 
   (r, r+1)-factorizations of (d, d+1)-graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Diameter and inverse degree. [Citation Graph (, )][DBLP]
   
   
5. 
   Rook polynomials on two-dimensional surfaces and graceful labellings of graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   Further results on logarithmic terraces. [Citation Graph (, )][DBLP]
   
   
7. 
   Equipartite and almost-equipartite gregarious 4-cycle systems. [Citation Graph (, )][DBLP]
   
   
8. 
   On bicyclic reflexive graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   Primitive one-factorizations and the geometry of mixed translations. [Citation Graph (, )][DBLP]
   
   
10. 
    A sum labelling for the generalised friendship graph. [Citation Graph (, )][DBLP]
    
    
11. 
    Minimal homogeneous Steiner 2-(v, 3) trades. [Citation Graph (, )][DBLP]
    
    
12. 
    Maximum packing for perfect four-triple configurations. [Citation Graph (, )][DBLP]
    
    
13. 
    Cycles in a tournament with pairwise zero, one or two given vertices in common. [Citation Graph (, )][DBLP]
    
    
14. 
    Strength two covering arrays: Existence tables and projection. [Citation Graph (, )][DBLP]
    
    
15. 
    Bertrand's postulate, the prime number theorem and product anti-magic graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Vertex-distinguishing proper edge colourings of some regular graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    The average degree of an edge-chromatic critical graph. [Citation Graph (, )][DBLP]
    
    
18. 
    Partial cubes are distance graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    General neighbour-distinguishing index of a graph. [Citation Graph (, )][DBLP]
    
    
20. 
    Constructing linear codes from some orbits of projectivities. [Citation Graph (, )][DBLP]
    
    
21. 
    On optimal non-projective ternary linear codes. [Citation Graph (, )][DBLP]
    
    
22. 
    Trees with depression three. [Citation Graph (, )][DBLP]
    
    
23. 
    Bipartite almost distance-hereditary graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    The polynomial degrees of Grassmann and Segre varieties over GF(2). [Citation Graph (, )][DBLP]
    
    
25. 
    A generalised upper bound for the k-tuple domination number. [Citation Graph (, )][DBLP]
    
    
26. 
    More large sets of resolvable MTS and resolvable DTS with odd orders. [Citation Graph (, )][DBLP]
    
    
27. 
    Pancyclic PBD block-intersection graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Graphs with the n-e.c. adjacency property constructed from affine planes. [Citation Graph (, )][DBLP]
    
    
29. 
    Connectedness of the graph of vertex-colourings. [Citation Graph (, )][DBLP]
    
    
30. 
    Orbit-counting polynomials for graphs and codes. [Citation Graph (, )][DBLP]
    
    
31. 
    On 2-factorizations whose automorphism group acts doubly transitively on the factors. [Citation Graph (, )][DBLP]
    
    
32. 
    Semi-total graph colourings, the beta parameter, and total chromatic number. [Citation Graph (, )][DBLP]
    
    
33. 
    A note on chordal bound graphs and posets. [Citation Graph (, )][DBLP]
    
    
34. 
    Colouring even cycle systems. [Citation Graph (, )][DBLP]
    
    
35. 
    On reconstruction of signed permutations distorted by reversal errors. [Citation Graph (, )][DBLP]
    
    
36. 
    Equitable coloring planar graphs with large girth. [Citation Graph (, )][DBLP]
    
    
37. 
    The Erdos-Faber-Lovász conjecture for dense hypergraphs. [Citation Graph (, )][DBLP]
    
    
38. 
    A conjecture on the reconstruction of graphs from metric balls of their vertices. [Citation Graph (, )][DBLP]