Journals in DBLP

Discrete Mathematics
1997, volume: 171, number: 1-3

1. Ron Aharoni, Gabor T. Herman, Attila Kuba
   Binary vectors partially determined by linear equation systems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:1-16 [Journal]
   
2. M. H. Armanious
   Construction of nilpotent sloops of class n. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:17-25 [Journal]
   
3. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
   LexBFS-orderings and powers of chordal graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:27-42 [Journal]
   
4. Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
   Cycles through subsets with large degree sums. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:43-54 [Journal]
   
5. Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer
   Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:55-75 [Journal]
   
6. Ilda P. F. da Silva
   Note on inseparability graphs of matroids having exactly one class of orientations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:77-87 [Journal]
   
7. Tomás Dvorák, Ivan Havel, Petr Liebl
   Euler cycles in the complete graph K_2m+1. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:89-102 [Journal]
   
8. Yoshimi Egawa
   Contractible cycles in graphs with large minimum degree. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:103-119 [Journal]
   
9. Robert Gardner, Biagio Micale, Mario Pennisi, Rebecca Zijlstra
   Cyclic and rotational hybrid triple systems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:171, n:1-3, pp:121-139 [Journal]
   
10. Johannes H. Hattingh, Elna Ungerer
    Minus k-subdomination in graphs II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:141-151 [Journal]
    
11. Michal Karonski, Tomasz Luczak
    The number of connected sparsely edged uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:153-167 [Journal]
    
12. Ru-Ying Liu, Lian-Chang Zhao
    A new method for proving chromatic uniqueness of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:169-177 [Journal]
    
13. Terry A. McKee
    Clique neighborhoods and nearly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:179-189 [Journal]
    
14. Michel Minoux
    Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:191-200 [Journal]
    
15. John Mitchem, Patrick Morriss
    On the cost-chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:201-211 [Journal]
    
16. Irena Rusu
    Building counterexamples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:213-227 [Journal]
    
17. Joseph M. Santmyer
    A stirling like sequence of rational numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:229-235 [Journal]
    
18. Claude Tardif
    A fixed box theorem for the cartesian product of graphs and metric spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:237-248 [Journal]
    
19. Ulrich Teschner
    New results about the bondage number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:249-259 [Journal]
    
20. Peng-Jun Wan, Ding-Zhu Du, Ronald L. Graham
    The Steiner ratio for the dual normed plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:261-275 [Journal]
    
21. Peter Zörnig
    On the line graphs of the complete r-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:277-282 [Journal]
    
22. K. H. Chew
    On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:283-286 [Journal]
    
23. Lane H. Clark, Dawit Haile
    Remarks on the size of critical edge-chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:287-293 [Journal]
    
24. Dmitry Fon-Der-Flaass
    Arrays of distinct representatives - a very simple NP-complete problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:295-298 [Journal]