Journals in DBLP

Graphs and Combinatorics
2005, volume: 21, number: 1

1. Mekkia Kouider, Preben D. Vestergaard
   Connected Factors in Graphs - a Survey. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:1-26 [Journal]
   
2. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
   Vertices of Degree 5 in a Contraction Critically 5-connected Graph. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:27-37 [Journal]
   
3. Alex R. Berg, Tibor Jordán
   Minimally k-Edge-Connected Directed Graphs of Maximal Size. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:39-50 [Journal]
   
4. William Y. C. Chen, Christian Krattenthaler, Arthur L. B. Yang
   The Flagged Cauchy Determinant. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:51-62 [Journal]
   
5. Michael A. Henning, Douglas F. Rall
   On the Total Domination Number of Cartesian Products of Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:63-69 [Journal]
   
6. Zsolt Katona
   3-Wise Exactly 1-Intersecting Families of Sets. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:71-76 [Journal]
   
7. Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou
   Spanning Trails Connecting Given Edges. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:77-88 [Journal]
   
8. Xiaohui Lin, Yuansheng Yang, Jianguo Lü, Xin Hao
   The Crossing Number of C(mk;{1, k}). [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:89-96 [Journal]
   
9. Tomoki Nakamigawa
   One-dimensional Tilings Using Tiles with Two Gap Lengths. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:1, pp:97-105 [Journal]
   
10. Natalia Oksimets
    Euler Tours of Maximum Girth in K_2n+1 and K_{2n, 2n}. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:1, pp:107-118 [Journal]
    
11. Zhishi Pan, Xuding Zhu
    Graphs of Large Girth with Prescribed Partial Circular Colourings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:1, pp:119-129 [Journal]
    
12. Adrian Riskin
    On the Nonembeddability and Crossing Numbers of Some Kleinical Polyhedral Maps on the Torus. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:1, pp:131-135 [Journal]
    
13. Liming Xiong, Roman Kuzel
    A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:1, pp:137-144 [Journal]