Journals in DBLP

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

1. Stefka Bouyuklieva
   Some optimal self-orthogonal and self-dual codes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:1-10 [Journal]
   
2. Zhibo Chen
   On k-pairable graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:11-15 [Journal]
   
3. Michel Grabisch
   The Möbius transform on symmetric ordered structures and its application to capacities on finite sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:17-34 [Journal]
   
4. H. K. Hsiao, S. S. Yu, Yu-Kuang Zhao
   Word-paired catenations of regular languages. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:35-43 [Journal]
   
5. Mehri Javanian, Hosam M. Mahmoud, Mohammad Vahidi-Asl
   Paths in m-ary interval trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:45-53 [Journal]
   
6. L. Ji
   On the 3BD-closed set B₃( 4, 5 ). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:55-67 [Journal]
   
7. Rao Li
   Hamiltonicity of 2-connected K_{1, 4}, K_{1, 4+e}-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:69-76 [Journal]
   
8. Gérard Maze
   Partitions modulo n and circulant matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:77-84 [Journal]
   
9. John P. McSorley, Thomas Dale Porter
   Generating sequences of clique-symmetric graphs via Eulerian digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:287, n:1-3, pp:85-91 [Journal]
   
10. Jérôme Renault
    View-obstruction: a shorter proof for 6 lonely runners. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:93-101 [Journal]
    
11. Jichang Wu, Xueliang Li, Lusheng Wang
    Removable edges in a cycle of a 4-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:103-111 [Journal]
    
12. Ming Yao Xu, Young-Gheel Baik, Hyo-Seob Sim
    Arc-transitive circulant digraphs of odd prime-power order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:113-119 [Journal]
    
13. Ken-ichi Kawarabayashi
    Rooted minor problems in highly connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:121-123 [Journal]
    
14. Padmavathamma, R. Raghavendra, B. M. Chandrashekara
    A new bijective proof of a partition theorem of K. Alladi. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:125-128 [Journal]
    
15. Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton
    Restricted permutations and queue jumping. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:129-133 [Journal]
    
16. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
    Characterizing 2k-critical graphs and n-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:135-139 [Journal]
    
17. Gilbert B. Cagaanan, Sergio R. Canoy Jr.
    On the hull sets and hull number of the cartesian product of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:141-144 [Journal]
    
18. Jordan Carlson, Daniel Stolarski
    The correct solution to Berlekamp's switching game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:145-150 [Journal]
    
19. Amine El Sahili
    Paths with two blocks in k-chromatic digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:151-153 [Journal]
    
20. Dae San Kim, Dong Chan Kim
    Character sums and MacWilliams identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:155-160 [Journal]
    
21. Daniel Král
    Hajós' theorem for list coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:161-163 [Journal]
    
22. Terry A. McKee
    Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:165-170 [Journal]
    
23. Michael D. Plummer, Xiaoya Zha
    On the p-factor-criticality of the Klein bottle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:171-175 [Journal]
    
24. Yidong Sun
    The statistic "number of udu's" in Dyck paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:177-186 [Journal]
    
25. Raphael Yuster
    The number of edge-disjoint transitive triples in a tournament. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:187-191 [Journal]
    
26. Lutz Volkmann
    The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:193-194 [Journal]