1. Decomposing the complete graph into cycles of many lengths

   • Darryn E. Bryant
   • Peter Adams

   OriginalPaper Pages: 97 - 102

2. A matrix equation for association schemes

   • L. Chihara
   • D. Stanton

   OriginalPaper Pages: 103 - 108

   

3. The Ulam number of infinite graphs

   • Kiran B. Chilakamarri
   • Nathaniel Dean

   OriginalPaper Pages: 109 - 120

4. Right angle free subsets in the plane

   • B. Gamble
   • W. Pulleyblank
   • B. Shepherd

   OriginalPaper Pages: 121 - 129

5. Minimum order of loop networks of given degree and girth

   • Y. O. Hamidoune
   • A. S. Llado
   • O. Serra

   OriginalPaper Pages: 131 - 138

6. A remark on bipartite distance-regular graphs of even valency

   • K. Nomura

   OriginalPaper Pages: 139 - 140

   

7. 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs

   • Haruko Okamura

   OriginalPaper Pages: 141 - 170

8. Recognizing bull-free perfect graphs

   • Bruce Reed
   • Najiba Sbihi

   OriginalPaper Pages: 171 - 178

9. What we know and what we do not know about Turán numbers

   • Alexander Sidorenko

   OriginalPaper Pages: 179 - 199

10. Kite-freeP- andQ-polynomial schemes

    • Chih-Wen Weng

    OriginalPaper Pages: 201 - 207