1. A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity

   • Matthias Kriesell

   Pages: 1 - 30

2. On the Hamilton-Waterloo Problem

   • Peter Adams
   • Elizabeth J. Billington
   • Saad I. El-Zanati

   Pages: 31 - 51

3. The Moore Bound for Irregular Graphs

   • Noga Alon
   • Shlomo Hoory
   • Nathan Linial

   Pages: 53 - 57

4. Shattering News

   • R.P. Anstee
   • Lajos Rónyai
   • Attila Sali

   Pages: 59 - 73

5. Edge Maximal Non-Bipartite Graphs Without Odd Cycles of Prescribed Lengths

   • Louis Caccetta
   • Rui-Zhong Jia

   Pages: 75 - 92

6. Enumerating Foldings and Unfoldings Between Polygons and Polytopes

   • Erik D. Demaine
   • Martin L. Demaine
   • Joseph O'Rourke

   Pages: 93 - 104

7. The Diameters of Some Transition Graphs Constructed from Hamilton Cycles

   • Mariko Hagita
   • Yoshiaki Oda
   • Katsuhiro Ota

   Pages: 105 - 117

8. n-Tuple Coloring of Planar Graphs with Large Odd Girth

   • William Klostermeyer
   • Cun Quan Zhang

   Pages: 119 - 132

9. Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

   • Matthias Kriesell

   Pages: 133 - 146

10. Group Chromatic Number of Graphs without K5-Minors

    • Hong-Jian Lai
    • Xiankun Zhang

    Pages: 147 - 154

11. A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths

    • Uwe Leck

    Pages: 155 - 167

12. Balanced Convex Partitions of Measures in ℝ2

    • Toshinori Sakai

    Pages: 169 - 192

13. A Fan Type Condition For Heavy Cycles in Weighted Graphs

    • Shenggui Zhang
    • Hajo Broersma
    • Ligong Wang

    Pages: 193 - 200