Journals in DBLP

Discrete Mathematics
1992, volume: 110, number: 1-3

1. Arie Bialostocki, P. Dierker
   On the Erdös-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:1-8 [Journal]
   
2. Gustav Burosch, Ivan Havel, Jean-Marie Laborde
   Distance monotone graphs and a new characterization of hypercubes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:9-16 [Journal]
   
3. Olivia M. Carducci
   The strong perfect graph conjecture holds for diamonded odd cycle-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:17-34 [Journal]
   
4. D. Chen, Charles C. Lindner, Douglas R. Stinson
   Further results on large sets of disjoint group-divisible designs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:35-42 [Journal]
   
5. Fan Chung, Persi Diaconis, Ronald Graham
   Universal cycles for combinatorial structures. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:43-59 [Journal]
   
6. Maurice Cochand, Arlette Gaillard, Heinz Gröflin
   Lattice matrices, intersection of ring families and dicuts. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:61-80 [Journal]
   
7. Michele Conforti, M. R. Rao
   Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:81-118 [Journal]
   
8. J. Francke, J. J. H. Meijers
   Super-visible codes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:119-134 [Journal]
   
9. T. Hayasaka, S. Saito, D. G. Rogers
   Further results on irregular, critical perfect systems of difference sets II: systems without splits. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1992, v:110, n:1-3, pp:135-154 [Journal]
   
10. Shinji Kuriki
    System of equations related to the existence conditions for arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:155-164 [Journal]
    
11. Hong-Jian Lai, Hongyuan Lai
    Duality in graph families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:165-177 [Journal]
    
12. Hong-Jian Lai, Cun-Quan Zhang
    Nowhere-zero 3-flows of highly connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:179-183 [Journal]
    
13. Nian-Zu Li
    On graphs having sigma-polynomials of the same degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:185-196 [Journal]
    
14. Xiaoyun Lu
    A characterization on n-critical economical generalized tic-tac-toe games. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:197-203 [Journal]
    
15. Francis Maurin
    Balanced generalized handcuffed designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:205-213 [Journal]
    
16. Klaus Metsch
    Linear spaces with few lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:215-222 [Journal]
    
17. Lewis A. Nowitz
    A non-Cayley-invariant Cayley graph of the elementary Abelian group of order 64. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:223-228 [Journal]
    
18. Yongjin Zhu, Hao Li
    Hamilton cycles in regular 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:229-249 [Journal]
    
19. Hortensia Galeana-Sánchez
    On the existence of kernels and h-kernels in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:251-255 [Journal]
    
20. Janice L. Malouf
    An integer sequence from a rational recursion. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:257-261 [Journal]
    
21. Sheldon Parnes, Shalosh B. Ekhad
    A WZ-style proof of Jacobi polynomials' generating function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:263-264 [Journal]
    
22. Edward Spence, Vladimir D. Tonchev
    Extremal self-dual codes from symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:265-268 [Journal]
    
23. Yoshimi Egawa, Preben D. Vestergaard
    Spanning trees in a cactus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:269-274 [Journal]
    
24. David C. Fisher, Jennifer Ryan
    Bounds on the largest root of the matching polynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:275-278 [Journal]
    
25. Maurits de Graaf, Alexander Schrijver, Paul D. Seymour
    Directed triangles in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:279-282 [Journal]
    
26. Fred C. Holroyd
    Reconstructing finite group actions and characters from subgroup information. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:283-287 [Journal]
    
27. Stephan Olariu
    On sources in comparability graphs, with applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:289-292 [Journal]
    
28. Jia-Yu Shao, Wan-Di Wei
    A formula for the number of Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:293-296 [Journal]
    
29. Julian Harvey Wood
    Is every compact code Huffman? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:297-299 [Journal]