Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 9-10

1. Davide Baccherini, Donatella Merlini, Renzo Sprugnoli
   Binary words excluding a pattern and proper Riordan arrays. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1021-1037 [Journal]
   
2. Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
   New exact values of the maximum size of graphs free of topological complete subgraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1038-1046 [Journal]
   
3. T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng
   The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1047-1053 [Journal]
   
4. Peter Couperus
   Circulant covers of trivalent circulants. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1054-1064 [Journal]
   
5. Murilo Vicente Gonçalves da Silva, Kristina Vuskovic
   Triangulated neighborhoods in even-hole-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1065-1073 [Journal]
   
6. Michelle R. DeDeo, Dominic Lanphier, Marvin Minei
   The spectrum of Platonic graphs over finite fields. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1074-1081 [Journal]
   
7. Arturas Dubickas
   On a sequence related to that of Thue-Morse and its applications. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1082-1093 [Journal]
   
8. Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
   Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal]
   
9. Ronald J. Gould, John R. Schmitt
   Minimum degree and the minimum size of K₂²-saturated graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:9-10, pp:1108-1114 [Journal]
   
10. Michael A. Henning, Preben D. Vestergaard
    Domination in partitioned graphs with minimum degree two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1115-1135 [Journal]
    
11. S. S. Kamath, R. S. Bhat
    On strong (weak) independent sets and vertex coverings of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1136-1145 [Journal]
    
12. Esamel M. Paluga, Sergio R. Canoy Jr.
    Monophonic numbers of the join and composition of connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1146-1154 [Journal]
    
13. Shane P. Redmond
    On zero-divisor graphs of small finite commutative rings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1155-1166 [Journal]
    
14. Jian-Hua Yin, Jiong-Sheng Li
    Potentially K_{r1, r2, ..., rl, r, s}-graphic sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1167-1177 [Journal]
    
15. Xinhui An, Baoyindureng Wu
    Hamiltonicity of complements of middle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1178-1184 [Journal]
    
16. George E. Andrews, James A. Sellers
    On Sloane's generalization of non-squashing stacks of boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1185-1190 [Journal]
    
17. Anthony B. Evans
    Representations of disjoint unions of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1191-1198 [Journal]
    
18. Vladimir Gurvich
    On the misere version of game Euclid and miserable games. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1199-1204 [Journal]
    
19. MingChu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai
    Quadrangularly connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1205-1211 [Journal]
    
20. Frédéric Maffray, Dieter Rautenbach
    Small step-dominating sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1212-1215 [Journal]
    
21. Hong-Jian Lai, Xiangjuan Yao
    Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1217- [Journal]
    
22. Simon R. Blackburn, Igor Shparlinski
    Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1218-1219 [Journal]