Journals in DBLP

Discrete Mathematics
1995, volume: 142, number: 1-3

1. Ahmed Ainouche
   A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:1-19 [Journal]
   
2. Dan Archdeacon, David A. Grable
   The genus of a random graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:21-37 [Journal]
   
3. Robin J. Chapman
   Shrinking integer lattices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:39-48 [Journal]
   
4. Biao Gao, Ding-Zhu Du, Ronald L. Graham
   A tight lower bound for the Steiner ratio in Minkowski planes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:49-63 [Journal]
   
5. Frieda Granot, Michal Penn
   On the integral 4-packing of T-cuts. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:65-75 [Journal]
   
6. M. Gutierrez, L. Oubiña
   Minimum proper interval graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:77-85 [Journal]
   
7. Pentti Haukkanen
   An abstract Möbius inversion formula with number-theoretic applications. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:87-96 [Journal]
   
8. Olof Heden
   Maximal partial spreads and the modular n-queen problem II. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:97-106 [Journal]
   
9. Michael A. Henning
   Irredundance perfect graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:107-120 [Journal]
   
10. Chính T. Hoàng
    Hamiltonian degree conditions for tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:121-139 [Journal]
    
11. Meir Katchalski, William McCuaig, Suzanne Seager
    Ordered colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:141-154 [Journal]
    
12. George T. Kennedy, Vera Pless
    A coding theoretic approach to extending designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:155-168 [Journal]
    
13. J. Körner
    Intersection number and capacities of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:169-184 [Journal]
    
14. Xiaoyun Lu
    A Hamiltonian game on K_{n, n}. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:185-191 [Journal]
    
15. Xiang Qing
    Reversible (m, n, k, lambda₁, lambda₂)-abelian divisible difference sets with k - lambda₁ nonsquare. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:193-201 [Journal]
    
16. Lawren Smithline
    Bandwidth of the complete k-ary tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:203-212 [Journal]
    
17. Renzo Sprugnoli
    Riordan arrays and the Abel-Gould identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:213-233 [Journal]
    
18. Saul Stahl
    Bounds for the average genus of the vertex-amalgamation of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:235-245 [Journal]
    
19. Armen H. Zemanian
    Connectedness in transfinite graphs and the existence and uniqueness of node voltages. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:247-269 [Journal]
    
20. Frank W. Barnes
    Best packing of rods into boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:271-275 [Journal]
    
21. Guo-Gang Gao, Gena Hahn
    Minimal graphs that fold onto K_n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:277-280 [Journal]
    
22. Michael Krivelevich
    On a conjecture of Tuza about packing and covering of triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:281-286 [Journal]
    
23. Costas D. Maranas, Christodoulos A. Floudas, Panos M. Pardalos
    New results in the packing of equal circles in a square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:287-293 [Journal]
    
24. Hirobumi Mizuno, Iwao Sato
    Characteristic polynomials of some graph coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:295-298 [Journal]