1. Removable edges in cyclically 4-edge-connected cubic graphs

   • Lars Døvling Andersen
   • Herbert Fleischner
   • Bill Jackson

   OriginalPaper Pages: 1 - 21

2. On the euclidean dimension of a wheel

   • Fred Buckley
   • Frank Harary

   OriginalPaper Pages: 23 - 30

3. Rigid pentagons in hypercubes

   • M. Deza
   • N. M. Singhi

   OriginalPaper Pages: 31 - 42

4. Embedding of trees in euclidean spaces

   • H. Maehara
   • J. Reiterman
   • E. Šiňajová

   OriginalPaper Pages: 43 - 47

5. Survival under random coverings of trees

   • A. Meir
   • J. W. Moon

   OriginalPaper Pages: 49 - 65

6. Divisions of symmetric designs into two parts

   • Alan Rahilly

   OriginalPaper Pages: 67 - 73

7. On natural isomorphisms of cycle permutation graphs

   • Sam Stueckle

   OriginalPaper Pages: 75 - 85

8. Balanced sets andQ-polynomial association schemes

   • Paul Terwilliger

   OriginalPaper Pages: 87 - 94

9. Stronger players win more balanced knockout tournaments

   • Robert Chen
   • F. K. Hwang

   OriginalPaper Pages: 95 - 99

10. On the independent queens covering problem

    • E. J. Cockayne
    • P. H. Spencer

    OriginalPaper Pages: 101 - 110

11. C _k -factorization of complete bipartite graphs

    • Hikoe Enomoto
    • Takashi Miyamoto
    • Kazuhiko Ushio

    OriginalPaper Pages: 111 - 113

12. Matchings and covers in hypergraphs

    • Zoltán Füredi

    OriginalPaper Pages: 115 - 206

13. Repeated distances in space

    • David Avis
    • Paul Erdös
    • János Pach

    OriginalPaper Pages: 207 - 217

14. On distance-regular graphs with fixed valency, II

    • Eiichi Bannai
    • Tatsuro Ito

    OriginalPaper Pages: 219 - 228

15. The chromatic connectivity of graphs

    • C. D. Godsil
    • R. Nowakowski
    • J. Nešetřil

    OriginalPaper Pages: 229 - 233

16. The line digraph of a regular and pancircular digraph is also regular and pancircular

    • Masatosi Imori
    • Makoto Matsumoto
    • Hisao Yamada

    OriginalPaper Pages: 235 - 239

17. Orthogonal resolutions in odd balanced tournament designs

    • E. R. Lamken
    • S. A. Vanstone

    OriginalPaper Pages: 241 - 255

18. Structural theorems for submodular functions, polymatroids and polymatroid intersections

    • Masataka Nakamura

    OriginalPaper Pages: 257 - 284

19. Irregular, extremal perfect systems of difference sets II

    • D. G. Rogers

    OriginalPaper Pages: 285 - 295

20. On a series of Hadamard matrices of order 2 ^t and the maximal excess of Hadamard matrices of order 2^2t

    • Mieko Yamada

    OriginalPaper Pages: 297 - 301

21. Every 8-uniform 8-regular hypergraph is 2-colorable

    • N. Alon
    • Z. Bregman

    OriginalPaper Pages: 303 - 306

22. Algorithmic aspects of intersection graphs and representation hypergraphs

    • Martin Charles Golumbic

    OriginalPaper Pages: 307 - 321

23. Combinatorial geometries representable over GF(3) and GF(q). II. Dowling geometries

    • Joseph P. S. Kung
    • James G. Oxley

    OriginalPaper Pages: 323 - 332

24. The number of contractible edges in 3-connected graphs

    • Katsuhiro Ota

    OriginalPaper Pages: 333 - 354

25. New Hadamard matrices and conference matrices obtained via Mathon's construction

    • Jennifer Seberry
    • Albert Leon Whiteman

    OriginalPaper Pages: 355 - 377

26. Bigeodetic graphs

    • N. Srinivasan
    • J. Opatrny
    • V. S. Alagar

    OriginalPaper Pages: 379 - 392

27. Finding defective coins

    • L. Pyber

    Research Problems Pages: 393 - 394