Journals in DBLP

Discrete Applied Mathematics
2010, volume: 158, number: 16

1. 
   The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. [Citation Graph (, )][DBLP]
   
   
2. 
   Generalized knight's tour on 3D chessboards. [Citation Graph (, )][DBLP]
   
   
3. 
   Polynomial kernels for 3-leaf power graph modification problems. [Citation Graph (, )][DBLP]
   
   
4. 
   A cops and robber game in multidimensional grids. [Citation Graph (, )][DBLP]
   
   
5. 
   Cover-incomparability graphs and chordal graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   Excessive factorizations of bipartite multigraphs. [Citation Graph (, )][DBLP]
   
   
7. 
   'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. [Citation Graph (, )][DBLP]
   
   
8. 
   k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. [Citation Graph (, )][DBLP]
   
   
9. 
   The t-discrepancy of a poset. [Citation Graph (, )][DBLP]
   
   
10. 
    Distance spectral radius of trees with given matching number. [Citation Graph (, )][DBLP]
    
    
11. 
    Codes from lattice and related graphs, and permutation decoding. [Citation Graph (, )][DBLP]
    
    
12. 
    Equitable colorings of Kronecker products of graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    A generalization of interval edge-colorings of graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Integer matrices with constraints on leading partial row and column sums. [Citation Graph (, )][DBLP]
    
    
15. 
    Wiener and vertex PI indices of Kronecker products of graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. [Citation Graph (, )][DBLP]
    
    
17. 
    A polyhedral study of triplet formulation for single row facility layout problem. [Citation Graph (, )][DBLP]