Journals in DBLP

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

1. Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
   Long cycles in 3-cyclable graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:1-8 [Journal]
   
2. Yanxun Chang
   The existence of resolvable BIBD with k even and lambda=1. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:9-23 [Journal]
   
3. Rossella Di Monte, Osvaldo Ferri, Stefania Ferri
   Characterization of quadric cones in a Galois projective space. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:25-31 [Journal]
   
4. Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam
   Duadic sequences of prime lengths. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:33-49 [Journal]
   
5. Pavel G. Emelyanov, Agung Lukito
   On the maximal length of a snake in hypercubes of small dimension. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:51-59 [Journal]
   
6. Hortensia Galeana-Sánchez
   Semikernels modulo F and kernels in digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:61-71 [Journal]
   
7. Oliver Goodman, Vincent Moulton
   On the tight span of an antipodal graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:73-96 [Journal]
   
8. Michael I. Hartley
   Polytopes of finite type. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:97-108 [Journal]
   
9. Daniel A. Klain
   Free polygon enumeration and the area of an integral polygon. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:218, n:1-3, pp:109-119 [Journal]
   
10. Darla Kremer
    Permutations with forbidden subsequences and a generalized Schro"der number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:121-130 [Journal]
    
11. Manoel Lemos, James G. Oxley
    On the 3-connected matroids that are minimal having a fixed spanning restriction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:131-165 [Journal]
    
12. Donatella Merlini, M. Cecilia Verri
    Generating trees and proper Riordan Arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:167-183 [Journal]
    
13. Irena Rusu
    Even pairs in Artemis graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:185-197 [Journal]
    
14. Yukio Shibata, Toru Hasunuma, Sanae Fukuda
    Isomorphic factorization of de Bruijn digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:199-208 [Journal]
    
15. Alexander Stoimenow
    On the number of chord diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:209-233 [Journal]
    
16. Olivier Togni
    Irregularity strength and compound graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:235-243 [Journal]
    
17. Igor E. Zverovich
    Multi-intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:245-251 [Journal]
    
18. Malgorzata Zwonek
    Pseudototal colourings of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:253-263 [Journal]
    
19. Mirka Miller, Joan Gimbert, Jozef Sirán, Slamin
    Almost Moore digraphs are diregular. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:265-270 [Journal]
    
20. James G. Oxley, Geoffrey P. Whittle
    On the non-uniqueness of q-cones of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:271-275 [Journal]
    
21. Mateja Sajna
    On the problem of a matching orthogonal to a 2-factorization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:277-282 [Journal]
    
22. G. Sethuraman, R. Dhavamani
    Graceful numbering of an edge-gluing of shell graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:283-287 [Journal]
    
23. Eckhard Steffen
    A refinement of Vizing's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:289-291 [Journal]
    
24. Xu-dong Yuan, Mao-cheng Cai
    Vertices of degree k in a minimally k-edge-connected digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:293-298 [Journal]