Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 2

1. Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
   Connectivity of graphs with given girth pair. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:155-162 [Journal]
   
2. Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin
   Nonrepetitive colorings of trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:163-172 [Journal]
   
3. Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
   On defining numbers of circular complete graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:173-180 [Journal]
   
4. Zdenek Dvorak, Riste Skrekovski, T. Valla
   Four gravity results. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:181-190 [Journal]
   
5. Jonathan David Farley
   A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:191-198 [Journal]
   
6. Arnfried Kemnitz, Massimiliano Marangio
   [r, s, t]-Colorings of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:199-207 [Journal]
   
7. Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
   Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:208-215 [Journal]
   
8. José G. Mijares
   Parametrizing the abstract Ellentuck theorem. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:216-225 [Journal]
   
9. William P. Orrick, Bruce Solomon
   Large-determinant sign matrices of order 4k+1. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:226-236 [Journal]
   
10. Iwao Sato
    Zeta functions and complexities of a semiregular bipartite graph and its line graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:237-245 [Journal]
    
11. Yingshan Zhang
    Orthogonal arrays obtained by repeating-column difference matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:246-261 [Journal]
    
12. Mustapha Aouchiche, Pierre Hansen
    On a conjecture about the Randic index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:262-265 [Journal]
    
13. L. Sunil Chandran, Naveen Sivadasan
    On the Hadwiger's conjecture for graph products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:266-273 [Journal]
    
14. Masahiro Hachimori, Kenji Kashiwabara
    On the topology of the free complexes of convex geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:274-279 [Journal]
    
15. Shengbiao Hu
    The largest eigenvalue of unicyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:280-284 [Journal]
    
16. Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    On the spanning connectivity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:285-289 [Journal]
    
17. Lingsheng Shi
    The tail is cut for Ramsey numbers of cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:290-292 [Journal]
    
18. Zhao Zhang, Jinjiang Yuan
    Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:293-298 [Journal]