Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] José G. Mijares Parametrizing the abstract Ellentuck theorem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:2, pp:216-225 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Shengbiao Hu The largest eigenvalue of unicyclic graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:2, pp:280-284 [Journal ] 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 ] 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 ] 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 ]