Journals in DBLP

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

1. Michel Bousquet, Gilbert Labelle, Pierre Leroux
   Enumeration of planar two-face maps. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:1-25 [Journal]
   
2. Yanxun Chang, Giovanni Lo Faro
   Existence of DBIBDs with block size not divided by four. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:27-40 [Journal]
   
3. Carmen Cortés, Atsuhiro Nakamoto
   Diagonal flips in outer-Klein-bottle triangulations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:41-50 [Journal]
   
4. Peter Damaschke
   Degree-preserving spanning trees in small-degree graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:51-60 [Journal]
   
5. Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
   Feasible edge colorings of trees with cardinality constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:61-72 [Journal]
   
6. Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
   An attempt to classify bipartite graphs by chromatic polynomials. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:73-88 [Journal]
   
7. Hung-Lin Fu, Chin-Lin Shiue
   The optimal pebbling number of the complete m-ary tree. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:89-100 [Journal]
   
8. Anna Galluccio, Pavol Hell, Jaroslav Nesetril
   The complexity of H-colouring of bounded degree graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:101-109 [Journal]
   
9. Weidong Gao
   On Davenport's constant of finite abelian groups with rank three. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:111-124 [Journal]
   
10. Laurent Habsieger, Alain Plagne
    New lower bounds for covering codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:125-149 [Journal]
    
11. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    Acyclic domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:151-165 [Journal]
    
12. Danica Jakubíková-Studenovská
    Unoriented graphs of monounary algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:167-179 [Journal]
    
13. Johan Jonasson
    An upper bound on the cover time for powers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:181-190 [Journal]
    
14. Liying Kang, Jinjiang Yuan
    Bondage number of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:191-198 [Journal]
    
15. Vadim V. Lozin
    Conic reduction of graphs for the stable set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:199-211 [Journal]
    
16. José Plínio O. Santos, Paulo Mondek
    A family of partitions with attached parts and 'N copies of N'. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:213-222 [Journal]
    
17. Robert Tijdeman
    Fraenkel's conjecture for six sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:223-234 [Journal]
    
18. Winston C. Yang
    Derivatives are essentially integer partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:235-245 [Journal]
    
19. Maria Axenovich
    A generalized Ramsey problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:247-249 [Journal]
    
20. Roberto Cignoli, Antoni Torrens
    Free Stone algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:251-257 [Journal]
    
21. David Damanik, Douglas Zare
    Palindrome complexity bounds for primitive substitution sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:259-267 [Journal]
    
22. Gregory Gutin, Meike Tewes, Anders Yeo
    Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:269-274 [Journal]
    
23. Peter Horák, Ladislav Stacho
    A lower bound on the number of hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:275-280 [Journal]
    
24. Jixiang Meng, Jianzhong Wang
    A classification of 2-arc-transitive circulant digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:281-284 [Journal]
    
25. Tsuyoshi Nishimura
    On 1-factors and matching extension. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:285-290 [Journal]
    
26. Carl G. Wagner
    The Carlitz lattice path polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:291-298 [Journal]