Journals in DBLP

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

1. Douglas R. Woodall
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:1-0 [Journal]
   
2. 
   Guest editor listing. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:3-0 [Journal]
   
3. Moncef Abbas, Sadek Bouroubi
   On new identities for Bell's polynomials. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:5-10 [Journal]
   
4. Ian Anderson, Leigh H. M. Ellison
   Z-cyclic ordered triplewhist tournaments on p elements, where p=5 (mod 8). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:11-17 [Journal]
   
5. Ian Anderson, Norman J. Finizio
   Some new Z-cyclic whist tournament designs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:19-28 [Journal]
   
6. Ian Anderson, Donald A. Preece
   Some power-sequence terraces for Z_pq with as few segments as possible. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:29-59 [Journal]
   
7. Kiyoshi Ando
   Trivially noncontractible edges in a contraction critically 5-connected graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:61-72 [Journal]
   
8. R. A. Bailey
   Balanced colourings of strongly regular graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:73-90 [Journal]
   
9. Peter J. Cameron, Ian M. Wanless
   Covering radius for sets of permutations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:91-109 [Journal]
   
10. Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel
    Ramsey degrees of bipartite graphs: A primitive recursive proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:111-119 [Journal]
    
11. Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian
    On the size of the minimum critical set of a Latin square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:121-127 [Journal]
    
12. Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar
    Generalized subgraph-restricted matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:129-138 [Journal]
    
13. M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara
    On the Steiner, geodetic and hull numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:139-154 [Journal]
    
14. Fred C. Holroyd, Claire Spencer, John M. Talbot
    Compression and Erdo"s-Ko-Rado graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:155-164 [Journal]
    
15. Fred C. Holroyd, John M. Talbot
    Graphs with the Erdös-Ko-Rado property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:165-176 [Journal]
    
16. Leif K. Jørgensen
    Girth 5 graphs from relative difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:177-184 [Journal]
    
17. Nicolas Lichiardopol
    Independence number of iterated line digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:185-193 [Journal]
    
18. Tatsuya Maruta
    Extendability of quaternary linear codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:195-203 [Journal]
    
19. Philip Maynard, Johannes Siemons
    Efficient reconstruction of partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:205-211 [Journal]
    
20. Nicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis
    The seven classes of 5×6 triple arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:213-218 [Journal]
    
21. José Luis Ruiz, Mercè Mora
    De Bruijn and Kautz digraphs of a rooted tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:219-236 [Journal]
    
22. Karen Seyffarth, Chengde Wang
    On eulerian and regular perfect path double covers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:237-250 [Journal]
    
23. Rueiher Tsaur
    The Baillon-Simons theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:251-261 [Journal]
    
24. Timothy R. Walsh
    Efficient enumeration of sensed planar maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:263-289 [Journal]
    
25. Igor E. Zverovich, Vadim E. Zverovich
    Basic perfect graphs and their extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:291-311 [Journal]
    
26. Peter J. Cameron
    Research problems from the 19th British Combinatorial Conference. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:313-320 [Journal]