Journals in DBLP

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

1. Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:1-4 [Journal]
   
2. Jørgen Bang-Jensen, Gregory Gutin
   Paths and cycles in extended and decomposable digraphs^, . [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:5-19 [Journal]
   
3. Halina Bielak
   Chromatic uniqueness in a family of 2-connected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:21-28 [Journal]
   
4. H. J. Broersma
   A note on the minimum size of a vertex pancyclic graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:29-32 [Journal]
   
5. Stanislaw Bylka, Jan Komar
   Intersection properties of line graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:33-45 [Journal]
   
6. Yair Caro, Yehuda Roditty, J. Schönheim
   On colored designs - I. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:47-65 [Journal]
   
7. Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
   Efficiency and effectiveness of normal schedules on three dedicated processors. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:67-79 [Journal]
   
8. Paul Erdös
   Some recent problems and results in graph theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:81-85 [Journal]
   
9. Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek
   Claw-free graphs - A survey. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:164, n:1-3, pp:87-147 [Journal]
   
10. Izolda Gorgol
    On bounds for size Ramsey numbers of a complete tripartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:149-153 [Journal]
    
11. Harald Gropp
    Configurations and graphs - II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:155-163 [Journal]
    
12. Yubao Guo, Axel Pinkernell, Lutz Volkmann
    On cycles through a given vertex in multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:165-170 [Journal]
    
13. Mirko Hornák, Stanislav Jendrol
    On the d-distance face chromatic number of plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:171-174 [Journal]
    
14. Gyula O. H. Katona
    Extremal problems for finite sets and convex hulls - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:175-185 [Journal]
    
15. Gyula Y. Katona
    Toughness and edge-toughness. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:187-196 [Journal]
    
16. Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski
    The smallest hard-to-color graph for the SL algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:197-212 [Journal]
    
17. Maria Kwasnik, Alina Szelecka
    Strong perfectness of the generalized Cartesian product of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:213-220 [Journal]
    
18. Zbigniew Lonc
    Delta-system decompositions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:221-224 [Journal]
    
19. Zofia Majcher, Jerzy Michael
    Degree sequences of highly irregular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:225-236 [Journal]
    
20. Zofia Majcher, Jerzy Michael
    Highly irregular graphs with extreme numbers of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:237-242 [Journal]
    
21. Konrad Piwakowski
    On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:243-249 [Journal]
    
22. Andrzej Rucinski, Miroslaw Truszczynski
    A note on local colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:251-255 [Journal]
    
23. Zdenek Ryjácek
    Matching extension in K_{1, r}-free graphs with independent claw centers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:257-263 [Journal]
    
24. Jean-François Saclé, Mariusz Wozniak
    A note on packing of three forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:265-274 [Journal]
    
25. Günter Schaar
    On the Hamiltonicity exponent of directed cacti. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:275-284 [Journal]
    
26. Jerzy Topp, Preben D. Vestergaard
    Totally equimatchable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:285-290 [Journal]
    
27. Hoa Vu Dinh
    Path partition number in tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:291-294 [Journal]
    
28. Andrzej Wloch, Iwona Wloch
    On (k, l)-kernels in generalized products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:295-301 [Journal]
    
29. A. Pawel Wojda, Paul Vaderlind
    Packing bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:303-311 [Journal]
    
30. Günter Schaar, A. Pawel Wojda
    An upper bound for the Hamiltonicity exponent of finite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:313-316 [Journal]