Journals in DBLP

Discrete Mathematics
2003, volume: 271, number: 1-3

1. Yaojun Chen, Feng Tian, Bing Wei
   Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:1-12 [Journal]
   
2. Curtis Coker
   Enumerating a class of lattice paths. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:13-28 [Journal]
   
3. Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
   Jumping succession rules and their generating functions. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:29-50 [Journal]
   
4. Weidong Gao
   On zero-sum subsequences of restricted size II. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:51-59 [Journal]
   
5. Wayne Goddard, Michael Edwin Raines, Peter J. Slater
   Distance and connectivity measures in permutation graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:61-70 [Journal]
   
6. Eline Govaert, Hendrik Van Maldeghem
   Forgetful polygons as generalizations of semi-affine planes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:71-100 [Journal]
   
7. Michael A. Henning
   Defending the Roman Empire from multiple attacks. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:101-115 [Journal]
   
8. Yuanqiu Huang
   Maximum genus and chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:117-127 [Journal]
   
9. Santosh N. Kabadi, Abraham P. Punnen
   Weighted graphs with all Hamiltonian cycles of the same length. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:129-139 [Journal]
   
10. Alexander K. Kelmans
    On graph closures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:141-168 [Journal]
    
11. Wensong Lin
    Some star extremal circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:169-177 [Journal]
    
12. Martin Loebl, Jan Vondrák
    Towards a theory of frustrated degeneracy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:179-193 [Journal]
    
13. Christian Mauduit, András Sárközy
    On the measures of pseudorandomness of binary sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:195-207 [Journal]
    
14. Joseph Samuel Myers
    The extremal function for unbalanced bipartite minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:209-222 [Journal]
    
15. Behnaz Omoomi, Yee-Hock Peng
    Chromatic equivalence classes of certain generalized polygon trees, III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:223-234 [Journal]
    
16. Milos Stojakovic
    Limit shape of optimal convex lattice polygons in the sense of different metrics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:235-249 [Journal]
    
17. Zbigniew Switalski
    Half-integrality of vertices of the generalized transitive tournament polytope (n=6). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:251-260 [Journal]
    
18. René van den Brink, Robert P. Gilles
    Ranking by outdegree for directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:261-270 [Journal]
    
19. Joshua Von Korff
    Classification of greedy subset-sum-distinct-sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:271-282 [Journal]
    
20. Steve Wilson
    A worthy family of semisymmetric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:283-294 [Journal]
    
21. Dezheng Xie, Wanlian Yang
    The total chromatic number of graphs of even order and high degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:295-302 [Journal]
    
22. Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
    On a tree graph defined by a set of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:303-310 [Journal]
    
23. Pierre Lalonde
    Lattice paths and the antiautomorphism of the poset of descending plane partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:311-319 [Journal]
    
24. Lian-ying Miao, Shi-you Pang, Jian-Liang Wu
    An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:321-325 [Journal]
    
25. Nedyalko Dimov Nenov
    On the triangle vertex Folkman numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:327-334 [Journal]
    
26. Dieter Rautenbach
    A note on trees of maximum weight and restricted degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:335-342 [Journal]
    
27. Gelasio Salazar
    Infinite families of crossing-critical graphs with given average degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:343-350 [Journal]