BBC17
Edited by D.R. Woodall

Douglas R. Woodall Preface	1-2
V. Abatangelo, G. Korchmáros and B. Larato Transitive parabolic unitals in translation planes of odd order	3-10
R.J.R. Abel, F.E. Bennett, H. Zhang and L. Zhu Steiner pentagon covering designs	11-26
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and A. Khodkar The µ-way intersection problem for m-cycle systems	27-56
F. Aguiló and I. Diego Discrete dynamics over double commutative-step digraphs	57-72
R.E.L. Aldred and Michael D. Plummer On restricted matching extension in planar graphs	73-79
David Bedford, M.A. Ollis and Roger M. Whitaker On bipartite tournaments balanced with respect to carry-over effects for both teams	81-87
David Bedford and Roger M. Whitaker Bounds on the maximum number of Latin squares in a mutually quasi-orthogonal set	89-96
Halina Bielak Roots of chromatic polynomials	97-102
Anthony Bonato and Kathie Cameron On an adjacency property of almost all graphs	103-119
Robin Chapman An involution on derangements	121-122
E.J. Cockayne, O. Favaron, P.J.P. Grobler, C.M. Mynhardt and J. Puech Ramsey properties of generalised irredundant sets in graphs	123-134
P. Erdös, R.J. Faudree, R.J. Gould, M.S. Jacobson and J. Lehel Edge disjoint monochromatic triangles in 2-colored graphs	135-141
Odile Favaron, Michael A. Henning, Joël Puech and Dieter Rautenbach On domination and annihilation in graphs with claw-free blocks	143-151
R.M. Figueroa-Centeno, R. Ichishima and F.A. Muntaner-Batle The place of super edge-magic labelings among other classes of labelings	153-168
W.L. Fouché, L.M. Pretorius and C.J. Swanepoel Partitions of factorisations of parameter words	169-175
J. Gimbert Enumeration of almost Moore digraphs of diameter two	177-190
Ronald J. Gould and Michael S. Jacobson Two-factors with few cycles in claw-free graphs	191-197
M.J. Grannell, T.S. Griggs and F.C. Holroyd Modular gracious labellings of trees	199-219
P.J.P. Grobler and C.M. Mynhardt Domination parameters and edge-removal-critical graphs	221-239
Heiko Harborth and Ingrid Mengersen Ramsey numbers in octahedron graphs	241-246
Lars Hellström Algebraic dependence of commuting differential operators	247-252
A.J.W. Hilton, T. Slivnik and D.S.G. Stirling Aspects of edge list-colourings	253-264
Thomas Honold and Ivan Landjev On arcs in projective Hjelmslev planes	265-278
Jing Huang, Gary MacGillivray and Kathryn L.B. Wood Pushing the cycles out of multipartite tournaments	279-287
Leif K. Jørgensen Directed strongly regular graphs with mu=lambda	289-293
A.D. Keedwell A characterization of the Jacobi logarithms of a finite field	295-302
D. Labbate On 3-cut reductions of minimally 1-factorable cubic bigraphs	303-310
Guizhen Liu and Qinglin Yu Generalization of matching extensions in graphs	311-320
Per Håkan Lundow Compression of transfer matrices	321-329
G. MacGillivray and A. Rodriguez The achromatic number of the union of paths	331-335
Sònia P. Mansilla and Oriol Serra Construction of k-arc transitive digraphs	337-349
J.P. Morgan, D.A. Preece and D.H. Rees Nested balanced incomplete block designs	351-389
S. Perkins and A.E. Escott Extended synchronizing codewords for q-ary complete prefix codes	391-401
N.C.K. Phillips Finding tight single-change covering designs with v=20, k=5	403-409
Dieter Rautenbach On vertex orderings and the stability number in triangle-free graphs	411-420
Robert Shrock Chromatic polynomials and their zeros and asymptotic limits for families of graphs	421-446
Angelo Sonnino One-factorizations of complete multigraphs arising from maximal (k;n)-arcs in PG(2,2h)	447-451
Meike Tewes and Lutz Volkmann The ratio of the longest cycle and longest path in semicomplete multipartite digraphs	453-457
Kazuhiko Ushio and Yoshikazu Ohtsubo check{K}p,q-factorization of symmetric complete tripartite digraphs	459-467
Research problems	469-478

© Copyright 2001, Elsevier Science, All rights reserved.