1. Connected Factors in Graphs – a Survey

   • Mekkia Kouider
   • Preben Dahl Vestergaard

   OriginalPaper Pages: 1 - 26

2. Vertices of Degree 5 in a Contraction Critically 5-connected Graph

   • Kiyoshi Ando
   • Atsushi Kaneko
   • Ken-ichi Kawarabayashi

   OriginalPaper Pages: 27 - 37

3. Minimally k-Edge-Connected Directed Graphs of Maximal Size

   • Alex R. Berg
   • Tibor Jordán

   OriginalPaper Pages: 39 - 50

4. The Flagged Cauchy Determinant

   • William Y. C. Chen
   • Christian Krattenthaler
   • Arthur L. B. Yang

   OriginalPaper Pages: 51 - 62

5. On the Total Domination Number of Cartesian Products of Graphs

   • Michael A. Henning
   • Douglas F. Rall

   OriginalPaper Pages: 63 - 69

6. 3-Wise Exactly 1-Intersecting Families of Sets

   • Zsolt Katona

   OriginalPaper Pages: 71 - 76

7. Spanning Trails Connecting Given Edges

   • Hong-Jian Lai
   • Xiangwen Li
   • Yongbin Ou

   OriginalPaper Pages: 77 - 88

8. The Crossing Number of C(mk;{1, k})

   • Xiaohui Lin
   • Yuansheng Yang
   • Xin Hao

   OriginalPaper Pages: 89 - 96

9. One-dimensional Tilings Using Tiles with Two Gap Lengths

   • Tomoki Nakamigawa

   OriginalPaper Pages: 97 - 105

10. Euler Tours of Maximum Girth in K_{2 n +1} and K_{2 n ,2 n}

    • Natalia Oksimets

    OriginalPaper Pages: 107 - 118

11. Graphs of Large Girth with Prescribed Partial Circular Colourings

    • Zhishi Pan
    • Xuding Zhu

    OriginalPaper Pages: 119 - 129

12. On the Nonembeddability and Crossing Numbers of Some Kleinical Polyhedral Maps on the Torus

    • Adrian Riskin

    OriginalPaper Pages: 131 - 135

13. A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs

    • Liming Xiong
    • Roman Kužel

    OriginalPaper Pages: 137 - 144