Journals in DBLP

Discrete Mathematics
2001, volume: 234, number: 1-3

1. Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
   Some permutations with forbidden subsequences and their inversion number. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:1-15 [Journal]
   
2. Jarmila Hedlíková
   Relatively orthomodular lattices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:17-38 [Journal]
   
3. Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena
   On nice graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:39-51 [Journal]
   
4. Refik Keskin
   On suborbital graphs for some Hecke groups. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:53-64 [Journal]
   
5. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
   Edge-disjoint spanners of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:65-76 [Journal]
   
6. Adrian Riskin
   On the nonembeddability and crossing numbers of some toroidal graphs on the Klein bottle. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:77-88 [Journal]
   
7. Hendrik Van Maldeghem
   Sharply 2-transitive groups of projectivities in generalized polygons. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:89-100 [Journal]
   
8. Zhixiong Wang, Huishan Zhou
   On circulant chromatic number and circulant chromatic function. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:101-118 [Journal]
   
9. Ron Aharoni, Eli Berger
   The number of edges in critical strongly connected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:234, n:1-3, pp:119-123 [Journal]
   
10. Michael O. Albertson, Emily H. Moore
    Extending graph colorings using no extra colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:125-132 [Journal]
    
11. Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
    i gamma(1)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:133-138 [Journal]
    
12. Wayne Goddard, Michael A. Henning
    Pancyclicity of the prism. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:139-142 [Journal]
    
13. Francisco Javier González Vieli
    A characteristic property of spheres in regular trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:143-148 [Journal]
    
14. Toru Hasunuma
    Completely independent spanning trees in the underlying graph of a line digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:149-157 [Journal]
    
15. Mirko Hornák, Stefan Pcola
    Achromatic number of K₅?K_n for large n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:159-169 [Journal]
    
16. Robert Janczewski
    Divisibility and T-span of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:171-179 [Journal]
    
17. Romeo Rizzi
    On 4-connected graphs without even cycle decompositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:181-186 [Journal]
    
18. László Szegö
    On covering intersecting set-systems by digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:187-189 [Journal]
    
19. Zhi-Ping Wang, Lian-Chang Zhao
    A necessary and sufficient condition for a graph to be edge tenacious. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:191-197 [Journal]