Journals in DBLP

Discrete Mathematics
2002, volume: 245, number: 1-3

1. Veerle Fack, Stijn Lievens, Joris Van der Jeugt
   On the diameter of the rotation graph of binary coupling trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:1-18 [Journal]
   
2. Lutz Volkmann
   Cycles in multipartite tournaments: results and problems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:19-53 [Journal]
   
3. Méziane Aïder, Mustapha Aouchiche
   Distance monotonicity and a new characterization of hypercubes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:55-62 [Journal]
   
4. Joel Berman, Gabriela Hauser Bordalo
   Irreducible elements and uniquely generated algebras. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:63-79 [Journal]
   
5. Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Daniel Kobler
   On the recognition of de Bruijn graphs and their induced subgraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:81-92 [Journal]
   
6. Pierre Hansen, Brigitte Jaumard, Bruno Simeone
   Polynomial algorithms for nested univariate clustering. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:93-105 [Journal]
   
7. Clemens Heuberger
   On hamiltonian Toeplitz graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:107-125 [Journal]
   
8. Yoshiyas Ishigami, Hong Wang
   An extension of a theorem on cycles containing specified independent edges. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:127-137 [Journal]
   
9. Francisco Larrión, Victor Neumann-Lara
   On clique divergent graphs with linear growth. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:245, n:1-3, pp:139-153 [Journal]
   
10. Josef Leydold
    The geometry of regular trees with the Faber?Krahn property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:155-172 [Journal]
    
11. Guojun Li, Chuanping Chen, Gang Yu
    Orthogonal factorizations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:173-194 [Journal]
    
12. Rao Li, Richard H. Schelp
    Hamiltonicity of {K_{1, 4}, K_{1, 4}+e}-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:195-202 [Journal]
    
13. Aleksander Malnic, Dragan Marusic
    Constructing 1/2-arc-transitive graphs of valency 4 and vertex stabilizer Z₂×Z₂. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:203-216 [Journal]
    
14. Sergei Ovchinnikov
    Well-graded spaces of valued sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:217-233 [Journal]
    
15. Zhishi Pan, Xuding Zhu
    The circular chromatic number of series-parallel graphs of large odd girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:235-246 [Journal]
    
16. Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
    Non-chordal graphs having integral-root chromatic polynomials II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:247-253 [Journal]
    
17. Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray
    Star forests, dominating sets and Ramsey-type problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:255-262 [Journal]
    
18. Anka Golemac, Tanja Vucicic
    New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:263-272 [Journal]
    
19. Masaaki Harada
    Self-dual Z₄-codes and Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:273-278 [Journal]
    
20. Dieter Rautenbach
    On Kelly's lemma for infinite sets of integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:279-282 [Journal]
    
21. Matthew E. Riddle
    The minimum forcing number for the torus and hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:283-292 [Journal]
    
22. V. Yegnanarayanan
    On a question concerning prime distance graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:293-298 [Journal]