Journals in DBLP

Discrete Mathematics
1996, volume: 156, number: 1-3

1. Stephen J. Curran, Joseph A. Gallian
   Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:1-18 [Journal]
   
2. R. Balakrishnan, R. Sampathkumar
   Decompositions of regular graphs into K_n^c v 2K₂. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:19-28 [Journal]
   
3. M. Bauer, C. Itzykson
   Triangulations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:29-81 [Journal]
   
4. Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross
   A tight lower bound on the maximum genus of a simplicial graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:83-102 [Journal]
   
5. Hortensia Galeana-Sánchez
   On monochromatic paths and monochromatic cycles in edge coloured tournaments. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:103-112 [Journal]
   
6. David W. Krumme
   Reordered gossip schemes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:113-140 [Journal]
   
7. Jin Ho Kwak, Se-Goo Kim, Jaeun Lee
   Distributions of regular branched prime-fold coverings of surfaces. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:141-170 [Journal]
   
8. MingChu Li
   Hamiltonian cycles in regular 3-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:171-196 [Journal]
   
9. Valery A. Liskovets
   A reductive technique for enumerating non-isomorphic planar maps. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1996, v:156, n:1-3, pp:197-217 [Journal]
   
10. Ioan Tomescu
    An asymptotic formula for the number of graphs having small diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:219-228 [Journal]
    
11. Xuding Zhu
    On the bounds for the ultimate independence ratio of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:229-236 [Journal]
    
12. J. H. E. Cohn
    Complex D-optimal designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:237-241 [Journal]
    
13. Sandi Klavzar, Blaz Zmazek
    On a Vizing-like conjecture for direct product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:243-246 [Journal]
    
14. Winston Yang
    Bell numbers and k-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:247-252 [Journal]
    
15. Richard P. Anstee, Jerrold R. Griggs
    An application of matching theory of edge-colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:253-256 [Journal]
    
16. Béla Bollobás
    Turán-Ramsey problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:257-262 [Journal]
    
17. Keith Edwards
    On a problem concerning piles of counters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:263-264 [Journal]
    
18. Henry Jacob
    Kernels in graphs with a clique-cutset. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:265-267 [Journal]
    
19. Donald L. Kreher, Gordon F. Royle, W. D. Wallis
    A family of resolvable regular graph designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:269-275 [Journal]
    
20. Vaktang Lashkia, Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg
    Semirigid sets of diamond orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:277-283 [Journal]
    
21. Miwako Mishima, Masakazu Jimbo
    A series of identities for the coefficients of inverse matrices on a Hamming scheme. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:285-290 [Journal]
    
22. Haiko Müller
    Hamiltonian circuits in chordal bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:291-298 [Journal]
    
23. Elefterie Olaru
    The structure of imperfect critically strongly-imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:299-302 [Journal]
    
24. James A. Sellers
    Recurrences for 2-colored and 3-colored F-partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:303-310 [Journal]
    
25. Manfred Stern
    On the covering graph of balanced lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:311-316 [Journal]
    
26. Xuebin Zhang
    Construction for indecomposable simple (v, k, lambda)-BIBDs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:317-322 [Journal]