Journals in DBLP

Discrete Mathematics
2002, volume: 251, number: 1-3

1. Mirko Hornák, Stanislav Jendrol
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:1-0 [Journal]
   
2. Amelie J. Berger
   Minimal reducible bounds in the lattice of additive hereditary graph properties. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:3-10 [Journal]
   
3. Amelie J. Berger, Izak Broere, Samuel J. T. Moagi, Peter Mihók
   Meet- and join-irreducibility of additive hereditary properties of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:11-18 [Journal]
   
4. Mieczyslaw Borowiecki, Elzbieta Sidorowicz
   Some extremal problems of graphs with local constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:19-32 [Journal]
   
5. Stephan Brandt
   A 4-colour problem for dense triangle-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:33-46 [Journal]
   
6. Hajo Broersma
   On some intriguing problems in hamiltonian graph theory--a survey. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:47-69 [Journal]
   
7. Jan Brousek
   Forbidden triples for hamiltonicity. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:71-76 [Journal]
   
8. Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek
   A note on hamiltonicity of generalized net-free graphs of large diameter. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:77-85 [Journal]
   
9. Izolda Gorgol, Tomasz Luczak
   On induced Ramsey numbers. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:87-96 [Journal]
   
10. Frank Göring
    On 2-regular subgraphs in polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:97-102 [Journal]
    
11. Erhard Hexel
    On light graphs in the family of 4-connected planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:103-107 [Journal]
    
12. Marián Klesc
    The crossing number of K_{2, 3}xC₃. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:109-117 [Journal]
    
13. Mekkia Kouider, Antoni Marczyk
    On pancyclism in hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:119-127 [Journal]
    
14. Anja Pruchnewski
    On the domination number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:129-136 [Journal]
    
15. Bert Randerath, Ingo Schiermeyer, Meike Tewes
    Three-colourability and forbidden subgraphs. II: polynomial algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:137-153 [Journal]
    
16. András Recski
    Two matroidal families on the edge set of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:155-162 [Journal]
    
17. Zdzislaw Skupien
    Hamiltonicity of planar cubic multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:163-168 [Journal]
    
18. Zsolt Tuza, Margit Voigt
    A note on planar 5-list colouring: non-extendability at distance 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:169-172 [Journal]
    
19. Mariusz Wozniak
    On cyclically embeddable (n, n-1)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:173-179 [Journal]