Journals in DBLP

Discrete Mathematics
2004, volume: 280, number: 1-3

1. Guoli Ding, Peter P. Chen
   Unavoidable doubly connected large graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:1-12 [Journal]
   
2. Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara
   Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:13-27 [Journal]
   
3. Adilson Gonçalves, Emerson L. Monte Carmelo
   Some geometric structures and bounds for Ramsey numbers. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:29-38 [Journal]
   
4. David J. Grynkiewicz
   On some Rado numbers for generalized arithmetic progressions. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:39-50 [Journal]
   
5. Patrick Healy, Ago Kuusik, Sebastian Leipert
   A characterization of level planar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:51-63 [Journal]
   
6. Petteri Kaski, Patric R. J. Östergård
   Miscellaneous classification results for 2-designs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:65-75 [Journal]
   
7. Manoel Lemos, James G. Oxley
   On the minor-minimal 2-connected graphs having a fixed minor. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:77-118 [Journal]
   
8. Nicolas Lichiardopol
   Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:119-131 [Journal]
   
9. Aleksander Malnic, Dragan Marusic, Primoz Potocnik, Changqun Wang
   An infinite family of cubic edge- but not vertex-transitive graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:280, n:1-3, pp:133-148 [Journal]
   
10. Bernd S. W. Schröder
    More examples on ordered set reconstruction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:149-163 [Journal]
    
11. Zvezdelina Stankova, Julian West
    Explicit enumeration of 321, hexagon-avoiding permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:165-189 [Journal]
    
12. Eckhard Steffen
    Measurements of edge-uncolorability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:191-214 [Journal]
    
13. Cristina Bazgan
    A note on the approximability of the toughness of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:215-218 [Journal]
    
14. Maurits de Graaf
    Directed triangles in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:219-223 [Journal]
    
15. Emeric Deutsch
    Enumerating symmetric directed convex polyominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:225-231 [Journal]
    
16. Nicholas A. Loehr
    Note on André's reflection principle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:233-236 [Journal]
    
17. Dingjun Lou, Dongning Rao
    Graphs with no M-alternating path between two vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:237-240 [Journal]
    
18. Haruhide Matsuda
    Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:241-250 [Journal]
    
19. S. Nicoloso
    Sum coloring and interval graphs: a tight upper bound for the minimum number of colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:251-257 [Journal]
    
20. Ignacio M. Pelayo
    Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41-54]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:259-263 [Journal]
    
21. Erfang Shan, Liying Kang
    A note on balance vertices in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:265-269 [Journal]
    
22. Van Bang Le, Jeremy Spinrad
    Consequences of an algorithm for bridged graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:271-274 [Journal]