Journals in DBLP

Discrete Mathematics
2000, volume: 213, number: 1-3

1. Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor
   Codes with forbidden distances. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:3-11 [Journal]
   
2. Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder
   The congestion of n-cube layout on a rectangular grid. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:13-19 [Journal]
   
3. Halina Bielak
   Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:21-24 [Journal]
   
4. Volodia Blinovsky
   Asymptotical properties of linear codes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:25-28 [Journal]
   
5. Béla Bollobás, Douglas B. West
   A note on generalized chromatic number and generalized girth. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:29-34 [Journal]
   
6. Stephen D. Cohen, Nikolai N. Kuzjurin
   On the packing radius and the covering radius of equal-weight codes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:35-42 [Journal]
   
7. Nathaniel Dean, Mekkia Kouider
   Gallai's conjecture for disconnected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:43-54 [Journal]
   
8. Stefan M. Dodunekov, Ivan N. Landjev
   Near-MDS codes over some small fields. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:55-65 [Journal]
   
9. Michelle A. Donalies, Bernd S. W. Schröder
   Performance guarantees and applications for Xia's algorithm. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:67-86 [Journal]
   
10. Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota
    Graph decompositions and D₃-paths with a prescribed endvertex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:87-104 [Journal]
    
11. Igor Fabrici, Peter J. Owens, Hansjoachim Walther
    Non-hamiltonian polyhedral graphs with two types of faces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:105-113 [Journal]
    
12. Odile Favaron
    Extendability and factor-criticality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:115-122 [Journal]
    
13. Peter C. Fishburn, Prasad Tetali, Peter Winkler
    Optimal linear arrangement of a rectangular grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:123-139 [Journal]
    
14. Grzegorz Gancarzewicz, A. Pawel Wojda
    Graphs with every k-matching in a Hamiltonian cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:141-151 [Journal]
    
15. Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft
    On the Hajo's number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:153-161 [Journal]
    
16. Ching J. Guu
    The McFunction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:163-167 [Journal]
    
17. Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak
    Packing two copies of a tree into its fourth power. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:169-178 [Journal]
    
18. Henry A. Kierstead, William T. Trotter
    Interval orders and dimension. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:179-188 [Journal]
    
19. Jan Kratochvíl, Peter Mihók
    Hom-properties are uniquely factorizable into irreducible factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:189-194 [Journal]
    
20. Justyna Kurkowiak, Andrzej Rucinski
    Solitary subgraphs of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:195-209 [Journal]
    
21. Ivan N. Landjev
    Linear codes over finite fields and finite projective geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:211-244 [Journal]
    
22. Uwe Leck
    A property of colored complexes and their duals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:245-251 [Journal]
    
23. Alexander A. Sapozhenko
    On computing boundary functional sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:253-260 [Journal]
    
24. Günter Schaar
    On special numberings of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:261-268 [Journal]
    
25. Juriaan Simonis
    The [23, 14, 5] Wagner code is unique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:269-282 [Journal]
    
26. Faina I. Solov'eva
    Perfect binary codes: bounds and properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:283-290 [Journal]
    
27. Jean-Pierre Tillich
    Edge isoperimetric inequalities for product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:291-320 [Journal]
    
28. Zsolt Tuza
    Extremal bi-Helly families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:321-331 [Journal]
    
29. A. Pawel Wojda
    A note on the colour class of a self-complementary graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:333-336 [Journal]