Combinatorial Mathematics X

Hamiltonian cayley graphs of order PQ.- The weil conjectures in finite geometry.- Cycles in graphs.- Sequenceable groups, generalized complete mappings, neofields and block designs.- Clique coverings of graphs A survey.- Room squares and subsquares.- Geometries in finite projective spaces : Recent results.- A canonical form for incidence matrices of finite projective planes and their associated latin squares and planar ternary rings.- On clique covering numbers of cubic graphs.- Modelling competitions by poset multiplication.- Decomposition of block designs: Computational issues.- A combinatorial problem and the generalized cosh.- Generalised hadamard matrices whose rows and columns form a group.- The asymptotic connectivity of labelled coloured regular bipartite graphs.- Kronecker products of systems of orthogonal designs.- Kronecker products of systems of higher dimensional orthogonal designs.- Two new sequences of ovals in finite desarguesian planes of even order.- Stochastic processes and combinatoric identities.- Families enumerated by the schrder-etherington sequence and a renewal array it generates.- Classifying and enumerating some freely generated families of objects.- Composite graphs with edge stability index one.- A number-theoretical note on Cornish's paper.- On the automorphisms of rooted trees with height distributions.- On partially transitive planes of hughes type (6,m).- Embedding incomplete idempotent latin squares.- The completion of partial f-squares.- Baer subspaces in the n dimensional projective space.- Distribution of labelled trees by diameter.- Orthogonal latin squares with small subsquares.- k-sets of (n?1)-dimensional subspaces of PG(3n?1,q).- Subtrees of large tournaments.