Journals in DBLP

Discrete Mathematics
2005, volume: 304, number: 1-3

1. Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
   The irregularity strength of circulant graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:1-10 [Journal]
   
2. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
   Tabular graphs and chromatic sum. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:11-22 [Journal]
   
3. Pak Tung Ho
   The crossing number of K_{4, n} on the real projective plane. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:23-33 [Journal]
   
4. K. B. Reid, E. DePalma
   Balance in trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:34-44 [Journal]
   
5. Alexandr V. Kostochka, B. Y. Stodolsky
   On domination in connected cubic graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:45-50 [Journal]
   
6. Haruhide Matsuda
   Ore-type conditions for the existence of even [2, b]-factors in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:51-61 [Journal]
   
7. Geir Dahl, Truls Flatberg
   A remark concerning graphical sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:62-64 [Journal]
   
8. Aviezri S. Fraenkel
   Euclid and Wythoff games. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:65-68 [Journal]
   
9. Teresa W. Haynes, Michael A. Henning
   Trees with two disjoint minimum independent dominating sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:304, n:1-3, pp:69-78 [Journal]
   
10. Christophe Hohlweg
    Minimal and maximal elements in two-sided cells of S_n and Robinson-Schensted correspondence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:79-87 [Journal]
    
11. Dengju Ma, Han Ren, Junjie Lu
    The crossing number of the circular graph C(2m+2, m). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:88-93 [Journal]
    
12. Miri Priesler (Moreno)
    Partitioning a graph into two pieces, each isomorphic to the other or to its complement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:94-100 [Journal]
    
13. Dieter Rautenbach, Irene Stella
    On the maximum number of cycles in a Hamiltonian graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:101-107 [Journal]
    
14. Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae
    An algorithm for partial Grundy number on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:108-116 [Journal]
    
15. Sam E. Speed
    Inequalities involving the irredundance number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:117-120 [Journal]
    
16. Steven J. Tedford
    A characteristic polynomial for rooted mixed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:121-127 [Journal]
    
17. Zhao Zhang, Jinjiang Yuan
    A proof of an inequality concerning k-restricted edge connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:128-134 [Journal]