1. Factorizations of the Complete Graph into C ₅-Factors and 1-Factors

   • Peter Adams
   • Darryn Bryant
   • Heather Gavlas

   OriginalPaper Pages: 289 - 296

2. 0-Dual Closures for Several Classes of Graphs

   • Ahmed Ainouche
   • Ingo Schiermeyer

   OriginalPaper Pages: 297 - 307

3. Links between the Slater Index and the Ryser Index of Tournaments

   • Irène Charon
   • Olivier Hudry

   OriginalPaper Pages: 309 - 322

4. On Ranks of Matrices Associated with Trees

   • Guantao Chen
   • Frank J. Hall
   • Bing Wei

   OriginalPaper Pages: 323 - 334

5. Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index

   • C.J. Colbourn
   • A. Rosa

   OriginalPaper Pages: 335 - 345

6. Robust Algorithms for the Stable Set Problem

   • Michael U. Gerber
   • Vadim V. Lozin

   OriginalPaper Pages: 347 - 356

7. Some Remarks on the Convexity Number of a Graph

   • John Gimbel

   OriginalPaper Pages: 357 - 361

8. Characters of Association Schemes and Normal Closed Subsets

   • Akihide Hanaki

   OriginalPaper Pages: 363 - 369

9. The Number of Columns (1,k−2,1) in the Intersection Array of a Distance-Regular Graph

   • Akira Hiraki

   OriginalPaper Pages: 371 - 387

10. A Theorem About Elementary Cuts and Flow Polynomials

    • Martin Kochol

    OriginalPaper Pages: 389 - 392

11. Edge Coloring of Embedded Graphs with Large Girth

    • Xuechao Li
    • Rong Luo

    OriginalPaper Pages: 393 - 401

12. Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture

    • T.S. Michael
    • William N. Traves

    OriginalPaper Pages: 403 - 411

13. Diagonal Flips in Hamiltonian Triangulations on the Sphere

    • Ryuichi Mori
    • Atsuhiro Nakamoto
    • Katsuhiro Ota

    OriginalPaper Pages: 413 - 418

14. An Analogue of Hajós' Theorem for the Circular Chromatic Number (II)

    • Xuding Zhu

    OriginalPaper Pages: 419 - 432